Analysis of bidirectional ballot sequences and random walks ending in their maximum

DOI10.1007/s00026-016-0330-0zbMath1358.05019arXiv1503.08790OpenAlexW3100204116WikidataQ59461303 ScholiaQ59461303MaRDI QIDQ505696

Clemens Heuberger, Benjamin Hackl, Stephan G. Wagner, Prodinger, Helmut

Publication date: 26 January 2017

Published in: Annals of Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

asymptotic expansionChebyshev polynomiallattice pathballot sequenceculminating path

Mathematics Subject Classification ID

Sums of independent random variables; random walks (60G50) Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (4)

Some combinatorial matrices and their LU-decomposition ⋮ Pattern avoiding permutations with a unique longest increasing subsequence ⋮ The bidirectional ballot polytope ⋮ Generating 2-Gray codes for ballot sequences in constant amortized time

Uses Software

• SageMath
• DLMF
• OEIS

Cites Work

• Mellin transforms and asymptotics: Harmonic sums
• Constructing MSTD sets using bidirectional ballot sequences
• Basic analytic combinatorics of directed lattice paths
• A Course in Enumeration
• Culminating paths
• On the coefficients of the asymptotic expansion of n!
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of bidirectional ballot sequences and random walks ending in their maximum