All your bases are belong to us: listing all bases of a matroid by greedy exchanges
You provide us with a matroid and an initial base. We say that a subset of the bases"
belongs to us" if we can visit each one via a sequence of base exchanges starting from the …
belongs to us" if we can visit each one via a sequence of base exchanges starting from the …
Flip-swap languages in binary reflected Gray code order
A flip-swap language is a set S of binary strings of length n such that S∪{0 n} is closed
under two operations (when applicable):(1) Flip the leftmost 1; and (2) Swap the leftmost 1 …
under two operations (when applicable):(1) Flip the leftmost 1; and (2) Swap the leftmost 1 …
[PDF][PDF] Gray codes for restricted ascent sequences
M Tomie - pp2017.github.io
An ascent sequence is a sequence x1x2··· xn of nonnegative integers such that x1= 0 and
xi≤ asc (x1x2··· xi− 1)+ 1(1) for 2≤ i≤ n, where asc (x1x2··· xk) is the number of ascents in …
xi≤ asc (x1x2··· xi− 1)+ 1(1) for 2≤ i≤ n, where asc (x1x2··· xk) is the number of ascents in …
Hamiltonian cycles for the square of the augmentation graphs and Gray codes for restricted permutations and ascent sequences
M Tomie - arXiv preprint arXiv:1612.03620, 2016 - arxiv.org
In this paper, we construct a listing for the vertices of the augmentation graph of given size,
and as a consequence, we obtain a Hamiltonian cycle for the square of the augmentation …
and as a consequence, we obtain a Hamiltonian cycle for the square of the augmentation …