On arithmetic and asymptotic properties of up-down numbers
From MaRDI portal
(Redirected from Publication:879388)
Abstract: Let , where , and let denote the number of permutations of whose up-down signature , for . We prove that the set of all up-down numbers 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 , for fixed . We prove a concise upper-bound for , which describes the asymptotic behaviour of the up-down function in the limit .
Recommendations
Cites work
- scientific article; zbMATH DE number 1273988 (Why is no real title available?)
- scientific article; zbMATH DE number 3433888 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 3263280 (Why is no real title available?)
- scientific article; zbMATH DE number 3322983 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- Bernoulli-Euler updown numbers associated with function singularities, their combinatorics and arithmetics
- Enumerating pairs of permutations with the same up-down form
- Enumeration of permutations with prescribed up-down and inversion sequences
- Generalized Quotients in Coxeter Groups
- Peaks and Eulerian numbers in a random sequence
- Periodic de Bruijn triangles: exact and asymptotic results
- Permutations ayant une forme donnée
- Permutations with Prescribed Pattern. II. Applications
- The number of permutations with a given signature, and the expectations of their elements
Cited in
(13)- Enumerating pairs of permutations with the same up-down form
- Number of permutations with prescribed up-down structure as a function of two variables
- 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
- scientific article; zbMATH DE number 6385390 (Why is no real title available?)
- 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
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)