𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Complex polynomials and circuit lower bounds for modular counting

✍ Scribed by David A. Mix Barrington; Howard Straubing

Publisher
Springer
Year
1994
Tongue
English
Weight
810 KB
Volume
4
Category
Article
ISSN
1016-3328

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Lower bounds and upper bounds for chroma
Lower bounds and upper bounds for chromatic polynomials
✍ Klaus Dohmen πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 204 KB

## 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–Luszt
Upper and Lower Bounds for Kazhdan–Lusztig Polynomials
✍ F. Brenti πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 221 KB

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 par