Valuations on polyhedra and topological arrangements
Askold Khovanskii, Valentina Kiritchenko, Vladlen Timorin

TL;DR
This paper explores a generalized framework for valuations on convex polyhedra, linking scissors congruence problems with hyperplane arrangements and extending to topological arrangements with non-straight hyperplanes.
Contribution
It introduces a broad setting for valuations on polyhedra based on hyperplane collections without algebraic restrictions, revealing new connections with hyperplane arrangements and topological generalizations.
Findings
Established a relationship between valuations and hyperplane arrangements.
Extended the theory to topological arrangements with nontrivial topology.
Connected properties of Varchenko--Gelfand algebras to polytope rings.
Abstract
We revisit a classical theme of (general or translation invariant) valuations on convex polyhedra. Our setting generalizes the classical one, in a ``dual'' direction to previously considered generalizations: while previous research was mostly concerned with variations of ground fields/rings, over which the vertices of polytopes are defined, we consider more general collections of defining hyperplanes. No algebraic structures are imposed on these collections. This setting allows us to uncover a close relationship between scissors congruence problems on the one hand and finite hyperplane arrangements on the other hand: there are many parallel results in these fields, for which the parallelism seems to have gone unnoticed. In particular, certain properties of the Varchenko--Gelfand algebras for arrangements translate to properties of polytope rings or valuations. Studying these properties…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Combinatorial Mathematics · Polynomial and algebraic computation · graph theory and CDMA systems
