Results 51 to 60 of about 132,418 (291)
On bijections between monotone rooted trees and the comb basis [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Let $A$ be an $n$-element set. Let $\mathscr{L} ie_2(A)$ be the multilinear part of the free Lie algebra on $A$ with a pair of compatible Lie brackets, and $\mathscr{L} ie_2(A, i)$ the subspace of $\mathscr{L} ie_2(A)$ generated by all the monomials in $\
Fu Liu
doaj +1 more source
A further correspondence between $(bc,\bar{b})$-parking functions and $(bc,\bar{b})$-forests [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 For a fixed sequence of $n$ positive integers $(a,\bar{b}) := (a, b, b,\ldots, b)$, an $(a,\bar{b})$-parking function of length $n$ is a sequence $(p_1, p_2, \ldots, p_n)$ of positive integers whose nondecreasing rearrangement $q_1 \leq q_2 \leq \cdots ...
Heesung Shin, Jiang Zeng
doaj +1 more source
The scaling limit of uniform random plane maps, via the Ambjørn-Budd bijection [PDF]
, 2013 We prove that a uniform rooted plane map with n edges converges in distribution after asuitable normalization to the Brownian map for the Gromov–Hausdorff topology.
Jérémie Bettinelli +2 more
semanticscholar +1 more source
A Bijection Proving the Aztec Diamond Theorem by Combing Lattice Paths [PDF]
Electronic Journal of Combinatorics, 2012 We give a bijective proof of the Aztec diamond theorem, stating that there are $2^{n(n+1)/2}$ domino tilings of the Aztec diamond of order $n$. The proof in fact establishes a similar result for non-intersecting families of $n+1$ Schroder paths, with ...
Frédéric Bosio, M. V. Leeuwen
semanticscholar +1 more source
Bijections for Entringer families
European Journal of Combinatorics, 2011 19 ...
Gelineau, Yoann +2 more
openaire +3 more sources
Arc-Coloured Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs.
Lily Yen
doaj +1 more source
Object grammars and bijections
Theoretical Computer Science, 2003 AbstractA new systematic approach for the specification of bijections between sets of combinatorial objects is presented. It is based on the notion of object grammars. Object grammars give recursive descriptions of objects and generalize context-free grammars.
Jean-Marc Fédou, I. Dutour
openaire +2 more sources
A bijection between permutations and a subclass of TSSCPPs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We define a subclass of totally symmetric self-complementary plane partitions (TSSCPPs) which we show is in direct bijection with permutation matrices. This bijection maps the inversion number of the permutation, the position of the 1 in the last column,
Jessica Striker
doaj +1 more source
Topology and its Applications, 2000 AbstractIn this note we prove that (a) a Zσ-bijection of a σ-compact space onto a Tychonoff space is a first-level Baire isomorphism and (b) there exists an absolute Baire space of class α (α≥2) which cannot be condensed onto any absolute Baire space of class ...
openaire +2 more sources
Han's Bijection via Permutation Codes [PDF]
, 2010 We show that Han's bijection when restricted to permutations can be carried out in terms of the cyclic major code and the cyclic inversion code. In other words, it maps a permutation $\pi$ with a cyclic major code $(s_1, s_2, ..., s_n)$ to a permutation $
Chen, William Y. C. +2 more
core +2 more sources