Results 1 to 10 of about 8,473 (239)
Bijections for Permutation Tableaux [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 In this paper we propose a new bijection between permutation tableaux and permutations. This bijection shows how natural statistics on the tableaux are equidistributed to classical statistics on permutations: descents, RL-minima and pattern enumerations.
Sylvie Corteel, Philippe Nadeau
doaj +3 more sources
A combinatorial interpretation of the bijection of Goulden and Yong
AKCE International Journal of Graphs and Combinatorics, 2020 We define a dual of a graph, generalizing the definition of Goulden et al. (2002), which only applies to trees; then we reprove their main result using our new definition.
Kerry Ojakian
exaly +2 more sources
Geometry and complexity of O'Hara's algorithm [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 In this paper we analyze O'Hara's partition bijection. We present three type of results. First, we see that O'Hara's bijection can be viewed geometrically as a certain scissor congruence type result.
Matjaž Konvalinka, Igor Pak
doaj +1 more source
Challenges in the Computational Modeling of the Protein Structure—Activity Relationship
Computation, 2021 Living organisms are composed of biopolymers (proteins, nucleic acids, carbohydrates and lipid polymers) that are used to keep or transmit information relevant to the state of these organisms at any given time. In these processes, proteins play a central
Gabriel Del Río
doaj +1 more source
Subwords and Plane Partitions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Using the powerful machinery available for reduced words of type $B$, we demonstrate a bijection between centrally symmetric $k$-triangulations of a $2(n + k)$-gon and plane partitions of height at most $k$ in a square of size $n$.
Zachary Hamaker, Nathan Williams
doaj +1 more source
On Andrews’ Partitions with Parts Separated by Parity
Mathematics, 2021 In this paper, we present a generalization of one of the theorems in Partitions with parts separated by parity introduced by George E. Andrews, and give its bijective proof.
Abdulaziz M. Alanazi, Darlison Nyirenda
doaj +1 more source
Gog, Magog and Schützenberger II: left trapezoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We are interested in finding an explicit bijection between two families of combinatorial objects: Gog and Magog triangles. These two families are particular classes of Gelfand-Tsetlin triangles and are respectively in bijection with alternating sign ...
Philippe Biane, Hayat Cheballah
doaj +1 more source
A bijection between noncrossing and nonnesting partitions of types A and B [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{ n+1} \binom{2n}{n}$ when $\Psi =A_{n-1}$, and the binomial coefficient $\binom{2n}{n}$ when $\Psi =B_n$, and these numbers coincide with the correspondent ...
Ricardo Mamede
doaj +1 more source
Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ non ...
Frédérique Bassino, Cyril Nicaud
doaj +1 more source
Practical construction of globally injective parameterizations with positional constraints
Computational Visual Media, 2023 We propose a novel method to compute globally injective parameterizations with arbitrary positional constraints on disk topology meshes. Central to this method is the use of a scaffold mesh that reduces the globally injective constraint to a locally ...
Qi Wang +4 more
doaj +1 more source