✦ LIBER ✦

A formula for the characteristic polynomial of an arrangement

✍ Scribed by L Solomon; H Terao

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 910 KB
Volume: 64
Category: Article
ISSN: 0001-8708
DOI: 10.1016/0001-8708(87)90011-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Convolution Formula for the Tutte Poly

A Convolution Formula for the Tutte Polynomial

✍ W. Kook; V. Reiner; D. Stanton 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 75 KB

Following Crapo [2], let `(x, y)(M)=x r(M) y r(M\*) , where K=Z[x, y]. Lemma 1. `(x, y) &1 =`(&x, &y).

An Asymptotic Formula for the Number of

An Asymptotic Formula for the Number of Smooth Values of a Polynomial

✍ Greg Martin 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 402 KB

An explicit formula for the generalized

An explicit formula for the generalized Bernoulli polynomials

✍ H.M Srivastava; Pavel G Todorov 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 176 KB

The Counting Polynomial of a Supersolvab

The Counting Polynomial of a Supersolvable Arrangement

✍ L. Paris 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 218 KB

An Approximate Formula for the Expected

An Approximate Formula for the Expected Number of Real Zeros of a Random Polynomial

✍ K. Farahmand; N.H. Smith 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Several identities for the characteristi

Several identities for the characteristic polynomial of a combinatorial geometry

✍ Tom Brylawski; James Oxley 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 992 KB

In this paper we explore a research problem of Greene: to find inequalities for the Miibius function which become equalities in the presence of modularity. We replace these inequalities with identities and give combinatorial interpretations for the difference.