In this paper we prove that Sendov's conjecture is true for polynomials of degree Ž . n s 6 we even determine the so-called extremal polynomials in this case , as well as for polynomials with at most six different zeros. We then generalize this last Ž . Ž . result to polynomials of degree n with at
On the Neggers–Stanley Conjecture and the Eulerian Polynomials
✍ Scribed by Vesselin Gasharov
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 387 KB
- Volume
- 82
- Category
- Article
- ISSN
- 0097-3165
No coin nor oath required. For personal study only.
✦ Synopsis
We prove combinatorially that the W-polynomials of naturally labeled graded posets of rank 1 or 2 (an antichain has rank 0) are unimodal, thus providing further supporting evidence for the Neggers Stanley conjecture. For such posets we also obtain a combinatorial proof that the W-polynomials are symmetric. Combinatorial proofs that the Eulerian polynomials are log-concave and unimodal are given and we construct a simplicial complex 2 with the property that the Hilbert function of the exterior algebra modulo the Stanley Reisner ideal of 2 is the sequence of Eulerian numbers, thus providing a combinatorial proof of a result of Brenti.
1998 Academic Press
1. Introduction
Let P=(P, O) be a poset with n elements and *: P Ä [1, 2, ..., n] a labeling of the vertices of P. A permutation |=| 1 } } } | n # S n is said to be (P, *)-compatible if * &1 (| i ) O P * &1 (| j ) implies i< j. For i 1 let d i (P, *) be the number of (P, *)-compatible permutations with i descents. The W-polynomial of the pair (P, *) is defined by
( 1 )
Two labelings * and + of P are called equivalent if *(x)<*( y) +(x)< +( y) for all x, y # P such that y covers x. It can be shown that as a function of *, W(P, *, t) depends only on the equivalence class of *. If P is a graded poset of rank 0 (i.e., an antichain), then W(P, *, t)=A n (t), the n th Eulerian polynomial. It is well known that the Eulerian polynomials have only real zeros. There is a conjectured generalization of this fact due to Neggers and Stanley (see [2,12,13,18]).
📜 SIMILAR VOLUMES
Proving a conjecture of Wilf and Stanley in hitherto the most general case, we show that for any layered pattern q there is a constant c so that q is avoided by less than c n permutations of length n. This will imply the solution of this conjecture for at least 2 k patterns of length k, for any k.
## Abstract C. Thomassen proposed a conjecture: Let __G__ be a __k__‐connected graph with the stability number α ≥ __k__, then __G__ has a cycle __C__ containing __k__ independent vertices and all their neighbors. In this paper, we will obtain the following result: Let __G__ be a __k__‐connected gr
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
## Abstract Gol'dberg has recently constructed an infinite family of 3‐critical graphs of even order. We now prove that if there exists a __p__(≥4)‐critical graph __K__ of odd order such that __K__ has a vertex __u__ of valency 2 and another vertex __v__ ≠ __u__ of valency ≤(__p__ + 2)/2, then ther