On arithmetic and asymptotic properties of up-down numbers

DOI10.1016/J.DISC.2006.09.020zbMATH Open1126.05010arXivmath/0607763OpenAlexW2146855440MaRDI QIDQ879388FDOQ879388

Authors: Francis Brown, Thomas M. A. Fink, Karen Willbrand 

Publication date: 11 May 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Abstract: Let $sigma=(sigm{a}_1,\mathrm{...},sigm{a}_N)$, where $sigm{a}_i=pm1$, and let $C(sigma)$ denote the number of permutations $pi$ of $1,2,\mathrm{...},N+1,$ whose up-down signature $mathrmsign(pi(i+1)-pi(i))=sigm{a}_i$, for $i=1,\mathrm{...},N$. We prove that the set of all up-down numbers $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(sigma)$, for fixed $N$. We prove a concise upper-bound for $C(sigma)$, which describes the asymptotic behaviour of the up-down function $C(sigma)$ in the limit $C(sigma)ll(N+1)!$.

Full work available at URL: https://arxiv.org/abs/math/0607763

Recommendations

• Enumerating pairs of permutations with the same up-down form
• Some polynomials associated with up-down permutations
• Consecutive up-down patterns in up-down permutations
• Counting permutations by their alternating runs
• Cycle-up-down permutations

zbMATH Keywords

tangent numbersEuler-Bernoulli numbersrandom landscapeup-down numbers

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Exact enumeration problems, generating functions (05A15) Arithmetic progressions (11B25)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bernoulli-Euler updown numbers associated with function singularities, their combinatorics and arithmetics
• Peaks and Eulerian numbers in a random sequence
• Enumerating pairs of permutations with the same up-down form
• Enumeration of permutations with prescribed up-down and inversion sequences
• The number of permutations with a given signature, and the expectations of their elements
• Periodic de Bruijn triangles: exact and asymptotic results
• Permutations with Prescribed Pattern. II. Applications
• Permutations ayant une forme donnée
• Generalized Quotients in Coxeter Groups
• Title not available (Why is that?)

Cited In (13)

• Number of permutations with prescribed up-down structure as a function of two variables
• Enumerating pairs of permutations with the same up-down form
• Consecutive up-down patterns in up-down permutations
• Periodic de Bruijn triangles: exact and asymptotic results
• Enumerating permutations by their run structure
• Cycle-up-down permutations
• On the frequencies of patterns of rises and falls
• Title not available (Why is that?)
• Using the Entringer numbers to count the alternating permutations according a new parameter
• Refined Eulerian numbers and ballot permutations
• Ballot permutations and odd order permutations
• Some polynomials associated with up-down permutations
• Up-down coefficients for permutations

Uses Software

• OEIS

This page was built for publication: On arithmetic and asymptotic properties of up-down numbers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879388)