Higher Order Log-Concavity in Euler's Difference Table
Abstract
Let enk be the entries in the classical Euler's difference table. We consider the array dnk=enk/k! for 0≤ k ≤ n, where dnk can be interpreted as the number of k-fixed-points-permutations of [n]. We show that the sequence \dnk\0≤ k≤ n is 2-log-concave and reverse ultra log-concave for any given n.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.