Results 41 to 50 of about 8,688 (230)
A Bijection between Maximal Chains in Fibonacci Posets
, 1997 We give a bijection between maximal 0→wchains in the Fibonacci lattices, Fib(r) andZ(r), and interpret this bijection in terms of ...
Kremer, Darla, O'Hara, Kathleen M.
core +1 more source
A Bijection for Unicellular Partitioned Bicolored Maps
, 2006 In the present paper we construct a bijection that relates a set of unicellular bicolored maps to a set of couples of ordered bicolored trees and partial permutations.
Schaeffer, Gilles, Vassilieva, Ekaterina
core +2 more sources
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
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
The active bijection for graphs
Advances in Applied Mathematics, 2019 62 pages, 10 figures, many ...
Gioan, Emeric, Las Vergnas, Michel
openaire +6 more sources
Classifying Equidistant Permutation Codes
Journal of Combinatorial Designs, EarlyView.ABSTRACT A permutation code of length n $n$ is a set of codewords, each of which contains every symbol of a set of size n $n$ exactly once. A permutation code in which any two distinct codewords differ in the same number of coordinates is called equidistant and that number is called the distance.
Patric R. J. Östergård +1 more
wiley +1 more source
A bijection for nonorientable general maps
, 2016 International audienceWe give a different presentation of a recent bijection due to Chapuy and Dołega for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Bettinelli, Jérémie
core +5 more sources
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
Saturated Partial Embeddings of Planar Graphs
Journal of Graph Theory, EarlyView.ABSTRACT In this work, we study how far one can deviate from optimal behavior when embedding a planar graph. For a planar graph G $G$, we say that a plane subgraph H ⊆ G $H\subseteq G$ is a plane‐saturated subgraph if adding any edge (possibly with new vertices) to H $H$ would either violate planarity or make the resulting graph no longer a subgraph of
Alexander Clifton, Nika Salia
wiley +1 more source