Schur's partition theorem states that the number of partitions of n into distinct parts congruent 1, 2 (mod 3) equals the number of partitions of n into parts which differ by >= 3, where the inequality is strict if a part is a multiple of 3. We establish a double bounded refined version of this theorem by imposing one bound on the parts congruent 0,1 (mod 3) and another on the parts congruent 2 (mod 3), and by keeping track of the number of parts in each of the residue classes (mod 3). Despite the long history of Schur's theorem, our result is new, and extends earlier work of Andrews, Alladi-Gordon and Bressoud. We give combinatorial and q-theoretic proofs of our result. The special case L=M leads to a representation of the generating function of the underlying partitions in terms of the q-trinomial coefficients extending a similar previous representation of Andrews.
We propose and prove a new polynomial identity that implies Schur's partition theorem. We give combinatorial interpretations of some of our expressions in the spirit of Kurşungöz. We also present some related polynomial and $q$-series identities.
Let $\mathscr{S}$ denote the set of integer partitions into parts that differ by at least $3$, with the added constraint that no two consecutive multiples of $3$ occur as parts. We derive trivariate generating functions of Andrews--Gordon type for partitions in $\mathscr{S}$ with both the number of parts and the number of even parts counted. In particular, we provide an analytic counterpart of Andrews' recent refinement of the Alladi--Schur theorem.
We construct an evidently positive multiple series as a generating function for partitions satisfying the multiplicity condition in Schur's partition theorem. Refinements of the series when parts in the said partitions are classified according to their parities or values mod 3 are also considered. Direct combinatorial interpretations of the series are provided.
Elementary proofs are given for sums of Schur functions over partitions into at most n parts each less than or equal to m for which i) all parts are even, ii) all parts of the conjugate partition are even. Also, an elementary proof of a recent result of Ishikawa and Wakayama is given.
Periodic Schur process is a generalization of the Schur process introduced in math.CO/0107056. We compute its correlation functions and their bulk scaling limits, and discuss several applications including asymptotic analysis of uniform measures on cylindric partitions, time-dependent extensions of the discrete sine kernel, and bulk limit behavior of certain measures on partitions introduced in hep-th/0306238 in connection with supersymmetric gauge theories.
The Alladi-Gordon identity plays an important role for the Alladi-Gordon generalization of Schur's partition theorem. By using Joichi-Stanton's insertion algorithm, we present an overpartition interpretation for the Alladi-Gordon key identity. Based on this interpretation, we further obtain a combinatorial proof of the Alladi-Gordon key identity by establishing an involution on the underlying set of overpartitions.
In this paper we define the shifted Schur process as a measure on sequences of strict partitions. This process is a generalization of the shifted Schur measure introduced in [TW] and [Mat] and is a shifted version of the Schur process introduced in [OR]. We prove that the shifted Schur process defines a Pfaffian point process. We further apply this fact to compute the bulk scaling limit of the correlation functions for a measure on strict plane partitions which is an analog of the uniform measure on ordinary plane partitions. As a byproduct, we obtain a shifted analog of the famous MacMahon's …
We give another proof for the (-1)-enumeration of self-complementary plane partitions with at least one odd side-length by specializing a certain Schur function identity. The proof is analogous to Stanley's proof for the ordinary enumeration. In addition, we obtain enumerations of 180-degree symmetric rhombus tilings of hexagons with a barrier of arbitrary length along the central line.
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…
Our results revolve around a new operation on partitions, which we call overlap. We prove two overlap identities for so-called Littlewood-Schur functions. Littlewood-Schur functions are a generalization of Schur functions, whose study was introduced by Littlewood. More concretely, the Littlewood-Schur function $LS_λ(X; Y)$ indexed by the partition $λ$ is a polynomial in the variables $X \cup Y$ that is symmetric in both $X$ and $Y$ separately. The first overlap identity represents $LS _λ(X; Y)$ as a sum over subsets of $X$, while the second overlap identity essentially represents $LS_λ(X; Y)$ …
Determining if a symmetric function is Schur-positive is a prevalent and, in general, a notoriously difficult problem. In this paper we study the Schur-positivity of a family of symmetric functions. Given a partition λ, we denote by λ^c its complement in a square partition (m^m). We conjecture a Schur-positivity criterion for symmetric functions of the form s_{μ'}s_{μ^c}-s_{λ'}s_{λ^c}, where λis a partition of weight |μ|-1 contained in μand the complement of μis taken in the same square partition as the complement of λ. We prove the conjecture in many cases.
We study families of partitions with gap conditions that were introduced by Schur and Andrews, and describe their fundamental connections to combinatorial q-series and automorphic forms. In particular, we show that the generating functions for these families naturally lead to deep identities for theta functions and Hickerson's universal mock theta function, which provides a very general answer to Andrews' Conjecture on the modularity of the Schur-type generating function. Furthermore, we also complete the second part of Andrews' speculation by determining the asymptotic behavior of these funct…
We use k-Schur functions to get the minimal boundary of the k-bounded partition poset. This permits to describe the central random walks on affine Grassmannian elements of type A and yields a polynomial expression for their drift. We also recover Rietsch's parametriza-tion of totally nonnegative unitriangular Toeplitz matrices without using quantum cohomology of flag varieties. All the homeomorphisms we define can moreover be made explicit by using the combinatorics of k-Schur functions and elementary computations based on Perron-Frobenius theorem.
In 1952, J.H.Braun claimed to have established a formula giving a lower bound for certain partitions of sets of integers into weakly sum-free classes. However, no proof or supporting construction was published at that time. In today's terminology, that claim was equivalent to giving a formulaic lower bound for the weak Schur number $WS(s)$. $WS(s)$ is the maximum number such that there exists a weak Schur partition of the integers from 1 to $WS(s)$, into $s$ subsets. In a weak Schur partition of a set of integers, there can be no three distinct members $a$, $b$ and $c$ in any subset, such that…
The Schubert bases of the torus-equivariant homology and cohomology rings of the affine Grassmannian of the special linear group are realized by new families of symmetric functions called k-double Schur functions and affine double Schur functions.
We review and present new studies on the relation between the partition functions of integrable lattice models and symmetric polynomials, and its combinatorial representation theory based on the correspondence, including our work. In particular, we examine the correspondence between the wavefunctions of the XXZ type, Felderhof type and the boson type integrable models and symmetric polynomials such as the Schur, Grothendieck and symplectic Schur functions. We also give a brief report of our work on generalizing the correspondence between the Felderhof models and factorial Schur and symplectic …
We prove that the permutations of $\{1,\dots, n\}$ having an increasing (resp., decreasing) subsequence of length $n-r$ index a subset of the set of all $r$th Kronecker powers of $n \times n$ permutation matrices which is a basis for the linear span of that set. Thanks to a known Schur--Weyl duality, this gives a new basis for the centralizer algebra of the partition algebra acting on the $r$th tensor power of a vector space. We give some related results on the set of doubly stochastic matrices in that algebra.
We show that the k-double Schur functions defined by the authors, and the quantum double Schubert polynomials studied by Kirillov and Maeno and by Ciocan-Fontanine and Fulton, can be obtained from each other by an explicit rational substitution. The main new ingredient is an explicit computation of Kostant's solution to the Toda lattice in terms of equivariant Schubert classes.
The double Schur functions form a distinguished basis of the ring Λ(x||a) which is a multiparameter generalization of the ring of symmetric functions Λ(x). The canonical comultiplication on Λ(x) is extended to Λ(x||a) in a natural way so that the double power sums symmetric functions are primitive elements. We calculate the dual Littlewood-Richardson coefficients in two different ways thus providing comultiplication rules for the double Schur functions. We also prove multiparameter analogues of the Cauchy identity. A new family of Schur type functions plays the role of a dual object in the ide…
We consider ribbon shapes, not necessarily connected, whose rows, with at least two boxes in each, are in monotone length order. These ribbons are uniquely defined by a pair of partitions: the row partition consisting of the row lengths in decreasing order, and the overlapping partition whose entries count the total number of columns with two boxes in the successive ribbon shapes obtained by sequentially subtracting the longest row. The support of such ribbon Schur functions, considered as a subposet of the dominance order lattice on partitions, has the row partition as bottom element, and, as…
We construct discrete time Markov chains that preserve the class of Schur processes on partitions and signatures. One application is a simple exact sampling algorithm for q^{volume}-distributed skew plane partitions with an arbitrary back wall. Another application is a construction of Markov chains on infinite Gelfand-Tsetlin schemes that represent deterministic flows on the space of extreme characters of the infinite-dimensional unitary group.
We give some new formulas about factorizations of $K$-$k$-Schur functions $g^{(k)}_λ$, analogous to the $k$-rectangle factorization formula $s^{(k)}_{R_t\cupλ}=s^{(k)}_{R_t}s^{(k)}_λ$ of $k$-Schur functions, where $λ$ is any $k$-bounded partition and $R_t$ denotes the partition $(t^{k+1-t})$ called \textit{$k$-rectangle}. Although a formula of the same form does not hold for $K$-$k$-Schur functions, we can prove that $g^{(k)}_{R_t}$ divides $g^{(k)}_{R_t\cupλ}$, and in fact more generally that $g^{(k)}_{P}$ divides $g^{(k)}_{P\cupλ}$ for any multiple $k$-rectangles $P=R_{t_1}^{a_1}\cup\dots\cu…
A remarkable result of Stanley shows that the set of maximal chains in the non-crossing partition lattice of type $A$ is Schur-positive, where descents are defined by a distinguished edge labeling. A bijection between these chains and labeled trees was presented by Goulden and Yong. Using Adin-Roichman's variant of Björner's $EL$-labeling, we show that the subset of maximal chains in the non-crossing partition lattice of type $A$, whose underlying tree is a convex caterpillar, is Schur-positive.
We give an explicit combinatorial formula for the Schur expansion of Macdonald polynomials indexed by partitions with second part at most two. This gives a uniform formula for both hook and two column partitions. The proof comes as a corollary to the result that generalized dual equivalence classes of permutations are unions of standard dual equivalence classes of permutations for certain cases, establishing an earlier conjecture of the author.
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…
It is known that the Schur expansion of a skew Schur function runs over the interval of partitions, equipped with dominance order, defined by the least and the most dominant Littlewood-Richardson filling of the skew shape. We characterise skew Schur functions (and therefore the product of two Schur functions) which are multiplicity-free and the resulting Schur expansion runs over the whole interval of partitions, i.e. skew Schur functions having Littlewood-Richardson coefficients always equal to $1$ over the full interval.
In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also show how a similar approach using the codes of partitions can be generalized from Schur functions to also include Schur $Q$-functions and derive the combinatorial formulation for both cases. We then apply them by examining the Littlewood-Richardson and Pieri Rules.
We show that the shifted rank, or srank, of any partition $λ$ with distinct parts equals the lowest degree of the terms appearing in the expansion of Schur's $Q_λ$ function in terms of power sum symmetric functions. This gives an affirmative answer to a conjecture of Clifford. As pointed out by Clifford, the notion of the srank can be naturally extended to a skew partition $λ/μ$ as the minimum number of bars among the corresponding skew bar tableaux. While the srank conjecture is not valid for skew partitions, we give an algorithm to compute the srank.
In 1968 and 1969, Andrews proved two partition theorems of the Rogers-Ramanujan type which generalise Schur's celebrated partition identity (1926). Andrews' two generalisations of Schur's theorem went on to become two of the most influential results in the theory of partitions, finding applications in combinatorics, representation theory and quantum algebra. In a recent paper, the author generalised the first of these theorems to overpartitions, using a new technique which consists in going back and forth between $q$-difference equations on generating functions and recurrence equations on thei…
The $k$-Young lattice $Y^k$ is a partial order on partitions with no part larger than $k$. This weak subposet of the Young lattice originated from the study of the $k$-Schur functions(atoms) $s_λ^{(k)}$, symmetric functions that form a natural basis of the space spanned by homogeneous functions indexed by $k$-bounded partitions. The chains in the $k$-Young lattice are induced by a Pieri-type rule experimentally satisfied by the $k$-Schur functions. Here, using a natural bijection between $k$-bounded partitions and $k+1$-cores, we establish an algorithm for identifying chains in the $k$-Young l…
In 1969, Andrews proved a theorem on partitions with difference conditions which generalises Schur's celebrated partition identity. In this paper, we generalise Andrews' theorem to overpartitions. The proof uses q-differential equations and recurrences.
We conjecture an evaluation of three-partition cyclic Hodge integrals in terms of loop Schur functions. Our formula implies the orbifold Gromov-Witten/Donaldson-Thomas correspondence for toric Calabi-Yau threefolds with transverse type A singularities. We prove the formula in the case where one of the partitions is empty, and thus establish the orbifold Gromov- Witten/Donaldson-Thomas correspondence for local toric surfaces with transverse type A singularities.
Recently, residue and quotient tables were defined by Fishel and the author, and were used to describe strong covers in the lattice of $k$-bounded partitions. In this paper, we show or conjecture that residue and quotient tables can be used to describe many other results in the theory of $k$-bounded partitions and $k$-Schur functions, including $k$-conjugates, weak horizontal and vertical strips, and the Murnaghan-Nakayama rule. Evidence is presented for the claim that one of the most important open questions in the theory of $k$-Schur functions, a general rule that would describe their produc…
In this paper are introduced two classes of elements in the enveloping algebra $\mathbf{U}(gl(n))$: the \emph{double Young-Capelli bitableaux} $[\ \fbox{$S \ | \ T$}\ ]$ and the \emph{central} \emph{Schur elements} $\mathbf{S}_λ(n)$, that act in a remarkable way on the highest weight vectors of irreducible Schur modules. Any element $\mathbf{S}_λ(n)$ is the sum of all double Young-Capelli bitableaux $[\ \fbox{$S \ | \ S$}\ ]$, $S$ row (strictly) increasing Young tableaux of shape $\widetildeλ$. The Schur elements $\mathbf{S}_λ(n)$ are proved to be the preimages - with respect to the Harish-Cha…
Plane partitions have been widely studied in Mathematics since MacMahon. See, for example, the works by Andrews, Macdonald, Stanley, Sagan and Krattenthaler. The Schur process approach, introduced by Okounkov and Reshetikhin, and further developed by Borodin, Corwin, Corteel, Savelief and Vuletić, has been proved to be a powerful tool in the study of various kinds of plane partitions. The exact enumerations of ordinary plane partitions, shifted plane partitions and cylindric partitions could be derived from two summation formulas for Schur processes, namely, the open summation formula and the …
We start with a bijective proof of Schur's theorem due to Alladi and Gordon and describe how a particular iteration of it leads to some very general theorems on colored partitions. These theorems imply a number of important results, including Schur's theorem, Bressoud's generalization of a theorem of Göllnitz, two of Andrews' generalizations of Schur's theorem, and the Andrews-Olsson identities.
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$.
Given a module $M$ for the algebra $\mathcal{D}_{\mathtt{q}}(G)$ of quantum differential operators on $G$, and a positive integer $n$, we may equip the space $F_n^G(M)$ of invariant tensors in $V^{\otimes n}\otimes M$, with an action of the double affine Hecke algebra of type $A_{n-1}$. Here $G= SL_N$ or $GL_N$, and $V$ is the $N$-dimensional defining representation of $G$. In this paper we take $M$ to be the basic $\mathcal{D}_{\mathtt{q}}(G)$-module, i.e. the quantized coordinate algebra $M= \mathcal{O}_{\mathtt{q}}(G)$. We describe a weight basis for $F_n^G(\mathcal{O}_{\mathtt{q}}(G))$ com…
We give a basis for the space V spanned by the lowest degree part \hat{s}_λof the expansion of the Schur symmetric functions s_λin terms of power sums, where we define the degree of the power sum p_i to be 1. In particular, the dimension of the subspace V_n spanned by those \hat{s}_λfor which λis a partition of n is equal to the number of partitions of n whose parts differ by at least 2. We also show that a symmetric function closely related to \hat{s}_λhas the same coefficients when expanded in terms of power sums or augmented monomial symmetric functions. Proofs are based on the theory of mi…
The shifted Schur measure introduced by Tracy and Widom is a measure on the set of all strict partitions, which is defined by Schur $Q$-functions. The main aim of this paper is to calculate the correlation function of this measure, which is given by a pfaffian. As an application, we prove that a limit distribution of $λ_j$'s with respect to a shifted version of the Plancherel measure for symmetric groups is identical with the corresponding distribution of the original Plancherel measure. Further we give expressions of the mean value and the variance of the size of a partition with respect to t…
A recent paper of Bump, McNamara and Nakasuji introduced a factorial version of Tokuyama's identity, expressing the partition function of a six vertex model as the product of a t-deformed Vandermonde and a Schur function. Here we provide an extension of their result by exploiting the language of primed shifted tableaux, with its proof based on the use of non-intersecting lattice paths.
We investigate the free boundary Schur process, a variant of the Schur process introduced by Okounkov and Reshetikhin, where we allow the first and the last partitions to be arbitrary (instead of empty in the original setting). The pfaffian Schur process, previously studied by several authors, is recovered when just one of the boundary partitions is left free. We compute the correlation functions of the process in all generality via the free fermion formalism, which we extend with the thorough treatment of "free boundary states". For the case of one free boundary, our approach yields a new pro…
We consider an operator of Bernstein for symmetric functions, and give an explicit formula for its action on an arbitrary Schur function. This formula is given in a remarkably simple form when written in terms of some notation based on the code of a partition. As an application, we give a new and very simple proof of a classical result for the KP hierarchy, which involves the Plucker relations for Schur function coefficients in a tau function for the hierarchy. This proof is especially compact because of a restatement that we give for the Plucker relations that is symmetrical in terms of parti…
