Results 1 to 10 of about 11,242 (85)
Enumeration of Corners in Tree-like Tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 In this paper, we confirm conjectures of Laborde-Zubieta on the enumeration of corners in tree-like tableaux and in symmetric tree-like tableaux. In the process, we also enumerate corners in (type $B$) permutation tableaux and (symmetric) alternative ...
Alice L. L. Gao +3 more
doaj +3 more sources
Asymptotics for minimal overlapping patterns for generalized Euler permutations, standard tableaux of rectangular shape, and column strict arrays [PDF]
Discrete Mathematics & Theoretical Computer Science, 2016 A permutation $\tau$ in the symmetric group $S_j$ is minimally overlapping if any two consecutive occurrences of $\tau$ in a permutation $\sigma$ can share at most one element. B\'ona \cite{B} showed that the proportion of minimal overlapping patterns in
Ran Pan, Jeffrey B. Remmel
doaj +3 more sources
Convexity of tableau sets for type A Demazure characters (key polynomials), parabolic Catalan numbers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 This is the first of three papers that develop structures which are counted by a "parabolic" generalization of Catalan numbers. Fix a subset R of {1,..,n-1}. Consider the ordered partitions of {1,..,n} whose block sizes are determined by R. These are the
Robert A. Proctor, Matthew J. Willis
doaj +3 more sources
Expected values of statistics on permutation tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2007 Permutation tableaux are new objects that were introduced by Postnikov in the context of enumeration of the totally positive Grassmannian cells. They are known to be in bijection with permutations and recently, they have been connected to PASEP model ...
Sylvie Corteel, Pawel Hitczenko
doaj +1 more source
Combinatorial properties of permutation tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 We give another construction of a permutation tableau from its corresponding permutation and construct a permutation-preserving bijection between $1$-hinge and $0$-hinge tableaux.
Alexander Burstein, Niklas Eriksen
doaj +1 more source
Discrete Mathematics & Theoretical Computer Science, 2011 In this work we introduce and study tree-like tableaux, which are certain fillings of Ferrers diagrams in simple bijection with permutation tableaux and alternative tableaux.
Jean-Christophe Aval +2 more
doaj +1 more source
Permutation patterns, Stanley symmetric functions, and the Edelman-Greene correspondence [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 Generalizing the notion of a vexillary permutation, we introduce a filtration of $S_{\infty}$ by the number of Edelman-Greene tableaux of a permutation, and show that each filtration level is characterized by avoiding a finite set of patterns.
Sara Billey, Brendan Pawlowski
doaj +1 more source
Skew characters and cyclic sieving
Forum of Mathematics, Sigma, 2021 In 2010, Rhoades proved that promotion on rectangular standard Young tableaux, together with the associated fake-degree polynomial, provides an instance of the cyclic sieving phenomenon.
Per Alexandersson +3 more
doaj +1 more source
Bijections for Permutation Tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we propose a new bijection between permutation tableaux and permutations. This bijection shows how natural statistics on the tableaux are equidistributed to classical statistics on permutations: descents, RL-minima and pattern enumerations.
Sylvie Corteel, Philippe Nadeau
doaj +1 more source
Alignments, crossings, cycles, inversions, and weak Bruhat order in permutation tableaux of type $B$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Alignments, crossings and inversions of signed permutations are realized in the corresponding permutation tableaux of type $B$, and the cycles of signed permutations are understood in the corresponding bare tableaux of type $B$.
Soojin Cho, Kyoungsuk Park
doaj +1 more source