Results 41 to 50 of about 117,839 (222)
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
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
A simple and unusual bijection for Dyck paths and its consequences
, 2003 In this paper we introduce a new bijection from the set of Dyck paths to itself. This bijection has the property that it maps statistics that appeared recently in the study of pattern-avoiding permutations into classical statistics on Dyck paths, whose ...
Deutsch, Emeric, Elizalde, Sergi
core +2 more sources
Object grammars and bijections
Theoretical Computer Science, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
I. Dutour, Jean-Marc Fedou
openaire +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
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
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
, 2013 We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams.
Coşkun, Olcay, Taşkın, Müge
core +1 more source
A Bijection for Enriched Trees
European Journal of Combinatorics, 1994 The author establishes a bijection involving species of enriched trees that leads to a combinatorial proof of Lagrange's inversion formula.
openaire +2 more sources
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source