Results 41 to 50 of about 8,473 (239)
Lenart's bijection via bumpless pipe dreams [PDF]
, 2022 Pipe dreams and bumpless pipe dreams for vexillary permutations are each known to be in bijection with certain semistandard tableaux via maps due to Lenart and Weigandt, respectively.
Gregory, Adam, Hamaker, Zachary
core
Statistics on staircase tableaux, eulerian and mahonian statistics [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 We give a simple bijection between some staircase tableaux and tables of inversion. Some nice properties of the bijection allows us to define some q-Eulerian polynomials related to the staircase tableaux.
Sylvie Corteel, Sandrine Dasse-Hartaut
doaj +1 more source
Type Dn(1) rigged configuration bijection
, 2016 We establish a bijection between the set of rigged configurations and the set of tensor products of Kirillov–Reshetikhin crystals of type Dn(1) in full generality.
Scrimshaw, Travis +11 more
core +1 more source
A simple model of trees for unicellular maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 We consider unicellular maps, or polygon gluings, of fixed genus. In FPSAC '09 the first author gave a recursive bijection transforming unicellular maps into trees, explaining the presence of Catalan numbers in counting formulas for these objects.
Guillaume Chapuy +2 more
doaj +1 more source
Journal of Combinatorial Theory, Series A, 1985 Let \(S_ n\supseteq S_ n'\), \(T_ n\supseteq T_ n'\) with \(| S_ n| \sim | S_ n'|\) and \(| T_ n\sim | T_ n'|\) as \(n\to \infty\). If there exist bijections \(\Phi_ n\) from \(S_ n'\) to \(T_ n'\) then \(\Phi_ n\) is called an asymptotic bijection from \(S_ n\) to \(T_ n\). Using this idea, the authors verify the partition formula: \(B_ r=e^{-1}\sum^{\
Edward A. Bender, Doron Zeilberger
openaire +2 more sources
A bijection for nonorientable general maps [PDF]
, 2022 We give a different presentation of a recent bijection due to Chapuy and Dol\k{e}ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Bettinelli, Jérémie
core +2 more sources
Rigged configurations of type $D_4^{(3)}$ and the filling map [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 We give a statistic preserving bijection from rigged configurations to a tensor product of Kirillov–Reshetikhin crystals $\otimes_{i=1}^{N}B^{1,s_i}$ in type $D_4^{(3)}$ by using virtualization into type $D_4^{(1)}$.
Travis Scrimshaw
doaj +1 more source
A bijection between evil-avoiding and rectangular permutations [PDF]
, 2023 Evil-avoiding permutations, introduced by Kim and Williams in 2022, arise in the study of the inhomogeneous totally asymmetric simple exclusion process.
Tung, Katherine
core +1 more source
Characterizing Pyramidal Hadamard Designs With the Largest Number of Fixed Points
Journal of Combinatorial Designs, EarlyView.ABSTRACT A symmetric (v,k,λ) $(v,k,\lambda )$‐design is said to be f $f$‐pyramidal, with f
Tommaso Traetta
wiley +1 more source
A bijection between shrubs and series-parallel posets [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 Motivated by the theory of operads, we introduce new combinatorial objects, called shrubs, that generalize forests of rooted trees. We show that the species of shrubs is isomorphic to the species of series-parallel posets.
Frédéric Chapoton
doaj +1 more source