Results 41 to 50 of about 3,063 (228)
Conditions on a map \(f:L\to M\) from a lattice L to a lattice M are considered under which f is a homomorphism of lattices in the case when f is a bijection. The main result of the paper is the following Theorem 4. Let L and M be lattices and let f:\(L\to M\) be a bijection.
Johnson, J., Moss, K.
openaire +2 more sources
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.
Jacob Hocevar +3 more
openaire +3 more sources
Continuity of the Mackey–Higson bijection [PDF]
12 pages, to appear in the Pacific Journal of ...
Afgoustidis, Alexandre +1 more
openaire +3 more sources
The active bijection for graphs
62 pages, 10 figures, many ...
Gioan, Emeric, Las Vergnas, Michel
openaire +5 more sources
Bijective Proofs of Partition Identities of MacMahon, Andrews, and Subbarao [PDF]
We revisit a classic partition theorem due to MacMahon that relates partitions with all parts repeated at least once and partitions with parts congruent to $2,3,4,6 \pmod{6}$, together with a generalization by Andrews and two others by Subbarao.
Shishuo Fu, James Sellers
doaj +1 more source
On bijections between monotone rooted trees and the comb basis [PDF]
Let $A$ be an $n$-element set. Let $\mathscr{L} ie_2(A)$ be the multilinear part of the free Lie algebra on $A$ with a pair of compatible Lie brackets, and $\mathscr{L} ie_2(A, i)$ the subspace of $\mathscr{L} ie_2(A)$ generated by all the monomials in $\
Fu Liu
doaj +1 more source
Object grammars and bijections
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jean-Marc Fédou, I. Dutour
openaire +2 more sources
A further correspondence between $(bc,\bar{b})$-parking functions and $(bc,\bar{b})$-forests [PDF]
For a fixed sequence of $n$ positive integers $(a,\bar{b}) := (a, b, b,\ldots, b)$, an $(a,\bar{b})$-parking function of length $n$ is a sequence $(p_1, p_2, \ldots, p_n)$ of positive integers whose nondecreasing rearrangement $q_1 \leq q_2 \leq \cdots ...
Heesung Shin, Jiang Zeng
doaj +1 more source
Arc-Coloured Permutations [PDF]
The equidistribution of many crossing and nesting statistics exists in several combinatorial objects like matchings, set partitions, permutations, and embedded labelled graphs.
Lily Yen
doaj +1 more source
A bijection between permutations and a subclass of TSSCPPs [PDF]
We define a subclass of totally symmetric self-complementary plane partitions (TSSCPPs) which we show is in direct bijection with permutation matrices. This bijection maps the inversion number of the permutation, the position of the 1 in the last column,
Jessica Striker
doaj +1 more source

