2 citations · 5 across the 4 of their papers we have counts for
4 papers
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…
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…
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.
Cayley graphs formed by conjugate generating sets of S_n
Jacob Steinhardt
We investigate subsets of the symmetric group with structure similar to that of a graph. The trees of these subsets correspond to minimal conjugate generating sets of the symmetric…