𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Proof of a Conjecture of Ehrenborg and Steingrı́msson on Excedance Statistic

✍ Scribed by Yi Wang

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
95 KB
Volume
23
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis

We give an affirmative answer to a conjecture of Ehrenborg and Steingrímsson on the general log-concavity of the excedance statistic.

📜 SIMILAR VOLUMES

The Excedance Set of a Permutation
The Excedance Set of a Permutation
✍ Richard Ehrenborg; Einar Steingrı́msson 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 124 KB

The excedance set of a permutation π = π 1 π 2 • • • π n is the set of indices i for which π i > i. We give a formula for the number of permutations with a given excedance set and recursive formulas satisfied by these numbers. We prove log-concavity of certain sequences of these numbers and we show

On a conjecture of Aris: Proof and remar
On a conjecture of Aris: Proof and remarks
✍ Dan Luss; Neal R. Amundson 📂 Article 📅 1967 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 428 KB 👁 2 views
Proof of a conjecture on game domination
Proof of a conjecture on game domination
✍ O. Favaron; H. Karami; R. Khoeilar; S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 87 KB 👁 1 views

## Abstract The game domination number of a (simple, undirected) graph is defined by the following game. Two players, \documentclass{article}\usepackage{amssymb}\usepackage{amsbsy}\usepackage[mathscr]{euscript}\footskip=0pc\pagestyle{empty}\begin{document}${\mathcal{A}}$\end{document} and \docume

Proof of a conjecture on Genocchi number
Proof of a conjecture on Genocchi numbers
✍ John Riordan; Paul R. Stein 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 446 KB

In [ I ]I, Gandhi has stated the following conjecture on Genocchi numbl:rs: ## . z;(t~-I)~ . The meaning of the odd notation on the 1e:ft of (1) is as follows: write . . . C(k+n-1)2 ; then ## K(n+l,k)=k2K(n,k+lj-(k-l)2~(~~,k~ K(1,k)=k2-(k-1;j2 =2k--1 alId, af course, (1) is restated as (1')

Proof of a conjecture on fractional Rams
Proof of a conjecture on fractional Ramsey numbers
✍ Jason Brown; Richard Hoshino 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

## Abstract Jacobson, Levin, and Scheinerman introduced the fractional Ramsey function __r__~__f__~ (__a__~1~, __a__~2~, …, __a__~__k__~) as an extension of the classical definition for Ramsey numbers. They determined an exact formula for the fractional Ramsey function for the case __k__=2. In this