On arithmetic and asymptotic properties of up-down numbers
F. C. S. Brown, T. M. A. Fink, K. Willbrand
Abstract
Let σ=(σ1,..., σN), where σi = 1, and let C(σ) denote the number of permutations π of 1,2,..., N+1, whose up-down signature sign(π(i+1)-π(i))=σi, for i=1,...,N. We prove that the set of all up-down numbers C(σ) can be expressed by a single universal polynomial Φ, whose coefficients are products of numbers from the Taylor series of the hyperbolic tangent function. We prove that Φ is a modified exponential, and deduce some remarkable congruence properties for the set of all numbers C(σ), for fixed N. We prove a concise upper-bound for C(σ), which describes the asymptotic behaviour of the up-down function C(σ) in the limit C(σ) (N+1)!.
Create a lesson
Related papers
Graded Ehrhart theory for hypersimplices
Nathaniel Libman, Weston Miller
Closing the gap and settling the problem of queens on an n× n board, each attacking at most one other
Kristina Ago, Bojan Bašić, Radojka Ciganović
Leading term strandings for webs
Michael Bo, Madelyn Burns, Junyang Chen et al.
Refutation of the Non-Cancelling-Intersections Conjecture
Hermann Wilhelm
Asymptotic Bounds for Online Ramsey Numbers of Stars versus Long Paths and Cycles
Sam Beilis, Israel R. Curbelo, Elizabeth R. Koizumi
The Erdos--Gallai bound for consecutive even cycle lengths
Yaobin Chen, Hong Liu, Xia Wang et al.