๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A Simple Proof of a Conjecture of Simion

โœ Scribed by Yi Wang


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
73 KB
Volume
100
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

โœฆ Synopsis


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.


๐Ÿ“œ SIMILAR VOLUMES


Log Concavity of a Sequence in a Conject
โœ Martin Hildebrand ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 84 KB

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

Proof of a conjecture of nirenberg
โœ Robert Osserman ๐Ÿ“‚ Article ๐Ÿ“… 1959 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 209 KB ๐Ÿ‘ 1 views
Proof of a Chromatic Polynomial Conjectu
โœ F.M. Dong ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 138 KB

Let P(G, \*) denote the chromatic polynomial of a graph G. It is proved in this paper that for every connected graph G of order n and real number \* n, (\*&2) n&1 P(G, \*)&\*(\*&1) n&2 P(G, \*&1) 0. By this result, the following conjecture proposed by Bartels and Welsh is proved: P(G, n)(P(G, n&1))

A New Proof of a Conjecture of Antoniadi
โœ Zhenfu Cao; Shanzhi Mu; Xiaolei Dong ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 96 KB

We give a new and elementary proof that the equation x 3 &1=31y 2 has only the integral solutions (x, y)=(1, 0), (5, 2), (5, &2).

Proof of a conjecture of Alan Hartman
โœ Liu, Q. Z.; Yap, H. P. ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 265 KB ๐Ÿ‘ 2 views

A tree T is said to be bad, if it is the vertex-disjoint union of two stars plus an edge joining the center of the first star to an end-vertex of the second star. A tree T is good, if it is not bad. In this article, we prove a conjecture of Alan Hartman that, for any spanning tree T of K 2m , where

A Proof of a Conjecture of C.L. Siegel
โœ J.T. Ding ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 243 KB

Let \(M_{n}\) be the Minkowski fundamental domain for the space of \(n \times n\) real, symmetric, and positive definite matrices under the action of the unimodular group \(S L_{n}(Z)\). C. L. Siegel conjectured that \(d(A, B)-f(A, B) \leqslant C(n)\), for \(A, B \in M_{n}\), where \(d\) and \(f\) a