Ranking patterns of unfolding models of codimension one
From MaRDI portal
Publication:550269
DOI10.1016/j.aam.2010.11.002zbMath1218.52022arXiv1003.0040OpenAlexW1991964142MaRDI QIDQ550269
Hiroaki Terao, Hidehiko Kamiya, Akimichi Takemura
Publication date: 8 July 2011
Published in: Advances in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1003.0040
characteristic polynomialhyperplane arrangementchamberideal pointfinite field methodbraid arrangementall-subset arrangementmid-hyperplane arrangementranking patternunfolding model
Relations with arrangements of hyperplanes (32S22) Arrangements of points, flats, hyperplanes (aspects of discrete geometry) (52C35)
Related Items
Isoresidual fibration and resonance arrangements ⋮ Boolean product polynomials and Schur-positivity ⋮ Hopf monoids, permutohedral cones, and generalized retarded functions ⋮ The universality of the resonance arrangement and its Betti numbers ⋮ Computing characteristic polynomials of hyperplane arrangements with symmetries ⋮ The adjoint braid arrangement as a combinatorial Lie algebra via the Steinmann relations ⋮ Root cones and the resonance arrangement ⋮ The vertices of primitive zonotopes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Periodicity of non-central integral arrangements modulo positive integers
- Ordering events in Minkowski space
- Periodicity of hyperplane arrangements with integral coefficients modulo positive integers
- Stirling numbers and a geometric structure from voting theory
- On rankings generated by pairwise linear discriminant analysis of \(m\) populations
- Perpendicular dissections of space
- Characterization of rankings generated by linear discriminant analysis
- Arrangements and ranking patterns
- Characteristic polynomials of subspace arrangements and finite fields
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- The Characteristic Quasi-Polynomials of the Arrangements of Root Systems and Mid-Hyperplane Arrangements
- A combinatorial problem