Results 11 to 20 of about 8,688 (230)

A bijection for nonorientable general maps [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
We give a different presentation of a recent bijection due to Chapuy and Dołe ̨ga for nonorientable bipartite quadrangulations and we extend it to the case of nonorientable general maps.
Jérémie Bettinelli
doaj   +3 more sources

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

Relative Auslander bijection in $n$-exangulated categories [PDF]

open access: yes, 2023
summary:The aim of this article is to study the relative Auslander bijection in \hbox {$n$-exangulated} categories. More precisely, we introduce the notion of generalized Auslander-Reiten-Serre duality and exploit a bijection triangle, which involves the
Zhou, Panyue, He, Jian, He, Jing
core   +1 more source

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

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

A BIJECTION FOR PARTITIONS SIMULTANEOUSLY s-REGULAR AND t-DISTINCT

open access: yes, 2023
In this note a bijection is constructed between the set of partitions of $n$ simultaneously $s$-regular and $t$-distinct, and those simultaneously $t$-regular and $s$-distinct. Some implications of the map are discussed.
Keith, William J.
core   +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

A bijection for essentially 3-connected toroidal maps

open access: yes, 2021
International audienceWe present a bijection for toroidal maps that are essentially 3-connected (3-connected in the periodic planar representation). Our construction actually proceeds on certain closely related bipartite toroidal maps with all faces of ...
Lévêque, Benjamin   +5 more
core   +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

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

Home - About - Disclaimer - Privacy