## Abstract In this paper we give lower bounds and upper bounds for chromatic polynomials of simple undirected graphs on __n__ vertices having __m__ edges and girth exceeding __g__ © 1993 John Wiley & Sons, Inc.
Upper and Lower Bounds for Kazhdan–Lusztig Polynomials
✍ Scribed by F. Brenti
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 221 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0195-6698
No coin nor oath required. For personal study only.
✦ Synopsis
We give upper and lower bounds for the Kazhdan-Lusztig polynomials of any Coxeter group W . If W is finite we prove that, for any k ≥ 0, the kth coefficient of the Kazhdan-Lusztig polynomial of two elements u, v of W is bounded from above by a polynomial (which depends only on k) in l(v)l(u). In particular, this implies the validity of Lascoux-Schutzenberger's conjecture for all sufficiently long intervals, and gives supporting evidence in favour of the Dyer-Lusztig conjecture.
📜 SIMILAR VOLUMES
We consider the Kazhdan Lusztig R-polynomials, R u, v (q) indexed by permutations ``u, v'' having particular forms. More precisely, we show that R e, 34 } } } n12 (q) (where ``e'' denotes the identity permutation) equals, aside from a simple change of variable, a q-analogue of the Fibonacci number,
Most engineering problems are solved by means of numerical methods that are able to provide only approximate solutions, for which it would be extremely useful to have efficient error estimators. Upper and lower bounds for quantities of integral character, like the stored magnetic energy or the ohmi