Schur process is a time-dependent analog of the Schur measure on partitions studied in math.RT/9907127. Our first result is that the correlation functions of the Schur process are determinants with a kernel that has a nice contour integral representation in terms of the parameters of the process. This general result is then applied to a particular specialization of the Schur process, namely to random 3-dimensional Young diagrams. The local geometry of a large random 3-dimensional diagram is described in terms of a determinantal point process on a 2-dimensional lattice with the incomplete beta function kernel (which generalizes the discrete sine kernel). A brief discussion of the universality of this answer concludes the paper.
We give a combinatorial formula for LLT cumulants of unicellular unilevelled shapes in terms of parking functions and Cayley trees. Our formula implies previously conjectured Schur positivity.
We describe a combinatorial formula for the coefficients when the dual immaculate quasisymmetric functions are decomposed into Young quasisymmetric Schur functions. We prove this using an analogue of Schensted insertion. Using this result, we give necessary and sufficient conditions for a dual immaculate quasisymmetric function to be symmetric. Moreover, we show that the product of a Schur function and a dual immaculate quasisymmetric function expands positively in the Young quasisymmetric Schur basis. We also discuss the decomposition of the Young noncommutative Schur functions into the immac…
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…
We construct modules of the $0$-Hecke algebra whose images under the quasisymmetric characteristic map are the Young row-strict quasisymmetric Schur functions. This provides a representation-theoretic interpretation of this basis of quasisymmetric functions, answering a question of Mason and Niese (2015). Additionally, we classify when these modules are indecomposable.
Recently, Kim and Oh expressed the Selberg integral in terms of the number of Young books which are a generalization of standard Young tableaux of shifted staircase shape. In this paper the generating function for Young books according to major index statistic is considered. It is shown that this generating function can be written as a Jackson integral which gives a new $q$-Selberg integral. It is also shown that the new $q$-Selberg integral has an expression in terms of Schur functions.
Mason and Remmel introduced a basis for quasisymmetric functions known as the row-strict quasisymmetric Schur functions. This basis is generated combinatorially by fillings of composition diagrams that are analogous to the row-strict tableaux that generate Schur functions. We introduce a modification known as Young row-strict quasisymmetric Schur functions, which are generated by row-strict Young composition fillings. After discussing basic combinatorial properties of these functions, we define a skew Young row-strict quasisymmetric Schur function using the Hopf algebra of quasisymmetric funct…
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…
Since every even power of the Vandermonde determinant is a symmetric polynomial, we want to understand its decomposition in terms of the basis of Schur functions. We investigate several combinatorial properties of the coefficients in the decomposition. In particular, we give recursive formulas for the coefficient of the Schur function $s_{\m}$ in the decomposition of an even power of the Vandermonde determinant in $n + 1$ variables in terms of the coefficient of the Schur function $s_ł$ in the decomposition of the same even power of the Vandermonde determinant in $n$ variables if the Young dia…
A randomisation of the Berele insertion algorithm is proposed, where the insertion of a letter to a symplectic Young tableau leads to a distribution over the set of symplectic Young tableaux. Berele's algorithm provides a bijection between words from an alphabet and a symplectic Young tableau along with a recording oscillating tableau. The randomised version of the algorithm is achieved by introducing a parameter $0 < q < 1$. The classic Berele algorithm corresponds to letting the parameter $q \to 0$. The new version provides a probabilistic framework that allows to prove Littlewood-type ident…
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…
This paper contains a partial answer to the open problem 3.11 of \cite{[H2008]}. That is to find an explicit bijection on Schröder paths that inverts the statistics area and bounce. This paper started as an attempt to write the sum over $m$-Schröder paths with a fix number of diagonal steps into Schur functions in the variables $q$ and $t$. Some results have been generalized to parking functions, and some bijections were made with standard Young tableaux giving way to partial combinatorial formulas in the basis $s_μ(q,t)s_λ(X)$ for $\nabla(e_n)$ (respectively, $\nabla^m(e_n)$), when $μ$ and $λ…
We take inspiration from the Okounkov-Vershik approach to the representation theory of the symmetric groups to develop a new way of understanding how the Schur-Weyl duality can be used to perform the Quantum Schur Transform. The Quantum Schur Transform is a unitary change of basis transformation between the computational basis of $(\mathbb{C}^d)^{\otimes n}$ and the Schur-Weyl basis of $(\mathbb{C}^d)^{\otimes n}$. We describe a new multigraph, which we call the Schur-Weyl-Young graph, that represents both standard Weyl tableaux and standard Young tableaux in the same diagram. We suggest a maj…
We introduce a new operation on skew diagrams called composition of transpositions, and use it and a Jacobi-Trudi style formula to derive equalities on skew Schur Q-functions whose indexing shifted skew diagram is an ordinary skew diagram. When this skew diagram is a ribbon, we conjecture necessary and sufficient conditions for equality of ribbon Schur Q-functions. Moreover, we determine all relations between ribbon Schur Q-functions; show they supply a Z-basis for skew Schur Q-functions; assert their irreducibility; and show that the non-commutative analogue of ribbon Schur Q-functions is the…
We consider the skew diagram $Δ_n$, which is the $180^\circ$ rotation of the staircase diagram $δ_n = (n,n-1,n-2,...,2,1)$. We create a staircase with bad foundation by augmenting $Δ_n$ with another skew diagram, which we call the \textit{foundation}. We consider pairs of staircases with bad foundation whose foundations are transposes of one another. Among these pairs, we show that the difference of the corresponding skew Schur functions is Schur-positive in the case when one of the foundations consists of either a one or two row diagram, or a hook diagram.
Symmetric Grothendieck polynomials are analogues of Schur polynomials in the K-theory of Grassmannians. We build dual families of symmetric Grothendieck polynomials using Schur operators. With this approach we prove skew Cauchy identity and then derive various applications: skew Pieri rules, dual filtrations of Young's lattice, generating series and enumerative identities. We also give a new explanation of the finite expansion property for products of Grothendieck polynomials.
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…
We use Young's raising operators to give short and uniform proofs of several well known results about Schur polynomials and symmetric functions, starting from the Jacobi-Trudi identity.
We give explicit formulas for the recently introduced Schur multiple zeta values, which generalize multiple zeta(-star) values and which assign to a Young tableaux a real number. In this note we consider Young tableaux of various shapes, filled with alternating entries like a Checkerboard. In particular we obtain new sum representation for odd single zeta values in terms of these Schur multiple zeta values. As a special case we show that some Schur multiple zeta values of Checkerboard style, filled with 1 and 3, are given by determinants of matrices with odd single zeta values as entries.
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. We look at collections of skew diagrams consisting of a fixed fat staircase augmented with all hooks of a given size. Among these diagrams we determine precisely which pairs give a Schur-positive difference. We extend this classification to collections of fat staircases augmented with hook-complements.
For any polynomial representation of the special linear group, the nodes of the corresponding crystal may be indexed by semi-standard Young tableaux. Under certain conditions, the standard Young tableaux occur, and do so with weight 0. Standard Young tableaux also parametrize the vertices of dual equivalence graphs. Motivated by the underlying representation theory, in this paper, we explainthis connection by giving a combinatorial manifestation of Schur-Weyl duality. In particular, we put a dual equivalence graph structure on the 0-weight space of certain crystal graphs, producing edges combi…
Classical Schur P-functions are the particular case of Hall-Littlewood polynomials when the parameter is equal to -1. We introduce factorial (interpolation) analogues of Schur P-functions. A dimension of a skew shifted Young diagram is the number of standard tableaux of the given shape. Also these numbers are equal up to simple factors to the decomposition coefficients of the restriction of an irreducible representation of a spin-symmetric group to a smaller spin-symmetric group. In terms of the factorial Schur P-functions we obtain an explicit formula for the dimension of a skew shifted Young…
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 present a single operation for constructing skew diagrams whose corresponding skew Schur functions are equal. This combinatorial operation naturally generalises and unifies all results of this type to date. Moreover, our operation suggests a closely related condition that we conjecture is necessary and sufficient for skew diagrams to yield equal skew Schur functions.
We study the Pieri type formulas for the Schur multiple zeta functions along with those for the Schur polynomials. To formulate these formulas, we introduce a new insertion rule for adding boxes in the Young tableaux and obtain the results for the hook type Schur multiple zeta functions. For the proof, we show {certain} extended Jacobi-Trudi formulas for the Schur multiple zeta functions.
A lattice diagram is a finite list L=((p_1,q_1),...,(p_n,q_n) of lattice cells. The corresponding lattice diagram determinant is Δ_L(X;Y)=\det \| x_i^{p_j}y_i^{q_j} \|. These lattice diagram determinants are crucial in the study of the so-called ``n! conjecture'' of A. Garsia and M. Haiman. The space M_L is the space spanned by all partial derivatives of Δ_L(X;Y). The ``shift operators'', which are particular partial symmetric derivative operators are very useful in the comprehension of the structure of the M_L spaces. We describe here how a Schur function partial derivative operator acts on l…
Haglund, Luoto, Mason, and van Willigenburg introduced a basis for quasisymmetric functions called the quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur functions are generated through reverse column-strict tableaux. We introduce a new basis for quasisymmetric functions called the row-strict quasisymmetric Schur function basis, generated combinatorially through fillings of composition diagrams in much the same way as Schur functions are generated through row-strict tableaux. We describe the relationship between…
Formulas are obtained that express the Schur S-functions indexed by Young diagrams of rectangular shape as linear combinations of "mixed" products of Schur's S- and Q-functions. The proof is achieved by using representations of the affine Lie algebra of type A_1^{(1)}. A realization of the basic representation that is of ``D_2^{(2)}''-type plays the central role.
In this paper we classify all Schur functions and skew Schur functions that are multiplicity free when expanded in the basis of fundamental quasisymmetric functions, termed F-multiplicity free. Combinatorially, this is equivalent to classifying all skew shapes whose standard Young tableaux have distinct descent sets. We then generalize our setting, and classify all F-multiplicity free quasisymmetric Schur functions with one or two terms in the expansion, or one or two parts in the indexing composition. This identifies composition shapes such that all standard composition tableaux of that shape…
New sufficient conditions and necessary conditions are developed for two skew diagrams to give rise to the same skew Schur function. The sufficient conditions come from a variety of new operations related to ribbons (also known as border strips or rim hooks). The necessary conditions relate to the extent of overlap among the rows or among the columns of the skew diagram.
In this paper we describe the thickened strips and the outside nested decompositions of any skew shape $λ/μ$. For any such decomposition $Φ=(Θ_1,Θ_2,\ldots,Θ_g)$ of the skew shape $λ/μ$ where $Θ_i$ is a thickened strip for every $i$, if $r$ is the number of boxes that are contained in any two distinct thickened strips of $Φ$, we establish a determinantal formula of the function $s_{λ/μ}(X)p_{1^r}(X)$ with the Schur functions of thickened strips as entries, where $s_{λ/μ}(X)$ is the Schur function of the skew shape $λ/μ$ and $p_{1^r}(X)$ is the power sum symmetric function index by the partitio…
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 establish an isomorphism between the center of the twisted Heisenberg category and the subalgebra of the symmetric functions $Γ$ generated by odd power sums. We give a graphical description of the factorial Schur $Q$-functions as closed diagrams in the twisted Heisenberg category and show that the bubble generators of the center correspond to two sets of generators of $Γ$ which encode data related to up/down transition functions on the Schur graph. Finally, we describe an action of the trace of the twisted Heisenberg category, the $W$-algebra $W^-\subset W_{1+\infty}$, on $Γ$.
We introduce a general method for constructing modules for $0$-Hecke algebras and supermodules for $0$-Hecke-Clifford algebras from diagrams of boxes in the plane, and give formulas for the images of these modules in the algebras of quasisymmetric functions and peak functions under the relevant characteristic map. As initial applications, we resolve a question of Jing and Li (2015), introduce a new basis of the peak algebra analogous to the quasisymmetric Schur functions, uncover a new connection between Schur $Q$-functions and quasisymmetric Schur functions, give a representation-theoretic in…
We exhibit a weight-preserving bijection between semi-standard Young tableaux and semi-skyline augmented fillings to provide a combinatorial proof that the Schur functions decompose into nonsymmetric functions indexed by compositions. The insertion procedure involved in the proof leads to an analogue of the Robinson-Schensted-Knuth Algorithm for semi-skyline augmented fillings. This procedure commutes with the RSK algorithm, and therefore retains many of its properties.
Towards equivalent thickened ribbon Schur functions
School of Mathematical Sciences, Xiamen University（厦门大学数学科学学院）；Research Center for Mathematics and Interdisciplinary Sciences, Shandong University（山东大学数学与交叉科学研究中心）
We introduce interpolation analogues of Schur Q-functions - the multiparameter Schur Q-functions. We obtain for them several results: a combinatorial formula, generating functions for one-row and two-rows functions, vanishing and characterization properties, a Pieri-type formula, a Nimmo-type formula (a relation of two Pfaffians), a Giambelli-Schur-type Pfaffian formula, a determinantal formula for the transition coefficients between multiparameter Schur Q-functions with different parameters. We write an explicit Pfaffian expression for the dimension of skew shifted Young diagram. This paper i…
We give a combinatorial expansion of the stable Grothendieck polynomials of skew Young diagrams in terms of skew Schur functions, using a new row insertion algorithm for set-valued semistandard tableaux of skew shape. This expansion unifies some previous results: it generalizes a combinatorial formula obtained in earlier joint work with López Martín and Teixidor i Bigas concerning Brill-Noether curves, and it generalizes a 2000 formula of Lenart and a recent result of Reiner-Tenner-Yong to skew shapes. We also give an expansion in the other direction: expressing skew Schur functions in terms o…
This paper deals with decreasing operators on back stable Schubert polynomials. We study two operators $ξ$ and $\nabla$ of degree $-1$, which satisfy the Leibniz rule. Furthermore, we show that all other such operators are linear combinations of $ξ$ and $\nabla$. For the case of Schur functions, these two operators fully determine the product of Schur functions, i.e., it is possible to define the Littlewood-Richardson coefficients only from $ξ$ and $\nabla$. This new point of view on Schur functions gives us an elementary proof of the Giambelli identity and of Jacobi-Trudi identities. For the …
We establish a correspondence between Young diagrams and differential operators of infinitely many variables. These operators form a commutative associative algebra isomorphic to the algebra of the conjugated classes of finite permutations of the set of natural numbers. The Schur functions form a complete system of common eigenfunctions of these differential operators, and their eigenvalues are expressed through the characters of symmetric groups. The structure constants of the algebra are expressed through the Hurwitz numbers.
We exhibit the limit shape of random Young diagrams having a distribution proportional to the exponential of their area, and confined in a rectangular box. The Ornstein-Uhlenbeck bridge arises from the fluctuations around the limit shape.
Fix a rectangular Young diagram R, and consider all the products of Schur functions s(mu) s(mu^c), where mu and mu^c run over all (unordered) pairs of partitions which are complementary with respect to R. Theorem: The self-complementary products, s(mu)^2 where mu=mu^c, are linearly independent of all other s(mu) s(mu^c). Conjecture: The products s(mu) s(mu^c) are all linearly independent.
We introduce a large class of random Young diagrams which can be regarded as a natural one-parameter deformation of some classical Young diagram ensembles; a deformation which is related to Jack polynomials and Jack characters. We show that each such a random Young diagram converges asymptotically to some limit shape and that the fluctuations around the limit are asymptotically Gaussian.
By using cutting strips and transformations on outside decompositions of a skew diagram, we show that the Giambelli type matrices of a skew Schur function are stably equivalent to each other over symmetric functions. As a consequence, the Jacobi-Trudi matrix and the dual Jacobi-Trudi matrix are stably equivalent over symmetric functions. This gives an affirmative answer to an open problem posed by Kuperberg.
We compute the limit shapes of the Young diagrams of the minimal difference $p$ partitions and provide a simple physical interpretation for the limit shapes. We also calculate the asymptotic distribution of the largest part of the Young diagram and show that the scaled distribution has a Gumbel form for all $p$. This Gumbel statistics for the largest part remains unchanged even for general partitions of the form $E=\sum_i n_i i^{1/ν}$ with $ν>0$ where $n_i$ is the number of times the part $i$ appears.
In the Hopf algebra of symmetric functions, Sym, the basis of Schur functions is distinguished since every Schur function is isomorphic to an irreducible character of a symmetric group under the Frobenius characteristic map. In this note we show that in the Hopf algebra of noncommutative symmetric functions, Nsym, of which Sym is a quotient, the recently discovered basis of noncommutative Schur functions exhibits that every noncommutative Schur function is isomorphic to a noncommutative irreducible character of a symmetric group when working in noncommutative character theory. We simultaneousl…
For a finite poset $P=(X,\prec)$, let $\mathcal{L}_P$ denote the set of linear extensions of $P$. The sorting probability $δ(P)$ is defined as \[δ(P) \, := \, \min_{x,y\in X} \, \bigl| \mathbf{P} \, [L(x)\leq L(y) ] \ - \ \mathbf{P} \, [L(y)\leq L(x) ] \bigr|\,, \] where $L \in \mathcal{L}_P$ is a uniform linear extension of $P$. We give asymptotic upper bounds on sorting probabilities for posets associated with large Young diagrams and large skew Young diagrams, with bounded number of rows.
In continuation of our recent work arXiv:2006.07312, we classify the extremal traces on infinite diagram algebras that appear in the context of Schur-Weyl duality for Banica and Speicher's easy groups. We show that the branching graphs of these algebras describe walks on new variations of the Young graph which describe curious ways of growing Young diagrams. As a consequence, we prove that the extremal traces on generic rook-Brauer algebras are always extensions of extremal traces on the group algebra $\mathbb{C}[S_{\infty}]$ of the infinite symmetric group. Moreover, we conjecture that the sa…
