Computing characteristic polynomials of hyperplane arrangements with symmetries
From MaRDI portal
Abstract: We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its characteristic polynomial. We showcase our julia implementation, based on OSCAR, on examples coming from hyperplane arrangements with applications to physics and computer science.
Recommendations
- An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement
- An identity for the coefficients of characteristic polynomials of hyperplane arrangements
- Computing the Tutte polynomial of a hyperplane arragement
- Algorithms for computing characters for symmetric spaces
- On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points
- The Tutte polynomial of symmetric hyperplane arrangements
- A geometric interpretation of the characteristic polynomial of reflection arrangements
- Roots of the characteristic polynomials of hyperplane arrangements and their restrictions and localizations
- On characteristic polynomials of subspace arrangements
- On poincaré polynomials for hyperplane arrangements in positive characteristic
Cites work
- A formula for the characteristic polynomial of an arrangement
- A linear optimization oracle for zonotope computation
- Asymptotics of symmetry in matroids
- Characteristic polynomials of subspace arrangements and finite fields
- Combinatorics and topology of complements of hyperplanes
- Computing symmetry groups of polyhedra
- Counting chambers in restricted Coxeter arrangements
- Deformations of Coxeter hyperplane arrangements
- Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
- Freeness of hyperplane arrangements and related topics
- scientific article; zbMATH DE number 5777868 (Why is no real title available?)
- scientific article; zbMATH DE number 3953697 (Why is no real title available?)
- scientific article; zbMATH DE number 52944 (Why is no real title available?)
- scientific article; zbMATH DE number 1383707 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- scientific article; zbMATH DE number 6542830 (Why is no real title available?)
- Hyperplane arrangements and Lefschetz's hyperplane section theorem
- Hyperplane arrangements in \texttt{polymake}
- Julia: a fresh approach to numerical computing
- Log-concavity of characteristic polynomials and the Bergman fan of matroids
- Methods OI geometry and probabilistic combinatorics in threshold logic
- Minimal and canonical images
- Nemo/Hecke. Computer algebra and number theory packages for the Julia programming language
- On intersection lattices of hyperplane arrangements generated by generic points
- Parallel enumeration of triangulations
- Polyhedral representation conversion up to symmetries
- Polymake.jl: a new interface to \texttt{polymake}
- polymake: a framework for analyzing convex polytopes
- Polynomial threshold functions, hyperplane arrangements, and random tensors
- Projection volumes of hyperplane arrangements
- Ranking patterns of unfolding models of codimension one
- Root cones and the resonance arrangement
- Scattering equations: from projective spaces to tropical Grassmannians
- The Broken-Circuit Complex
- The universality of the resonance arrangement and its Betti numbers
- Traversing symmetric polyhedral fans
- When does a mixture of products contain a product of mixtures?
Cited in
(10)- On computation of the characteristic polynomials of the discriminantal arrangements and the arrangements generated by generic points
- An algorithm for the characteristic polynomial and supersolvability of a hyperplane arrangement
- Efficient algorithms for computing the Euler-Poincaré characteristic of symmetric semi-algebraic sets
- On arrangements of hyperplanes from connected subgraphs
- Lineup polytopes of products of simplices
- Mini-workshop: Alcoved polytopes in physics and optimization. Abstracts from the mini-workshop held March 2--7, 2025
- Computing arrangements of hypersurfaces
- Polyhedral combinatorics of bisectors
- On the B-differential of the componentwise minimum of two affine vector functions
- Squared linear models
This page was built for publication: Computing characteristic polynomials of hyperplane arrangements with symmetries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6142348)
