1 paper
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…