Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic

DOI10.1006/eujc.2002.0577zbMath1010.05001OpenAlexW2063526176WikidataQ123220318 ScholiaQ123220318MaRDI QIDQ1612764

Yi Wang

Publication date: 6 May 2003

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

Full work available at URL: https://doi.org/10.1006/eujc.2002.0577

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorial inequalities (05A20)

Related Items (6)

A unified approach to polynomial sequences with only real zeros ⋮ \(q\)-log-convexity from linear transformations and polynomials with only real zeros ⋮ The excedance algebra ⋮ On the log-convexity of combinatorial sequences ⋮ Explicit expressions for the extremal excedance set statistics ⋮ Linear transformations preserving log-concavity

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New Euler-Mahonian statistics on permutations and words
• Inductive and injective proofs of log concavity results
• Maximizing the descent statistic
• Permutation statistics of indexed permutations
• Yet another triangle for the Genocchi numbers
• The excedance set of a permutation
• Combinatorics and total positivity
• Chromatic polynomials and logarithmic concavity
• Unimodal, log-concave and Pólya frequency sequences in combinatorics

This page was built for publication: Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic