2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.CO2009★ 1 cited
Permutations with Ascending and Descending Blocks
Jacob Steinhardt
We investigate permutations in terms of their cycle structure and descent set. To do this, we generalize the classical bijection of Gessel and Reutenauer to deal with permutations…
math.CO2009★ 2 cited
Derangements with Ascending and Descending Blocks
Jacob Steinhardt
We continue the work of Eriksen, Freij, and Wastlund [3], who study derangements that descend in blocks of prescribed lengths. We generalize their work to derangements that ascend…
math.CO2009
On Coloring the Odd-Distance Graph
Jacob Steinhardt
We present a proof, using spectral techniques, that there is no finite measurable coloring of the odd-distance graph.