scholarly journals The Generalized Schröder Theory

10.37236/1950 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Chunwei Song

While the standard Catalan and Schröder theories both have been extensively studied, people have only begun to investigate higher dimensional versions of the Catalan number (see, say, the 1991 paper of Hilton and Pedersen, and the 1996 paper of Garsia and Haiman). In this paper, we study a yet more general case, the higher dimensional Schröder theory. We define $m$-Schröder paths, find the number of such paths from $(0,0)$ to $(mn, n)$, and obtain some other results on the $m$-Schröder paths and $m$-Schröder words. Hoping to generalize classical $q$-analogue results of the ordinary Catalan and Schröder numbers, such as in the works of Fürlinger and Hofbauer, Cigler, and Bonin, Shapiro and Simion, we derive a $q$-identity which would welcome a combinatorial interpretation. Finally, we introduce the ($q, t$)-$m$-Schröder polynomial through "$m$-parking functions" and relate it to the $m$-Shuffle Conjecture of Haglund, Haiman, Loehr, Remmel and Ulyanov.

10.37236/5659 ◽  
2016 ◽  
Vol 23 (2) ◽  
Author(s):  
Youngja Park ◽  
Sangwook Kim

Large Schröder paths, sparse noncrossing partitions, partial horizontal strips, and $132$-avoiding alternating sign matrices are objects enumerated by Schröder numbers. In this paper we give formula for the number of Schröder objects with given type and number of connected components. The proofs are bijective using Chung-Feller style. A bijective proof for the number of Schröder objects with given type is provided. We also give a combinatorial interpretation for the number of small Schröder paths.


2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Paul Levande

International audience We examine the $q=1$ and $t=0$ special cases of the parking functions conjecture. The parking functions conjecture states that the Hilbert series for the space of diagonal harmonics is equal to the bivariate generating function of $area$ and $dinv$ over the set of parking functions. Haglund recently proved that the Hilbert series for the space of diagonal harmonics is equal to a bivariate generating function over the set of Tesler matrices–upper-triangular matrices with every hook sum equal to one. We give a combinatorial interpretation of the Haglund generating function at $q=1$ and prove the corresponding case of the parking functions conjecture (first proven by Garsia and Haiman). We also discuss a possible proof of the $t = 0$ case consistent with this combinatorial interpretation. We conclude by briefly discussing possible refinements of the parking functions conjecture arising from this research and point of view. $\textbf{Note added in proof}$: We have since found such a proof of the $t = 0$ case and conjectured more detailed refinements. This research will most likely be presented in full in a forthcoming article. On examine les cas spéciaux $q=1$ et $t=0$ de la conjecture des fonctions de stationnement. Cette conjecture déclare que la série de Hilbert pour l'espace des harmoniques diagonaux est égale à la fonction génératrice bivariée (paramètres $area$ et $dinv$) sur l'ensemble des fonctions de stationnement. Haglund a prouvé récemment que la série de Hilbert pour l'espace des harmoniques diagonaux est égale à une fonction génératrice bivariée sur l'ensemble des matrices de Tesler triangulaires supérieures dont la somme de chaque équerre vaut un. On donne une interprétation combinatoire de la fonction génératrice de Haglund pour $q=1$ et on prouve le cas correspondant de la conjecture dans le cas des fonctions de stationnement (prouvé d'abord par Garsia et Haiman). On discute aussi d'une preuve possible du cas $t=0$, cohérente avec cette interprétation combinatoire. On conclut en discutant brièvement les raffinements possibles de la conjecture des fonctions de stationnement de ce point de vue. $\textbf{Note ajoutée sur épreuve}$: j'ai trouvé depuis cet article une preuve du cas $t=0$ et conjecturé des raffinements possibles. Ces résultats seront probablement présentés dans un article ultérieur.


10.37236/1138 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
William Y. C. Chen ◽  
Toufik Mansour ◽  
Sherry H. F. Yan

We show that matchings avoiding a certain partial pattern are counted by the $3$-Catalan numbers. We give a characterization of $12312$-avoiding matchings in terms of restrictions on the corresponding oscillating tableaux. We also find a bijection between matchings avoiding both patterns $12312$ and $121323$ and Schröder paths without peaks at level one, which are counted by the super-Catalan numbers or the little Schröder numbers. A refinement of the super-Catalan numbers is derived by fixing the number of crossings in the matchings. In the sense of Wilf-equivalence, we use the method of generating trees to show that the patterns 12132, 12123, 12321, 12231, 12213 are all equivalent to the pattern $12312$.


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.


10.37236/1472 ◽  
1999 ◽  
Vol 6 (1) ◽  
Author(s):  
E. Pergola ◽  
R. Pinzani

An elevated Schröder path is a lattice path that uses the steps $(1,1)$, $(1,-1)$, and $(2,0)$, that begins and ends on the $x$-axis, and that remains strictly above the $x$-axis otherwise. The total area of elevated Schröder paths of length $2n+2$ satisfies the recurrence $f_{n+1}=6f_n-f_{n-1}$, $n \geq 2$, with the initial conditions $f_0=1$, $f_1=7$. A combinatorial interpretation of this recurrence is given, by first introducing sets of unrestricted paths whose cardinality also satisfies the recurrence relation and then establishing a bijection between the set of these paths and the set of triangles constituting the total area of elevated Schröder paths.


10.37236/591 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Shu-Chung Liu ◽  
Yi Wang ◽  
Yeong-Nan Yeh

The classical Chung-Feller Theorem offers an elegant perspective for enumerating the Catalan number $c_n= \frac{1}{n+1}\binom{2n}{n}$. One of the various proofs is by the uniform-partition method. The method shows that the set of the free Dyck $n$-paths, which have $\binom{2n}{n}$ in total, is uniformly partitioned into $n+1$ blocks, and the ordinary Dyck $n$-paths form one of these blocks; therefore the cardinality of each block is $\frac{1}{n+1}\binom{2n}{n}$. In this article, we study the Chung-Feller property: a sup-structure set can be uniformly partitioned such that one of the partition blocks is (isomorphic to) a well-known structure set. The previous works about the uniform-partition method used bijections, but here we apply generating functions as a new approach. By claiming a functional equation involving the generating functions of sup- and sub-structure sets, we re-prove two known results about Chung-Feller property, and explore several new examples including the ones for the large and the little Schröder paths. Especially for the Schröder paths, we are led by the new approach straightforwardly to consider "weighted" free Schröder paths as sup-structures. The weighted structures are not obvious via bijections or other methods.


2021 ◽  
Vol 344 (2) ◽  
pp. 112209
Author(s):  
Sheng-Liang Yang ◽  
Mei-yang Jiang

10.37236/4827 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
JiSun Huh ◽  
SeungKyung Park

We study generalized small Schröder paths in the sense of arbitrary sizes of steps. A generalized small Schröder path is a generalized lattice path from $(0,0)$ to $(2n,0)$ with the step set of  $\{(k,k), (l,-l), (2r,0)\, |\, k,l,r \in {\bf P}\}$, where ${\bf P}$ is the set of positive integers, which never goes below the $x$-axis, and with no horizontal steps at level 0.  We find a bijection between 5-colored Dyck paths and generalized small Schröder paths, proving that the number of generalized small Schröder paths is equal to $\sum_{k=1}^{n} N(n,k)5^{n-k}$ for $n\geq 1$.


10.37236/6719 ◽  
2017 ◽  
Vol 24 (2) ◽  
Author(s):  
Suhyung An ◽  
JiYoon Jung ◽  
Sangwook Kim

In this paper we enumerate the number of $(k, r)$-Fuss-Schröder paths of type $\lambda$. Y. Park and S. Kim studied small Schröder paths with type $\lambda$. Generalizing the results to small $(k, r)$-Fuss-Schröder paths with type $\lambda$, we give a combinatorial interpretation for the number of small $(k, r)$-Fuss-Schröder paths of type $\lambda$ by using Chung-Feller style. We also give two sets of sparse noncrossing partitions of $[2(k + 1)n + 1]$ and $[2(k + 1)n + 2]$ which are in bijection with the set of all small and large, respectively, $(k, r)$-Fuss-Schröder paths of type $\lambda$.


Sign in / Sign up

Export Citation Format

Share Document