𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Counting Polynomial of a Supersolvable Arrangement

✍ Scribed by L. Paris

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
218 KB
Volume
116
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On Counting the k-face Cells of Cyclic A
On Counting the k-face Cells of Cyclic Arrangements
✍ D. Forge; J.L. RamΔ±́rez AlfonsΔ±́n πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 84 KB

In this paper, we compute the exact number of k-face cells of the cyclic arrangements which are the dual to the well-known cyclic polytopes. The proof uses the combinatorial interpretation of arrangements in terms of oriented matroids.

Counting the Shape of a Drum
Counting the Shape of a Drum
✍ Yu. Baryshnikov πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 272 KB

Let P be a convex polygon. A great many papers are devoted to investigation of various random values associated to the finite samples from the uniform distribution in the polygon, such as the number of the vertices of the convex hull of the sample, its circumference, probability that th convex hull

The Wiener polynomial of a graph
The Wiener polynomial of a graph
✍ Bruce E. Sagan; Yeong-Nan Yeh; Ping Zhang πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 674 KB

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some

On the Zeroes of a Polynomial
On the Zeroes of a Polynomial
✍ H. Alzer πŸ“‚ Article πŸ“… 1995 πŸ› Elsevier Science 🌐 English βš– 70 KB