2 citations · 3 across the 3 of their papers we have counts for
3 papers
math.RT2025
Sharp character bounds and cutoff for symmetric groups
Sam Olesker-Taylor, Lucas Teyssier, Paul Thévenin
We develop a flexible technique to bound the characters of symmetric groups, via the Naruse hook length formula, the Larsen--Shalev character bounds, and appropriate diagram slicin…
math.PR2021★ 1 cited
Cutoff for Rewiring Dynamics on Perfect Matchings
Sam Olesker-Taylor
We establish cutoff for a natural random walk (RW) on the set of perfect matchings (PMs). An -PM is a pairing of objects. The -PM RW selects pairs uniformly at rando…
math.PR2020★ 2 cited
Metastability in Loss Networks with Dynamic Alternative Routing
Sam Olesker-Taylor
Consider stations interconnected with links, each of capacity , forming a complete graph. Calls arrive to each link at rate and depart at rate . If a call arrives to…