English

On arithmetic and asymptotic properties of up-down numbers

Combinatorics 2007-05-23 v1 Number Theory

Abstract

Let σ=(σ1,...,σN)\sigma=(\sigma_1,..., \sigma_N), where σi=±1\sigma_i =\pm 1, and let C(σ)C(\sigma) denote the number of permutations π\pi of 1,2,...,N+1,1,2,..., N+1, whose up-down signature sign(π(i+1)π(i))=σi\mathrm{sign}(\pi(i+1)-\pi(i))=\sigma_i, for i=1,...,Ni=1,...,N. We prove that the set of all up-down numbers C(σ)C(\sigma) can be expressed by a single universal polynomial Φ\Phi, whose coefficients are products of numbers from the Taylor series of the hyperbolic tangent function. We prove that Φ\Phi is a modified exponential, and deduce some remarkable congruence properties for the set of all numbers C(σ)C(\sigma), for fixed NN. We prove a concise upper-bound for C(σ)C(\sigma), which describes the asymptotic behaviour of the up-down function C(σ)C(\sigma) in the limit C(σ)(N+1)!C(\sigma) \ll (N+1)!.

Keywords

Cite

@article{arxiv.math/0607763,
  title  = {On arithmetic and asymptotic properties of up-down numbers},
  author = {F. C. S. Brown and T. M. A. Fink and K. Willbrand},
  journal= {arXiv preprint arXiv:math/0607763},
  year   = {2007}
}

Comments

Recommended for publication in Discrete Mathematics subject to revisions