30 citations · 30 across the 2 of their papers we have counts for
2 papers
math.PR2026
Stein's method and the modular behavior of Eulerian numbers
Jason Fulman, Adrian Röllin
The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutati…
math.PR2006★ 30 cited
A note on the exchangeability condition in Stein's method
Adrian Röllin
We show by a surprisingly simple argument that the exchangeability condition, which is key to the exchangeable pair approach in Stein's method for distributional approximation, can…