29 citations · 151 across the 31 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2017
On a Greedy Algorithm to Construct Universal Cycles for Permutations
Alice L. L. Gao, Sergey Kitaev, Wolfgang Steiner +1
A universal cycle for permutations of length is a cyclic word or permutation, any factor of which is order-isomorphic to exactly one permutation of length , and containing a…
math.CO2017★ 1 cited
Permutations and negative beta-shifts
Emilie Charlier, Wolfgang Steiner
Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove s…
math.CO2006★ 1 cited
Sequences with constant number of return words
Lubomira Balkova, Edita Pelantova, Wolfgang Steiner
An infinite word has the property if every factor has exactly return words. Vuillon showed that characterizes Sturmian words. We prove that a word satisfies i…