Search arXivSearch

arXiv · 2411.07293

The Chirotropical Grassmannian

Abstract

Recent developments in particle physics have revealed deep connections between scattering amplitudes and tropical geometry. From the heart of this relationship emerged the chirotropical Grassmannian $\text{Trop}^χ\text{G}(k,n)$ and the chirotropical Dressian $\text{Dr}^χ(k,n)$, polyhedral fans built from uniform realizable chirotopes that encode the combinatorial structure of Generalized Feynman Diagrams. We prove that $\text{Trop}^χ\text{G}(3,n) = \text{Dr}^χ(3,n)$ for $n = 6,7,8$, and develop algorithms to compute these objects from their rays modulo lineality. Using these algorithms, we compute all chirotropical Grassmannians $\text{Trop}^χ\text{G}(3,n)$ for $n = 6,7,8$ across all isomorphism classes of chirotopes. We prove that each chirotopal configuration space $X^χ(3,6)$ is diffeomorphic to a polytope and propose an associated canonical logarithmic differential form. Finally, we show that the equality between chirotropical Grassmannian and Dressian fails for $(k,n) = (4,8)$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Dario Antolini, Nick Early. 2024-12-14. The Chirotropical Grassmannian. https://doi.org/10.4418/2025.80.1.4

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO