2 papers
math.CO2026
On shortening universal words for multi-dimensional permutations
Sergey Kitaev, Dun Qiu
A universal word (u-word) for -dimensional permutations of length is a 2-dimensional word with rows, any size window of which is order-isomorphic to exactly one pe…
math.CO2026
Eulerian-type polynomials over matchings and matching permutations
Shi-Mei Ma, Sergey Kitaev, Jean Yeh +1
Claesson and Linusson [Proc. Am. Math. Soc., 139 (2011), 435-449] observed that there are n! matchings on [2n] with no left-nestings. Inspired by this result, this paper is devoted…