Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic
type: Item
instance of: scholarly article
title: Proof of conjecture of Ehrenborg and Steingrímsson on excedance statistic
zbMATH Open document ID: 1010.05001
author: Yi Wang
published in: European Journal of Combinatorics
publication date: 2003-05-06T00:00:00Z
review text: This paper contains the proof of a conjecture of Ehrenborg and Steingrímsson, concerning inequalities for the numbers of permutations with prescribed excedance words. These inequalities may be viewed as general log-concavity properties of the excedance statistic.
reviewed by: Markus Fulmek
Mathematics Subject Classification ID: 05A05
Mathematics Subject Classification ID: 05A20
zbMATH DE Number: 1795953
MaRDI profile type: Publication
full work available at URL: eujc.2002.0577
OpenAlex ID: W2063526176
Wikidata QID: Q123220318
cites work: Unimodal, log-concave and Pólya frequency sequences in combinatorics
cites work: Q4320807
cites work: Combinatorics and total positivity
cites work: New Euler-Mahonian statistics on permutations and words
cites work: Maximizing the descent statistic
cites work: The excedance set of a permutation
cites work: Yet another triangle for the Genocchi numbers
cites work: Chromatic polynomials and logarithmic concavity
cites work: Inductive and injective proofs of log concavity results
cites work: Q3748279
cites work: Q4294628
cites work: Permutation statistics of indexed permutations
DOI: 10.1006/EUJC.2002.0577
description: scientific article; zbMATH DE number 1795953