Results 11 to 20 of about 117,839 (222)

A Bijection for Directed-Convex Polyominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2001
In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective ...
Alberto Del Lungo   +3 more
doaj   +4 more sources

Bijective, Non-Bijective and Semi-Bijective Translations on the Triangular Plane [PDF]

open access: yesMathematics, 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   +3 more sources

Synthesizing bijective lenses [PDF]

open access: yesProceedings 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
Anders Miltner   +4 more
openaire   +2 more sources

Iterating the RSK bijection

open access: yesInvolve, a Journal of Mathematics, 2021
We investigate the dynamics of the well-known RSK bijection on permutations when iterated on various reading words of the recording tableau. In the setting of the ordinary (row) reading word, we show that there is exactly one fixed point per partition shape, and that it is always reached within two steps from any starting permutation.
Gillespie, Maria   +3 more
openaire   +2 more sources

Subwords and Plane Partitions [PDF]

open access: yesDiscrete 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

Extending from bijections between marked occurrences of patterns to all occurrences of patterns [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
We consider two recent open problems stating that certain statistics on various sets of combinatorial objects are equidistributed. The first, posed by Anders Claesson and Svante Linusson, relates nestings in matchings on $\{1,2,\ldots,2n\}$ to ...
Jeffrey Remmel, Mark Tiefenbruck
doaj   +1 more source

A new combinatorial identity for unicellular maps, via a direct bijective approach. [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2009
We give a bijective operation that relates unicellular maps of given genus to unicellular maps of lower genus, with distinguished vertices. This gives a new combinatorial identity relating the number $\epsilon_g(n)$ of unicellular maps of size $n$ and ...
Guillaume Chapuy
doaj   +1 more source

On Sillke's bijection

open access: yesTheoretical Computer Science, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Cori, Christophe Reutenauer
openaire   +1 more source

A bijection between planar constellations and some colored Lagrangian trees [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
Constellations are colored planar maps that generalize different families of maps (planar maps, bipartite planar maps, bi-Eulerian planar maps, planar cacti, ...) and are strongly related to factorizations of permutations.
Cedric Chauve
doaj   +1 more source

Modified Growth Diagrams, Permutation Pivots, and the BWX Map $\phi^*$ [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2012
In their paper on Wilf-equivalence for singleton classes, Backelin, West, and Xin introduced a transformation $\phi^*$, defined by an iterative process and operating on (all) full rook placements on Ferrers boards. Bousquet-Mélou and Steingrimsson proved
Jonathan Bloom, Dan Saracino
doaj   +1 more source

Home - About - Disclaimer - Privacy