Let $r$ and $k$ be positive integers with $r \mid k$. Denote by $S_{\mathrm{\mathfrak{z}}}(k;r)$ the minimum integer $n$ such that every coloring $χ:[1,n] \rightarrow \{0,1,\dots,r-1\}$ admits a solution to $\sum_{i=1}^{k-1} x_i = x_k$ with $\sum_{i=1}^{k} χ(x_i) \equiv 0 \,(\mathrm{mod }\,r)$. We give some formulas and lower bounds for various instances.
Young's lattice, the lattice of all Young diagrams, has the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard Young tableaux with the same shape. Fomin introduced generalized Schur operators to generalize the Robinson-Schensted-Knuth correspondence. In this sense, generalized Schur operators are generalizations of semi-standard Young tableaux. We define a generalization of Schur polynomials as expansion coefficients of generalized Schur operators. We show that the commutating relation of generalized Schur operators implies Pieri's f…
In the literature there are several determinant formulas for Schur functions: the Jacobi-Trudi formula, the dual Jacobi-Trudi formula, the Giambelli formula, the Lascoux-Pragacz formula, and the Hamel-Goulden formula, where the Hamel-Goulden formula implies the others. In this paper we use an identity proved by Bazin in 1851 to derive determinant identities involving Macdonald's 9th variation of Schur functions. As an application we prove a determinant identity for factorial Schur functions conjectured by Morales, Pak, and Panova. We also obtain a generalization of the Hamel-Goulden formula, w…
Young's lattice is a prototypical example of differential posets. Differential posets have the Robinson correspondence, the correspondence between permutations and pairs of standard tableaux with the same shape, as in the case of Young's lattice. Fomin introduced generalized Schur operators to generalize the method of Robinson correspondence in differential posets to the Robinson-Schensted-Knuth correspondence, the correspondence between certain matrices and pairs of semi-standard tableaux with the same shape. In this paper, we introduce operators on the vector space whose basis is the set of …
We obtain a common generalization of two types of Sylvester formulas for compound determinants and its Pfaffian analogue. As applications, we give generalizations of the Giambelli identity to skew Schur functions and the Schur identity to Schur's skew $Q$-functions.
We define a fat staircase to be a Ferrers diagram corresponding to a partition of the form $(n^{α_n}, {n-1}^{α_{n-1}},..., 1^{α_1})$, where $α= (α_1,...,α_n)$ is a composition, or the $180^\circ$ rotation of such a diagram. If a diagram's skew Schur function is a linear combination of Schur functions of fat staircases, we call the diagram a sum of fat staircases. We prove a Schur-positivity result that is obtained each time we augment a sum of fat staircases with a skew diagram. We also determine conditions on which diagrams can be sums of fat staircases, including necessary and sufficient con…
We define a number of related combinatorial objects, each of which possesses a surprising symmetry. We include several applications such as a combinatorial explanation for certain fixed points of the involution $ω$ on the ring of symmetric functions, as well as a relationship between certain skew Schur functions and skew $Q$-Schur functions. We give a $t$-deformation of these $Q$-Schur functions, and show that it is Schur positive, including a combinatorial description of the Schur coefficients. A corollary of our results is the equality of skew $Q$-Schur functions: $Q_{λ+δ/μ+ δ}=Q_{λ'+δ/μ' + …
We give a Pieri-type formula for the sum of $K$-$k$-Schur functions $\sum_{μ\leλ} g^{(k)}_μ$ over a principal order ideal of the poset of $k$-bounded partitions under the strong Bruhat order, which sum we denote by $\widetilde{g}^{(k)}_λ$. As an application of this, we also give a $k$-rectangle factorization formula $\widetilde{g}^{(k)}_{R_t\cupλ}=\widetilde{g}^{(k)}_{R_t} \widetilde{g}^{(k)}_λ$ where $R_t=(t^{k+1-t})$, analogous to that of $k$-Schur functions $s^{(k)}_{R_t\cupλ}=s^{(k)}_{R_t}s^{(k)}_λ$.
An $S$-ring (Schur ring) is called central if it is contained in the center of the group ring. We introduce the notion of a generalized Schur group, i.e. such finite group that all central $S$-rings over this group are schurian. It generalizes in a natural way the notion of a Schur group and they are equivalent for abelian groups. We establish basic properties and provide infinite families of nonabelian generalized Schur groups
The solution to the problem of finding the minimum number of monochromatic triples $(x,y,x+ay)$ with $a\geq 2$ being a fixed positive integer over any 2-coloring of $[1,n]$ was conjectured by Butler, Costello, and Graham (2010) and Thanathipanonda (2009). We solve this problem using a method based on Datskovsky's proof (2003) on the minimum number of monochromatic Schur triples $(x,y,x+y)$. We do this by exploiting the combinatorial nature of the original proof and adapting it to the general problem.
The recently developed theory of Schur rings over a finite cyclic group is generalized to Schur rings over a ring R being a product of Galois rings of coprime characteristics. It is proved that if the characteristic of R is odd, then as in the cyclic group case any pure Schur ring over R is the tensor product of a pure cyclotomic ring and Schur rings of rank 2 over non-fields. Moreover, it is shown that in contrast to the cyclic group case there are non-pure Schur rings over R that are not generalized wreath products.
Let $S_{\mathfrak{z}}(k,r)$ be the least positive integer such that for any $r$-coloring $χ: \{1,2,\dots,S_{\mathfrak{z}}(k,r)\} \longrightarrow \{1, 2, \dots, r\}$, there is a sequence $x_1, x_2, \dots, x_k$ such that $\sum_{i=1}^{k-1} x_i = x_k$, and $\sum_{i=1}^{k} χ(x_i) \equiv 0 \pmod{r}$. We show that when $k$ is greater than $r$, $kr - r - 1 \le S_{\mathfrak{z}}(k,r) \le kr - 1$, and when $r$ is an odd prime, $S_{\mathfrak{z}}(k,r)$ is in fact equal to $kr - r$.
We present new determinant expressions for regularized Schur multiple zeta values. These generalize the known Jacobi-Trudi formulae and can be used to quickly evaluate certain types of Schur multiple zeta values. Using these formulae we prove that every Schur multiple zeta value with alternating entries in 1 and 3 can be written as a polynomial in Riemann zeta values. Furthermore, we give conditions on the shape, which determine when such Schur multiple zetas are polynomials purely in odd or in even Riemann zeta values.
We consider families of quasisymmetric functions with the property that if a symmetric function $f$ is a positive sum of functions in one of these families, then f is necessarily a positive sum of Schur functions. Furthermore, in each of the families studied, we give a combinatorial description of the Schur coefficients of $f$. We organize six such families into a poset, where functions in higher families in the poset are always positive integer sums of functions in each of the lower families. This poset includes the Schur functions, the quasisymmetric Schur functions, the fundamental quasisym…
This article provides new lower bounds for both Schur and weak Schur numbers by exploiting a "template"-based approach. The concept of "template" is also generalized to weak Schur numbers. Finding new templates leads to explicit partitions improving lower bounds as well as the growth rate for Schur numbers, weak Schur numbers, and multicolor Ramsey numbers $R_n(3)$. The new lower bounds include $S(9) \geq 17\,803$, $S(10) \geq 60\,948$, $\mathit{WS}(6) \geq 646$, $\mathit{WS}(9) \geq 22\,536$ and $\mathit{WS}(10) \geq 71\,256$.
Consider the equation $\mathcal{E}: x_1+ \cdots+x_{k-1} =x_{k}$ and let $k$ and $r$ be positive integers such that $r\mid k$. The number $S_{\mathfrak{z},2}(k;r)$ is defined to be the least positive integer $t$ such that for any 2-coloring $χ: [1, t] \to \{0, 1\}$ there exists a solution $(\hat{x}_1, \hat{x}_2, \ldots, \hat{x}_k)$ to the equation $\mathcal{E}$ satisfying $\displaystyle \sum_{i=1}^kχ(\hat{x}_i) \equiv 0\pmod{r}$. In a recent paper, the first author posed the question of determining the exact value of $S_{\mathfrak{z}, 2}(k;4)$. In this article, we solve this problem and show, m…
This paper proves a combinatorial rule giving all maximal and minimal partitions $λ$ such that the Schur function $s_λ$ appears in a plethysm of two arbitrary Schur functions. Determining the decomposition of these plethysms has been identified by Stanley as a key open problem in algebraic combinatorics. As corollaries we prove three conjectures of Agaoka on the partitions labelling the lexicographically greatest and least Schur functions appearing in an arbitrary plethysm. We also show that the multiplicity of the Schur function labelled by the lexicographically least constituent may be arbit…
We prove Stanley's conjecture that, if delta_n is the staircase shape, then the skew Schur functions s_{delta_n / mu} are non-negative sums of Schur P-functions. We prove that the coefficients in this sum count certain fillings of shifted shapes. In particular, for the skew Schur function s_{delta_n / delta_{n-2}}, we discuss connections with Eulerian numbers and alternating permutations.
This paper records some apparently new results for the partition of integer intervals [1, n] into weakly sum-free subsets. These were produced using a method closely related to that used by Schur in 1917. New lower bounds can be produced in this way for partitions of unlimited size. The asymptotic growth rate of the lower bounds, as the number of subsets increases, cannot be less than the same growth rate for strongly sum-free partitions, and therefore exceeds 3.27. Specific results for partitions into a 'small' number of subsets include $WS(6) \ge 642$, $WS(7) \ge 2146$, $WS(8) \ge 6976$, $WS…
Schur modules give the irreducible polynomial representations of the general linear group $\mathrm{GL}_t$. Viewing the symmetric group $\mathfrak{S}_t$ as a subgroup of $\mathrm{GL}_t$, we may restrict Schur modules to $\mathfrak{S}_t$ and decompose the result into a direct sum of Specht modules, the irreducible representations of $\mathfrak{S}_t$. We give an equivariant Möbius inversion formula that we use to invert this expansion in the representation ring for $\mathfrak{S}_t$ for $t$ large. In addition to explicit formulas in terms of plethysms, we show the coefficients that appear alternat…
Young's lattice is a partial order on integer partitions whose saturated chains correspond to standard Young tableaux, one type of combinatorial object that generates the Schur basis for symmetric functions. Generalizing Young's lattice, we introduce a new partial order on weak compositions that we call the key poset. Saturated chains in this poset correspond to standard key tableaux, the combinatorial objects that generate the key polynomials, a nonsymmetric polynomial generalization of the Schur basis. Generalizing skew Schur functions, we define skew key polynomials in terms of this new pos…
We first provide an explicit combinatorial description of the Auslander-Reiten quiver $Γ^Q$ of finite type $D$. Then we can investigate the categories of finite dimensional representations over the quantum affine algebra $U_q'(D^{(i)}_{n+1})$ $(i=1,2)$ and the quiver Hecke algebra $R_{D_{n+1}}$ associated to $D_{n+1}$ $(n \ge 3)$, by using the combinatorial description and the generalized quantum affine Schur-Weyl duality functor. As applications, we can prove that Dorey's rule holds for the category $\Rep(R_{D_{n+1}})$ and prove an interesting difference between multiplicity free positive roo…
The quiver Hecke algebra $R$ can be also understood as a generalization of the affine Hecke algebra of type $A$ in the context of the quantum affine Schur-Weyl duality by the results of Kang, Kashiwara and Kim. On the other hand, it is well-known that the Auslander-Reiten(AR) quivers $Γ_Q$ of finite simply-laced types have a deep relation with the positive roots systems of the corresponding types. In this paper, we present explicit combinatorial descriptions for the AR-quivers $Γ_Q$ of finite type $A$. Using the combinatorial descriptions, we can investigate relations between finite dimensiona…
We introduce a generalization of the Schur measure. And we give a combinatorial interpretation to this generalized measure and prove that a scaling limit for this measure is given by the Tracy-Widom distribution.
Let (G, +) be an abelian group. A subset of G is sumfree if it contains no elements x, y, z such that x +y = z. We extend this concept by introducing the Schur degree of a subset of G, where Schur degree 1 corresponds to sumfree. The classical inequality S(n) $\le$ R n (3) -- 2, between the Schur number S(n) and the Ramsey number R n (3) = R(3,. .. , 3), is shown to remain valid in a wider context, involving the Schur degree of certain subsets of G. Recursive upper bounds are known for R n (3) but not for S(n) so far. We formulate a conjecture which, if true, would fill this gap. Indeed, our s…
For any positive integers l and m, a set of integers is said to be (weakly) l-sum-free modulo m if it contains no (pairwise distinct) elements $x_1,x_2,...,x_l,y$ satisfying the congruence $x_1+\...+x_l\equiv y\bmod{m}$. It is proved that, for any positive integers k and l, there exists a largest integer $n$ for which the set of the first $n$ positive integers $\{1,2,\...,n\}$ admits a partition into k (weakly) l-sum-free sets modulo m. This number is called the generalized (weak) Schur number modulo $m$, associated with k and l. In this paper, for all positive integers k and l, the exact valu…
An expression is given for the plethysm $p_{2}\circ S_{\square}$, where $p_{2}$ is the power sum of degree two and $S_{\square}$ is the Schur function indexed by a rectangular partition. The formula can be well understood from the viewpoint of the basic representation of the affine Lie algebra of type $A_{2}^{(2)}$.
A set of functions is defined which is indexed by a positive integer $n$ and partitions of integers. The case $n=1$ reproduces the standard Schur polynomials. These functions are seen to arise naturally as a determinant of an action on the frame bundle of an infinite grassmannian. This fact is well known in the case of the Schur polynomials ($n=1$) and has been used to decompose the $τ$-functions of the KP hierarchy as a sum. In the same way, the new functions introduced here ($n>1$) are used to expand quotients of $τ$-functions as a sum with Plucker coordinates as coefficients.
This paper proves a combinatorial rule expressing the product $s_τ(s_{λ/μ} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur functions. This generalizes the SXP rule for the plethysm $s_λ\circ p_r$. Each step in the proof uses either an explicit bijection or a sign-reversing involution. The proof is inspired by an earlier proof of the SXP rule due to Remmel and Shimozono, A simple proof of the Littlewood--Richardson rule and applications, Discrete Mathematics 193 (1998) 257--266. The connecti…
Our main goal is to compute the decomposition of arbitrary Kronecker powers of the Harmonics of $S_n$. To do this, we give a new way of decomposing the character for the action of $S_n$ on polynomial rings with $k$ sets of $n$ variables. There are two aspects to this decomposition. The first is algebraic, in which formulas can be given for certain restrictions from $GL_n$ to $S_n$ occurring in Schur-Weyl duality. The second is combinatorial. We give a generalization of the $comaj$ statistic on permutations which includes the $comaj$ statistic on standard tableaux. This statistic allows us to w…
We derive exact and sharp lower bounds for the number of monochromatic generalized Schur triples $(x,y,x+ay)$ whose entries are from the set $\{1,\dots,n\}$, subject to a coloring with two different colors. Previously, only asymptotic formulas for such bounds were known, and only for $a\in\mathbb{N}$. Using symbolic computation techniques, these results are extended here to arbitrary $a\in\mathbb{R}$. Furthermore, we give exact formulas for the minimum number of monochromatic Schur triples for $a=1,2,3,4$, and briefly discuss the case $0<a<1$.