English
Related papers

Related papers: Non-Planar On-Shell Diagrams

200 papers

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Computational Complexity · Computer Science 2019-02-20 Manuel Arora , Gábor Ivanyos , Marek Karpinski , Nitin Saxena

Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…

Combinatorics · Mathematics 2011-10-05 Mike Develin , Jeremy L. Martin , Victor Reiner

We introduce some polynomial and analytic methods in the classification program for the complexity of planar graph homomorphisms. These methods allow us to handle infinitely many lattice conditions and isolate the new P-time tractable…

Computational Complexity · Computer Science 2024-12-24 Jin-Yi Cai , Ashwin Maran

It is shown that a large class of systems of non-linear wave equations, based on the good-bad-ugly model, admit formal solutions with polyhomogeneous expansions near null infinity. A particular set of variables is introduced which allows us…

General Relativity and Quantum Cosmology · Physics 2022-10-19 Miguel Duarte , Justin C. Feng , Edgar Gasperin , David Hilditch

We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…

Combinatorics · Mathematics 2022-03-09 Dylan Heuer , Jessica Striker

Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…

Combinatorics · Mathematics 2019-09-27 Norman Do , Jian He , Daniel V. Mathews

The standard parametrization of totally non-negative Grassmannians was obtained by A. Postnikov [45] introducing the boundary measurement map in terms of discrete path integration on planar bicolored (plabic) graphs in the disk. An…

Combinatorics · Mathematics 2022-03-29 Simonetta Abenda , Petr G. Grinevich

We present a common generalization of counting lattice points in rational polytopes and the enumeration of proper graph colorings, nowhere-zero flows on graphs, magic squares and graphs, antimagic squares and graphs, compositions of an…

Combinatorics · Mathematics 2010-01-24 Matthias Beck , Thomas Zaslavsky

We develop a new method for studying the asymptotics of symmetric polynomials of representation-theoretic origin as the number of variables tends to infinity. Several applications of our method are presented: We prove a number of theorems…

Representation Theory · Mathematics 2015-12-22 Vadim Gorin , Greta Panova

In the Grassmannian formulation of the S-matrix for planar $\mathcal{N}=4$ Super Yang-Mills, $N^{k-2}MHV$ scattering amplitudes for $k$ negative and $n-k$ positive helicity gluons can be expressed, by an application of the global residue…

High Energy Physics - Theory · Physics 2023-07-20 Freddy Cachazo , Nick Early

We obtain several results for (iterated) planar contact manifolds in higher dimensions: (1) Iterated planar contact manifolds are not weakly symplectically semi-fillable. This generalizes a 3-dimensional result of Etnyre to a…

Symplectic Geometry · Mathematics 2021-01-29 Bahar Acu , Agustin Moreno

Positive geometries encode the physics of scattering amplitudes in flat space-time and the wavefunction of the universe in cosmology for a large class of models. Their unique canonical forms, providing such quantum mechanical observables,…

High Energy Physics - Theory · Physics 2020-08-26 Paolo Benincasa , Matteo Parisi

We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…

Combinatorics · Mathematics 2025-08-03 Houshan Fu

In a joint work with Palmer we have formulated sufficient conditions under which there exist continuous and invertible transformations of the form $H_n(x,y)$ taking solutions of a coupled system \begin{equation*} x_{n+1} =A_nx_n+f_n(x_n,…

Dynamical Systems · Mathematics 2023-02-27 Lucas Backes , Davor Dragičević

We give new characterizations for the class of uniformly dense matroids and study applications of these characterizations to graphic and real representable matroids. We show that a matroid is uniformly dense if and only if its base polytope…

Combinatorics · Mathematics 2026-02-03 Karel Devriendt , Raffaella Mulas

In this thesis, we investigate various integral submodels and generalize them. In part I, we study the submodel of the nonlinear $\mathbf{C}P^1$-model and the related submodels in $(1+2)$ dimensions. In part II, we construct integrable…

High Energy Physics - Theory · Physics 2007-05-23 Tatsuo Suzuki

Nonlinear sigma models (NLSM) in d=3 have many interesting and non-trivial features, which were explored poorly in contrast with NLSM in d=2 and d=4. We present a few results from our study of the perturbative and non-perturbative…

High Energy Physics - Theory · Physics 2007-05-23 Ko Furuta , Takeo Inami , Masayoshi Yamamoto

We study non-parametric regression estimates for random fields. The data satisfies certain strong mixing conditions and is defined on the regular $N$-dimensional lattice structure. We show consistency and obtain rates of convergence. The…

Statistics Theory · Mathematics 2018-07-06 Johannes T. N. Krebs

We study massive one-loop integrals by analytically continuing the Feynman integral to negative dimensions as advocated by Halliday and Ricotta and developed by Suzuki and Schmidt. We consider n-point one-loop integrals with arbitrary…

High Energy Physics - Phenomenology · Physics 2008-11-26 C. Anastasiou , E. W. N. Glover , C. Oleari

The Ptolemy groupoid is a combinatorial groupoid generated by elementary moves on marked trivalent fatgraphs with three types of relations. Through the fatgraph decomposition of Teichm\"uller space, the Ptolemy groupoid is a mapping class…

Geometric Topology · Mathematics 2008-02-21 Alex James Bene