A probabilistic approach to the descent statistic
Given a permutation \(\sigma= \sigma_1\cdots \sigma_{n+1}\) of \(\{1,\dots, n+1\}\), the decent word \(u= u_1\cdots u_n\) is the word in variables \(a\) and \(b\) with \(u_i= a\) if \(\sigma_i> \sigma_{i+1}\) and \(b\) otherwise. For an \(ab\)-word \(u\), the decent statistic is the number of permutations having \(u\) as decent word. The authors present a probabilistic approach to studying the decent based upon a two-variable probability density deriving quadratic inequalities for the descent statistic. Using Fourier series, they give exact expressions for the Euler numbers and the alternating \(r\)-signed permutations. They also obtain a probabilistic interpretation of the sin function.
- Maximizing the descent statistic
- Descent representations and multivariate statistics
- Martingales and descent statistics
- A Monte Carlo approach to calculating probabilities for continuous identity by descent data
- On the powers of the descent set statistic
- scientific article; zbMATH DE number 2127746
- Asymptotic line-of-descent distributions
- A central limit theorem for the number of descents and some urn models
- A new operation on sequences: The boustrophedon transform
- Extremal problems for the Möbius function in the face lattice of the n-octahedron
- Generalized Dehn-Sommerville relations for polytopes, spheres and Eulerian partially ordered sets
- scientific article; zbMATH DE number 3983158 (Why is no real title available?)
- scientific article; zbMATH DE number 486467 (Why is no real title available?)
- scientific article; zbMATH DE number 665694 (Why is no real title available?)
- scientific article; zbMATH DE number 854874 (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?)
- Maximizing Möbius functions on subsets of Boolean algebras
- Maximizing the descent statistic
- Permutation statistics of indexed permutations
- Permutations ayant une forme donnée
- The asymptotics of almost alternating permutations
- The excedance set of a permutation
- The extended f-vectors of 4-polytopes
- The r-cubical lattice and a generalization of the cd-index
- Équidistribution des permutations ayant une forme donnée selon les avances et coavances
- Cyclotomic factors of the descent set polynomial
- Enumerating S_n by associated transpositions and linear extensions of finite posets
- Maximizing the descent statistic
- Descent pattern avoidance
- Zigzag diagrams and Martin boundary
- The expectation of the Vandermonde product squared for uniform random variables
- A Monte Carlo approach to calculating probabilities for continuous identity by descent data
- Cyclically consecutive permutation avoidance
- The Ehrhart and face polynomials of the graph polytope of a cycle
- The \(f\)-vector of the descent polytope
- The density method and permutations with a prescribed descent set
- The asymptotics of almost alternating permutations
- Volumes of consecutively defined sets
- Asymptotics of the Euler number of bipartite graphs
This page was built for publication: A probabilistic approach to the descent statistic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601427)
