Results 41 to 50 of about 116,873 (193)
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
Object grammars and bijections
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dutour, I., Fédou, J.M.
openaire +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
Han’s bijection via permutation codes
European Journal of Combinatorics, 2011 12 pages, to appear in European J ...
Chen, William Y.C. +2 more
openaire +3 more sources
Solvability of invariant systems of differential equations on H2$\mathbb {H}^2$ and beyond
Mathematische Nachrichten, EarlyView.Abstract We show how the Fourier transform for distributional sections of vector bundles over symmetric spaces of non‐compact type G/K$G/K$ can be used for questions of solvability of systems of invariant differential equations in analogy to Hörmander's proof of the Ehrenpreis–Malgrange theorem.
Martin Olbrich, Guendalina Palmirotta
wiley +1 more source
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 for nonorientable general maps [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Jérémie Bettinelli
doaj +1 more source
Perfect Matching Under Precedence Constraints
Networks, EarlyView.ABSTRACT In this article, we motivate and define variants of perfect matching under precedence constraints where a perfect matching is built incrementally and precedence constraints ensure that an edge may only be added to the matching if the edge's predecessor vertices have already been covered.
Christina Büsing, Corinna Mathwieser
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
An equivalence of multistatistics on permutations
, 2018 We prove a conjecture of J.-C. Novelli, J.-Y. Thibon, and L. K. Williams (2010) about an equivalence of two triples of statistics on permutations. To prove this conjecture, we construct a bijection through different combinatorial objects, starting with a
Nunge, Arthur
core +2 more sources