Polygraph arrangements

DOI10.1006/eujc.2002.0613zbMath1018.52009OpenAlexW4210363866MaRDI QIDQ1864607

Axel Hultman

Publication date: 18 March 2003

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/300f1506e3ba02fa522355af35abd4262fd8d065

zbMATH Keywords

cohomology groupsshellabilitysubspace arrangementsDowling generalizationspolygraph arrangements

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Shellability for polytopes and polyhedra (52B22)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Homotopy types of subspace arrangements via diagrams of spaces
• A class of geometric lattices based on finite groups
• Hilbert schemes, polygraphs and the Macdonald positivity conjecture
• Shellable and Cohen-Macaulay Partially Ordered Sets
• Shellable Nonpure Complexes and Posets. I
• A graded representation model for Macdonald's polynomials.
• A new class of symmetric functions

This page was built for publication: Polygraph arrangements