The counting polynomial of a supersolvable arrangement

DOI10.1006/AIMA.1995.1070zbMath0851.52015OpenAlexW2038362761MaRDI QIDQ1910400

Luis Paris

Publication date: 28 November 1996

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/aima.1995.1070

zbMATH Keywords

supersolvable arrangementscounting polynomial

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)

Related Items (3)

Factored arrangements of hyperplanes ⋮ Combinatorics of inductively factored arrangements ⋮ Counting chambers in restricted Coxeter arrangements

This page was built for publication: The counting polynomial of a supersolvable arrangement