Results 11 to 20 of about 132,418 (291)
Geometry and complexity of O'Hara's algorithm [PDF]
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 +10 more sources
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 +8 more sources
Classification of bijections between 321- and 132-avoiding permutations [PDF]
It is well-known, and was first established by Knuth in 1969, that the number of 321-avoiding permutations is equal to that of 132-avoiding permutations. In the literature one can find many subsequent bijective proofs confirming this fact.
Anders Claesson, Sergey Kitaev
doaj +8 more sources
An explicit bijection between semistandard tableaux and non-elliptic sl3 webs [PDF]
The sl3 spider is a diagrammatic category used to study the representation theory of the quantum group Uq(sl3). The morphisms in this category are generated by a basis of non-elliptic webs. Khovanov–Kuperberg observe that non-elliptic webs are indexed by
Heather M. Russell
semanticscholar +6 more sources
Generating Bijections between HOAS and the Natural Numbers [PDF]
A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a ``not equals'' relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term family to ...
John Tang Boyland
doaj +4 more sources
The Canonical Bijection between Pipe Dreams and Bumpless Pipe Dreams [PDF]
We present a direct bijection between reduced pipe dreams and reduced bumpless pipe dreams (BPDs) by interpreting reduced compatible sequences on BPDs and show that this is the unique bijection preserving bijective realizations of Monk’s formula ...
Yibo Gao, Daoji Huang
semanticscholar +1 more source
A short Rogers-Ramanujan bijection
David M. Bressoud, Doron Zeilberger
openalex +3 more sources
A Bijection Between K-Kohnert Diagrams and Reverse Set-Valued Tableaux
Lascoux polynomials are K-theoretic analogues of the key polynomials. They both have combinatorial formulas involving tableaux: reverse set-valued tableaux (RSVT) rule for Lascoux polynomials and reverse semistandard Young tableaux (RSSYT) rule for key ...
Jia-Bin Pan, Tianyi Yu
semanticscholar +1 more source
Bijective, Non-Bijective and Semi-Bijective Translations on the Triangular Plane [PDF]
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
A bijection between planar constellations and some colored Lagrangian trees [PDF]
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