✦ LIBER ✦

Proof of Verma's conjecture on Weyl's dimension polynomial

✍ Scribed by S. G. Hulsurkar

Publisher: Springer-Verlag
Year: 1974
Tongue: English
Weight: 351 KB
Volume: 27
Category: Article
ISSN: 0020-9910
DOI: 10.1007/bf01389964

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Proof of a Chromatic Polynomial Conjectu

Proof of a Chromatic Polynomial Conjecture

✍ 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))

Proof of Nishida's Conjecture on Anharmo

Proof of Nishida's Conjecture on Anharmonic Lattices

✍ Bob Rink 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 213 KB

Lenstra′s Proof of the Carlitz-Wan Conje

Lenstra′s Proof of the Carlitz-Wan Conjecture on Exceptional Polynomials: An Elementary Version

✍ S.D. Cohen; M.D. Fried 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 167 KB

We give a proof, following an argument of Lenstra, of the conjecture of Carlitz (1966) as generalized by Wan (1993). This says that there are no exceptional polynomials of degree \(n\) over \(\mathbb{F}_{q}\) if \((n, q-1)>1\). Fried, Guralnick, and Saxl previously proved Carlitz's conjecture: there

A generalisation of Jury’s conjecture to

A generalisation of Jury’s conjecture to arbitrary dimensions and its proof

✍ Martin Scheicher 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 208 KB

On Mañé’s Proof of theC1Stability Conjec

On Mañé’s Proof of theC1Stability Conjecture

✍ Yong Zhang; Shao Bo Gan 📂 Article 📅 2004 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 181 KB

Proof of a Conjecture of Bollob?s on Nes

Proof of a Conjecture of Bollob?s on Nested Cycles

✍ Guantao Chen; Paul Erdós; William Staton 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 221 KB

For any positive integer k, a minimum degree condition is obtained which forces a graph to have k edge-disjoint cycles C 1 , C 2 , ..., C k such that V(C 1