✦ LIBER ✦

Log Concavity of a Sequence in a Conjecture of Simion

✍ Scribed by Martin Hildebrand

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 84 KB
Volume: 97
Category: Article
ISSN: 0097-3165
DOI: 10.1006/jcta.2001.3199

No coin nor oath required. For personal study only.

✦ Synopsis

Simion presented a conjecture involving the unimodality of a sequence whose elements are the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. In this paper, the author uses ideas from an earlier paper where special cases of this conjecture were proved to prove log concavity and unimodality of the sequence.

📜 SIMILAR VOLUMES

A Simple Proof of a Conjecture of Simion

✍ Yi Wang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

Simion had a unimodality conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. Hildebrand recently showed the stronger result that these numbers are log concave. Here we present a simple proof of Hildebrand's result.

The Numbers of Dependent k-Sets in a Gra

The Numbers of Dependent k-Sets in a Graph Are Log Concave

✍ David G.C. Horrocks 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 69 KB

A Combinatorial Proof of the Log-Concavi

A Combinatorial Proof of the Log-Concavity of the Numbers of Permutations with k Runs

✍ Miklós Bóna; Richard Ehrenborg 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 178 KB

A Proof of the Welch and Niho Conjecture

A Proof of the Welch and Niho Conjectures on Cross-Correlations of Binary m-Sequences

✍ Henk D.L. Hollmann; Qing Xiang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Binary m-sequences are widely applied in navigation, radar, and communication systems because of their nice autocorrelation and cross-correlation properties. In this paper, we consider the cross-correlation between a binary m-sequence of length 2K!1 and a decimation of that sequence by an integer t.

Proof of a conjecture on cycles in a bip

Proof of a conjecture on cycles in a bipartite graph

✍ Wang, Hong 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 244 KB 👁 2 views

It was conjectured in [Wang, to appear in The Australasian Journal of Combinatorics] that, for each integer k ≥ 2, there exists . This conjecture is also verified for k = 2, 3 in [Wang, to appear; Wang, manuscript]. In this article, we prove this conjecture to be true if n ≥ 3k, i.e., M (k) ≤ 3k. W

A Proof of a Conjecture of Bondy Concern

A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs

✍ B. Bollobás; A.D. Scott 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in e