scholarly journals Two special cases of the Rational Shuffle Conjecture

2014 ◽  
Vol DMTCS Proceedings vol. AT,... (Proceedings) ◽  
Author(s):  
Emily Leven

International audience The Classical Shuffle Conjecture of Haglund et al. (2005) has a symmetric function side and a combinatorial side. The combinatorial side $q,t$-enumerates parking functions in the $n ×n$ lattice. The symmetric function side may be simply expressed as $∇ e_n$ , where $∇$ is the Macdonald eigen-operator introduced by Bergeron and Garsia (1999) and $e_n$ is the elementary symmetric function. The combinatorial side has been extended to parking functions in the $m ×n$ lattice for coprime $m,n$ by Hikita (2012). Recently, Gorsky and Negut have been able to extend the Shuffle Conjecture by combining their work (2012a, 2012b, 2013) (related to work of Schiffmann and Vasserot (2011, 2013)) with Hikita's combinatorial results. We prove this new conjecture for the cases $m=2$ and $n=2$ .

2012 ◽  
Vol DMTCS Proceedings vol. AR,... (Proceedings) ◽  
Author(s):  
Angela Hicks

International audience In a 2010 paper Haglund, Morse, and Zabrocki studied the family of polynomials $\nabla C_{p1}\dots C_{pk}1$ , where $p=(p_1,\ldots,p_k)$ is a composition, $\nabla$ is the Bergeron-Garsia Macdonald operator and the $C_\alpha$ are certain slightly modified Hall-Littlewood vertex operators. They conjecture that these polynomials enumerate a composition indexed family of parking functions by area, dinv and an appropriate quasi-symmetric function. This refinement of the nearly decade old ``Shuffle Conjecture,'' when combined with properties of the Hall-Littlewood operators can be shown to imply the existence of certain bijections between these families of parking functions. In previous work to appear in her PhD thesis, the author has shown that the existence of these bijections follows from some relatively simple properties of a certain family of polynomials in one variable x with coefficients in $\mathbb{N}[q]$. In this paper we introduce those polynomials, explain their connection to the conjecture of Haglund, Morse, and Zabrocki, and explore some of their surprising properties, both proven and conjectured. Dans un article de 2010, Haglund, Morse et Zabrocki étudient la famille de polynômes $\nabla C_{p1}\dots C_{pk}1$ où $p=(p_1,\ldots,p_k)$ est une composition, $\nabla$ est l’opérateur de Bergeron-Garsia et les $C_\alpha$ sont des opérateurs ``vertex'' de Hall-Littlewood légèrement altérés. Il posent la conjecture que ces polynômes donnent l’énumération d'une famille de fonctions ``parking'', indexées par des compositions, par aire, le ``dinv'' et une fonction quasi-symétrique associée. Cette conjecture raffine la conjecture ``Shuffle'', qui est âgée de presque dix ans. On peut montrer, a partir de cette conjecture, que les propriétés des opérateurs de Hall-Littlewood, impliquent l'existence de certaines bijections entre ces familles de fonctions ``parking''. Dans un précédent travail , qui fait partie de sa thèse de doctorat, l'auteur montre que l’existence de ces bijections découle de certaines propriétés relativement simples d'une famille de polynômes à une variable x, avec coefficients dans $\mathbb{N}[q]$. Dans cet article, on introduit ces polynômes, on explique leur connexion avec la conjecture de Haglund, Morse et Zabrocki, et on explore certaines de leurs propriétés surprenantes, qu'elles soient prouvées ou seulement conjecturées.


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Charles Robert Miers ◽  
Franck Ruskey

International audience Let $\alpha$ be a string over $\mathbb{Z}_q$, where $q = 2^d$. The $j$-th elementary symmetric function evaluated at $\alpha$ is denoted $e_j(\alpha)$ . We study the cardinalities $S_q(m;\mathcal{T} _1,\mathcal{T} _2,\ldots,\mathcal{T} _t)$ of the set of length $m$ strings for which $e_j(\alpha) = \tau _i$. The $\textit{profile}$ k$(\alpha) = ⟨k_1,k_2,\ldots,k_(q-1) ⟩$ of a string $\alpha$ is the sequence of frequencies with which each letter occurs. The profile of $\alpha$ determines $e_j(\alpha)$ , and hence $S_q$. Let $h_n$ : $\mathbb{Z}_{2^{n+d-1}}^{(q-1)}$ $\mapsto \mathbb{Z}_{2^d} [z] $ mod $ z^{2^n}$ be the map that takes k$(\alpha)$ mod $2^{n+d-1}$ to the polynomial $1+ e_1(\alpha) z + e_2(\alpha) z^2 + ⋯+ e_{2^n-1}(\alpha)$ $z^{2^{n-1}}$. We show that $h_n$ is a group homomorphism and establish necessary conditions for membership in the kernel for fixed $d$. The kernel is determined for $d$ = 2,3. The range of $h_n$ is described for $d$ = 2. These results are used to efficiently compute $S_4(m;\mathcal{T} _1,\mathcal{T} _2,\ldots,\mathcal{T} _t)$ for $d$ = 2 and the number of complete factorizations of certain polynomials.


2013 ◽  
Vol DMTCS Proceedings vol. AS,... (Proceedings) ◽  
Author(s):  
Yeonkyung Kim

International audience In this article, we show how the compositional refinement of the ``Shuffle Conjecture'' due to Jim Haglund, Jennifer Morse, and Mike Zabrocki can be used to express the image of a Schur function under the Bergeron-Garsia Nabla operator as a weighted sum of a suitable collection of ``Parking Functions.'' The validity of these expressions is, of course, going to be conjectural until the compositional refinement of the Shuffle Conjecture is established.


10.37236/870 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Drew Armstrong ◽  
Sen-Peng Eu

For each skew shape we define a nonhomogeneous symmetric function, generalizing a construction of Pak and Postnikov. In two special cases, we show that the coefficients of this function when expanded in the complete homogeneous basis are given in terms of the (reduced) type of $k$-divisible noncrossing partitions. Our work extends Haiman's notion of a parking function symmetric function.


2015 ◽  
Vol DMTCS Proceedings, 27th... (Proceedings) ◽  
Author(s):  
Francois Viard

International audience We construct a poset from a simple acyclic digraph together with a valuation on its vertices, and we compute the values of its Möbius function. We show that the weak order on Coxeter groups $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, and the flag weak order on the wreath product &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduced by Adin, Brenti and Roichman (2012), are special instances of our construction. We conclude by briefly explaining how to use our work to define quasi-symmetric functions, with a special emphasis on the $A$<sub>$n-1$</sub> case, in which case we obtain the classical Stanley symmetric function. On construit une famille d’ensembles ordonnés à partir d’un graphe orienté, simple et acyclique munit d’une valuation sur ses sommets, puis on calcule les valeurs de leur fonction de Möbius respective. On montre que l’ordre faible sur les groupes de Coxeter $A$<sub>$n-1$</sub>, $B$<sub>$n$</sub>, $Ã$<sub>$n$</sub>, ainsi qu’une variante de l’ordre faible sur les produits en couronne &#8484;<sub>$r$</sub> &#8768; $S$<sub>$n$</sub> introduit par Adin, Brenti et Roichman (2012), sont des cas particuliers de cette construction. On conclura en expliquant brièvement comment ce travail peut-être utilisé pour définir des fonction quasi-symétriques, en insistant sur l’exemple de l’ordre faible sur $A$<sub>$n-1$</sub> où l’on obtient les séries de Stanley classiques.


2013 ◽  
Vol Vol. 15 no. 2 (Combinatorics) ◽  
Author(s):  
Adrien Boussicault

Combinatorics International audience We consider the family of rational functions ψw= ∏( xwi - xwi+1 )-1 indexed by words with no repetition. We study the combinatorics of the sums ΨP of the functions ψw when w describes the linear extensions of a given poset P. In particular, we point out the connexions between some transformations on posets and elementary operations on the fraction ΨP. We prove that the denominator of ΨP has a closed expression in terms of the Hasse diagram of P, and we compute its numerator in some special cases. We show that the computation of ΨP can be reduced to the case of bipartite posets. Finally, we compute the numerators associated to some special bipartite graphs as Schubert polynomials.


2009 ◽  
Vol DMTCS Proceedings vol. AK,... (Proceedings) ◽  
Author(s):  
Tamás Lengyel

International audience Let $n$ and $k$ be positive integers, $d(k)$ and $\nu_2(k)$ denote the number of ones in the binary representation of $k$ and the highest power of two dividing $k$, respectively. De Wannemacker recently proved for the Stirling numbers of the second kind that $\nu_2(S(2^n,k))=d(k)-1, 1\leq k \leq 2^n$. Here we prove that $\nu_2(S(c2^n,k))=d(k)-1, 1\leq k \leq 2^n$, for any positive integer $c$. We improve and extend this statement in some special cases. For the difference, we obtain lower bounds on $\nu_2(S(c2^{n+1}+u,k)-S(c2^n+u,k))$ for any nonnegative integer $u$, make a conjecture on the exact order and, for $u=0$, prove part of it when $k \leq 6$, or $k \geq 5$ and $d(k) \leq 2$. The proofs rely on congruential identities for power series and polynomials related to the Stirling numbers and Bell polynomials, and some divisibility properties.


1969 ◽  
Vol 12 (5) ◽  
pp. 615-623 ◽  
Author(s):  
K.V. Menon

The generating series for the elementary symmetric function Er, the complete symmetric function Hr, are defined byrespectively.


1968 ◽  
Vol 20 ◽  
pp. 739-748 ◽  
Author(s):  
Peter Botta

Let Mm(F) be the vector space of m-square matrices X — (Xij), i,j= 1, … , m over a field ƒ;ƒ a function on Mm(F) to some set R. It is of interest to determine the structure of the linear maps T: Mm(F) → Mm(F) that preserve the values of the function ƒ (i.e., ƒ(T(x)) — ƒ(x) for all X). For example, if we take ƒ(x) to be the rank of X, we are asking for a determination of the types of linear operations on matrices that preserve rank (6). Other classical invariants that may be taken for ƒ are the determinant, the set of eigenvalues, and the rth elementary symmetric function of the eigenvalues.


Sign in / Sign up

Export Citation Format

Share Document