𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Proof of Reutenauer's −q(n)Conjecture

✍ Scribed by William F. Doran IV

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
181 KB
Volume
74
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

C. Reutenauer (Adv. in Math. 110 (1995), 234 246) has defined a new class of symmetric functions q * indexed by partitions *. He conjectures that for n 2, &q (n) is the sum of Schur symmetric functions. This paper provides a proof of his conjecture.

📜 SIMILAR VOLUMES

Proof of a conjecture of Alan Hartman
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

Squaring a tournament: A proof of Dean's
Squaring a tournament: A proof of Dean's conjecture
✍ Fisher, David C. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 2 views

Let the square of a tournament be the digraph on the same nodes with arcs where the directed distance in the tournament is at most two. This paper verifies Dean's conjecture: any tournament has a node whose outdegree is at least doubled in its square. 0

Proof of Mader's conjecture on k-critica
Proof of Mader's conjecture on k-critical n-connected graphs
✍ Su Jianji 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB 👁 1 views

## Abstract Mader conjectured that every __k__‐critical __n__‐connected noncomplete graph __G__ has __2k__ + 2 pairwise disjoint fragments. The author in 9 proved that the conjecture holds if the order of __G__ is greater than (__k__ + 2)__n__. Now we settle this conjecture completely. © 2004 Wiley

A Weil-Bound Free Proof of Schur's Conje
A Weil-Bound Free Proof of Schur's Conjecture
✍ Peter Müller 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Let f be a polynomial with coefficients in the ring O K of integers of a number field. Suppose that f induces a permutation on the residue fields O K /ᒍ for infinitely many nonzero prime ideals ᒍ of O K . Then Schur's conjecture, namely that f is a composition of linear and Dickson polynomials, has

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