Search arXivSearch

arXiv · 1608.08288

The m=1 amplituhedron and cyclic hyperplane arrangements

Abstract

The (tree) amplituhedron A(n,k,m) is the image in the Grassmannian Gr(k,k+m) of the totally nonnegative part of Gr(k,n), under a (map induced by a) linear map which is totally positive. It was introduced by Arkani-Hamed and Trnka in 2013 in order to give a geometric basis for the computation of scattering amplitudes in N=4 supersymmetric Yang-Mills theory. When k+m=n, the amplituhedron is isomorphic to the totally nonnegative Grassmannian, and when k=1, the amplituhedron is a cyclic polytope. While the case m=4 is most relevant to physics, the amplituhedron is an interesting mathematical object for any m. In this paper we study it in the case m=1. We start by taking an orthogonal point of view and define a related "B-amplituhedron" B(n,k,m), which we show is isomorphic to A(n,k,m). We use this reformulation to describe the amplituhedron in terms of sign variation. We then give a cell decomposition of the amplituhedron A(n,k,1) using the images of a collection of distinguished cells of the totally nonnegative Grassmannian. We also show that A(n,k,1) can be identified with the complex of bounded faces of a cyclic hyperplane arrangement, and describe how its cells fit together. We deduce that A(n,k,1) is homeomorphic to a ball.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Steven N. Karp, Lauren K. Williams. 2019-04-10. The m=1 amplituhedron and cyclic hyperplane arrangements. https://doi.org/10.1093/imrn%2Frnx140

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

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO