Torsten Mütze

activity

20092026

most citedProof of the middle levels conjecture

60 citations · 165 across the 31 of their papers we have counts for

collaborators

Showing 2016Show all

4 papers · 1 filter

math.CO2016★ 11 cited

Trimming and gluing Gray codes

Petr Gregor, Torsten Mütze

We consider the algorithmic problem of generating each subset of $[n] := {1, 2, \dots, n}$ whose size is in some interval $[k, l]$ , $0 \leq k \leq l \leq n$ , exactly once (cyclically) by…

cs.DM2016

A constant-time algorithm for middle levels Gray codes

Torsten Mütze, Jerri Nummenpalo

For any integer $n \geq 1$ a middle levels Gray code is a cyclic listing of all $n$ -element and $(n + 1)$ -element subsets of ${1, 2, \dots, 2 n + 1}$ such that any two consecutive subset…

math.CO2016★ 7 cited

A minimum-change version of the Chung-Feller theorem for Dyck paths

Torsten Mütze, Christoph Standke, Veit Wiechert

A Dyck path with $2 k$ steps and $e$ flaws is a path in the integer lattice that starts at the origin and consists of $k$ many $↗$ -steps and $k$ many $↘$ -steps that ch…

math.CO2016★ 5 cited

On universal partial words

Herman Z. Q. Chen, Sergey Kitaev, Torsten Mütze +1

A universal word for a finite alphabet $A$ and some integer $n \geq 1$ is a word over $A$ such that every word in $A^{n}$ appears exactly once as a subword (cyclically or linearly). I…