Results 21 to 30 of about 8,473 (239)
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 +3 more sources
Relative Auslander bijection in $n$-exangulated categories
, 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
Extending from bijections between marked occurrences of patterns to all occurrences of patterns [PDF]
Discrete 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]
Discrete 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
A bijection between planar constellations and some colored Lagrangian trees [PDF]
Discrete 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]
Discrete 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
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Robert Cori, Christophe Reutenauer
openaire +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
Optimal Subsequence Bijection [PDF]
Seventh IEEE International Conference on Data Mining (ICDM 2007), 2007 We consider the problem of elastic matching of sequences of real numbers. Since both a query and a target sequence may be noisy, i.e., contain some outlier elements, it is desirable to exclude the outlier elements from matching in order to obtain a robust matching performance. Moreover, in many applications like shape alignment or stereo correspondence
Longin Jan Latecki +3 more
openaire +2 more sources
Involve, 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