40 citations · 40 across the 2 of their papers we have counts for
3 papers
math.CO2012
The depth of a permutation
T. Kyle Petersen, Bridget Eileen Tenner
For the elements of a Coxeter group, we present a statistic called depth, defined in terms of factorizations of the elements into products of reflections. Depth is bounded above by…
math.CO2009★ 40 cited
On -vectors satisfying the Kruskal-Katona inequalities
Eran Nevo, T. Kyle Petersen
We present examples of flag homology spheres whose -vectors satisfy the Kruskal-Katona inequalities. This includes several families of well-studied simplicial complexes, includi…
math.CO2005
Conway's napkin problem
Anders Claesson, T. Kyle Petersen
The napkin problem was first posed by John H. Conway, and written up as a `toughie' in "Mathematical Puzzles: A Connoisseur's Collection," by Peter Winkler. To paraphrase Winkler's…