Free hyperplane arrangements between \(A_{n-1}\) and \(B_ n\)

DOI10.1007/BF02571719zbMath0793.05122OpenAlexW2792049568MaRDI QIDQ1323406

Victor Reiner, Paul H. Edelman

Publication date: 10 August 1994

Published in: Mathematische Zeitschrift (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/174617

zbMATH Keywords

root systemsigned graphsfree arrangementsthreshold graphsOrlik's conjecturegraphic arrangementsinduction tablessub-arrangements

Mathematics Subject Classification ID

Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35) Graph theory (05C99)

Related Items

Split graphs, Signed graphs and the freeness of the Weyl subarrangements of type \(B_\ell\), Hypertetrahedral arrangements, Lower central series and free resolutions of hyperplane arrangements, Free multiplicities on the moduli of \(X_{3}\), Free arrangements and rhombic tilings, Combinatorics \(\&\) topology of stratifications of the space of monic polynomials with real coefficients, On valuations, the characteristic polynomial, and complex subspace arrangements, Rationally smooth Schubert varieties and inversion hyperplane arrangements, Freeness for restriction arrangements of the extended Shi and Catalan arrangements, MAT-free graphic arrangements and a characterization of strongly chordal graphs by edge-labeling, A homological characterization for freeness of multi-arrangements, Modular construction of free hyperplane arrangements, Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs, Vertex-weighted graphs and freeness of $ \psi $-graphical arrangements, Basic derivations for subarrangements of Coxeter arrangements, A characterization of signed graphs with generalized perfect elimination orderings, Accurate arrangements, Parallel connections and bundles of arrangements, Why the characteristic polynomial factors, A pattern avoidance criterion for free inversion arrangements, Exponents for 𝐵-stable ideals, Freeness of hyperplane arrangements between Boolean arrangements and Weyl arrangements of type \(B_{\ell}\), Supersolvable frame-matroid and graphic-lift lattices, Coxeter multiarrangements with quasi-constant multiplicities, Supersolvability and freeness for \(\psi\)-graphical arrangements, Free subarrangements of Shi arrangements, Arrangements of ideal type, Hyperplane arrangements and linear strands in resolutions

Cites Work

• Unnamed Item
• Unnamed Item
• Basic derivations for subarrangements of Coxeter arrangements
• On rigid circuit graphs
• Modular elements of lattices and topological fibration
• Incidence matrices and interval graphs
• Supersolvable lattices
• Matroid Representations and free Arrangements
• The Geometry of Root Systems and Signed Graphs
• Threshold Sequences
• A Counterexample to Orlik's Conjecture
• A combinatorial problem