English
Related papers

Related papers: Termination of Triangular Polynomial Loops

200 papers

We compute correlation functions of protected primaries on the $1/2$-BPS Wilson loop in ${\cal N}$ = 4 super Yang-Mills theory at weak coupling. We first perform direct perturbative computation at one loop in the planar limit and present…

High Energy Physics - Theory · Physics 2019-03-27 Naoki Kiryu , Shota Komatsu

In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…

Logic in Computer Science · Computer Science 2025-09-12 Matteo Acclavio , Gianluca Curzi , Giulio Guerrieri

Tabled logic programming is receiving increasing attention in the Logic Programming community. It avoids many of the shortcomings of SLD execution and provides a more flexible and often extremely efficient execution mechanism for logic…

Logic in Computer Science · Computer Science 2007-05-23 Sofie Verbaeten , Danny De Schreye , Konstantinos Sagonas

Any stretching of Ringel's non-Pappus pseudoline arrangement when projected into the Euclidean plane, implicitly contains a particular arrangement of nine triangles. This arrangement has a complex constraint involving the sines of its…

Combinatorics · Mathematics 2007-05-23 Jeremy J. Carroll

Many satisfiability modulo theories solvers implement a variant of the DPLL(T ) framework which separates theory-specific reasoning from reasoning on the propositional abstraction of the formula. Such solvers conclude that a formula is…

Logic in Computer Science · Computer Science 2015-06-05 Liana Hadarean , Alex Horn , Tim King

The Sylow theorems hold for finite extra loops, as does P. Hall's theorem for finite solvable extra loops. Every finite nonassociative extra loop $Q$ has a nontrivial center, $Z(Q)$. Furthermore, $Q/Z(Q)$ is a group whenever $|Q| < 512$.…

Group Theory · Mathematics 2007-05-23 Michael K. Kinyon , Kenneth Kunen

We construct a lower bound of the tensor rank for a new class of tensors, which we call persistent tensors. We present three specific families of persistent tensors, of which the lower bound is tight. We show that there is a chain of…

Quantum Physics · Physics 2024-02-07 Masoud Gharahi , Vladimir Lysikov

This paper establishes the existence of infinitely many solutions for nonlinear problems without any symmetry, achieving three major advances. First, in the setting of semilinear elliptic PDEs, we introduce a refined variational truncation…

Analysis of PDEs · Mathematics 2026-05-04 Anouar Bahrouni

We study the computational complexity of fundamental problems over the $p$-adic numbers ${\mathbb Q}_p$ and the $p$-adic integers ${\mathbb Z}_p$. Gu\'epin, Haase, and Worrell proved that checking satisfiability of systems of linear…

Computational Complexity · Computer Science 2025-04-21 Arno Fehm , Manuel Bodirsky

In the first part of this work a summary is provided of some recent experiments and theoretical results which are relevant in the research of systems of polymer rings in nontrivial topological conformations. Next, some advances in modeling…

Soft Condensed Matter · Physics 2014-02-04 Yani Zhao , Franco Ferrari

We give bounds for the number and the size of the primes $p$ such that a reduction modulo $p$ of a system of multivariate polynomials over the integers with a finite number $T$ of complex zeros, does not have exactly $T$ zeros over the…

Number Theory · Mathematics 2017-04-28 Carlos D'Andrea , Alina Ostafe , Igor E. Shparlinski , Martin Sombra

In this paper we develop further and refine the method of differential equations for computing Feynman integrals. In particular, we show that an additional iterative structure emerges for finite loop integrals. As a concrete non-trivial…

High Energy Physics - Theory · Physics 2015-06-19 Simon Caron-Huot , Johannes M. Henn

Given $n$ non-vertical lines in 3-space, their vertical depth (above/below) relation can contain cycles. We show that the lines can be cut into $O(n^{3/2}\mathop{\mathrm{polylog}} n)$ pieces, such that the depth relation among these pieces…

Computational Geometry · Computer Science 2016-06-09 Boris Aronov , Micha Sharir

In this paper we give an elementary proof of the Fundamental Theorem of Algebra for polynomials over the rational tropical semi-ring. We prove that, tropically, the rational numbers are algebraically closed. We provide a simple algorithm…

Combinatorics · Mathematics 2007-07-18 Nathan Grigg , Nathan Manwaring

We investigate the problem of defining group or loop structures on spheres, where by ''sphere'' we mean the level set q(x) = c of a general K-valued quadratic form q, for an invertible scalar c. When K is a field and q non-degenerate, then…

Group Theory · Mathematics 2024-10-24 Wolfgang Bertram

In this work, we systematically analyse Feynman integrals in the `t Hooft-Veltman scheme. We write an explicit reduction resulting from partial fractioning the high-multiplicity integrands to a finite basis of topologies at any given loop…

High Energy Physics - Phenomenology · Physics 2024-11-28 Piotr Bargiela , Tong-Zhi Yang

Proving super-polynomial size lower bounds for $\textsf{TC}^0$, the class of constant-depth, polynomial-size circuits of Majority gates, is a notorious open problem in complexity theory. A major frontier is to prove that $\textsf{NEXP}$…

Computational Complexity · Computer Science 2018-05-29 Lijie Chen

Let $R$ be a polynomial ring in $m$ variables over a field of characteristic zero. We classify all rank $n$ twisted generalized Weyl algebras over $R$, up to $\mathbb{Z}^n$-graded isomorphisms, in terms of higher spin 6-vertex…

Rings and Algebras · Mathematics 2020-06-09 Jonas T. Hartwig , Daniele Rosso

We develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

Representation Theory · Mathematics 2021-07-15 Harm Derksen , Visu Makam

The Circle Pattern Theorem characterizes the existence and rigidity of circle patterns with prescribed intersection angles on simplicial triangulations of closed surfaces. In this paper we extend the theorem to quasi-simplicial…

Geometric Topology · Mathematics 2026-05-05 Aijin Lin , Qingyi Liu