Results 21 to 30 of about 3,063 (228)
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
Bijective, Non-Bijective and Semi-Bijective Translations on the Triangular Plane [PDF]
Mathematics, 2019 The triangular plane is the plane which is tiled by the regular triangular tessellation. The underlying discrete structure, the triangular grid, is not a point lattice. There are two types of triangle pixels. Their midpoints are assigned to them. By having a real-valued translation of the plane, the midpoints of the triangles may not be mapped to ...
Khaled Abuhmaidan, Benedek Nagy
openaire +2 more sources
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
Synthesizing bijective lenses [PDF]
Proceedings of the ACM on Programming Languages, 2017 Bidirectional transformations between different data representations occur frequently in modern software systems. They appear as serializers and deserializers, as parsers and pretty printers, as database views and view updaters, and as a multitude of different kinds of ad hoc data converters. Manually building bidirectional transformations---by writing
Benjamin C. Pierce +4 more
openaire +3 more sources
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
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
Discrete Mathematics & Theoretical Computer Science, 2012 We present an equivariant bijection between two actions—promotion and rowmotion—on order ideals in certain posets. This bijection simultaneously generalizes a result of R.
Jessica Striker, Nathan Williams
doaj +1 more source
Another bijection between $2$-triangulations and pairs of non-crossing Dyck paths [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 A $k$-triangulation of the $n$-gon is a maximal set of diagonals of the $n$-gon containing no subset of $k+1$ mutually crossing diagonals. The number of $k$-triangulations of the $n$-gon, determined by Jakob Jonsson, is equal to a $k \times k$ Hankel ...
Carlos M. Nicolás
doaj +1 more source