Root Cones and the Resonance Arrangement
| Autor: | Karola Mészáros, T. Kyle Petersen, Samuel C. Gutekunst |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Logarithm
Physics::Instrumentation and Detectors Applied Mathematics Structure (category theory) Polytope 0102 computer and information sciences 01 natural sciences Resonance (particle physics) Theoretical Computer Science Connection (mathematics) Combinatorics Computational Theory and Mathematics Hyperplane 010201 computation theory & mathematics FOS: Mathematics Mathematics - Combinatorics Discrete Mathematics and Combinatorics Combinatorics (math.CO) Geometry and Topology Kostant partition function Sign (mathematics) Mathematics |
| Zdroj: | The Electronic Journal of Combinatorics. 28 |
| ISSN: | 1077-8926 |
| DOI: | 10.37236/8759 |
| Popis: | We study the connection between triangulations of a type $A$ root polytope and the resonance arrangement, a hyperplane arrangement that shows up in a surprising number of contexts. Despite an elementary definition for the resonance arrangement, the number of resonance chambers has only been computed up to the $n=8$ dimensional case. We focus on data structures for labeling chambers, such as sign vectors and sets of alternating trees, with an aim at better understanding the structure of the resonance arrangement, and, in particular, enumerating its chambers. Along the way, we make connections with similar (and similarly difficult) enumeration questions. With the root polytope viewpoint, we relate resonance chambers to the chambers of polynomiality of the Kostant partition function. With the hyperplane viewpoint, we clarify the connections between resonance chambers and threshold functions. In particular, we show that the base-2 logarithm of the number of resonance chambers is asymptotically $n^2$. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|