English
Related papers

Related papers: A counterexample to a conjecture on simultaneous W…

200 papers

We employ tools from the fields of symbolic computation and satisfiability checking---namely, computer algebra systems and SAT solvers---to study the Williamson conjecture from combinatorial design theory and increase the bounds to which…

Logic in Computer Science · Computer Science 2019-07-31 Curtis Bright , Ilias Kotsireas , Vijay Ganesh

We show that many of Ramanujan's modular equations of degree 3 can be interpreted in terms of integral ternary quadratic forms. This way we establish that for any n in N |{n= x(x+1)/2 + y^2 +z^2 : x,y,z in Z}| >= |{n= x(x+1)/2 + 3y^2 +3z^2:…

Number Theory · Mathematics 2009-06-20 Alexander Berkovich , William Jagy

We introduce a new construction of bilinear invariant forms on Lie algebras, based on the method of graded contractions. The general method is described and the $\Bbb Z_2$-, $\Bbb Z_3$-, and $\Bbb Z_2\otimes\Bbb Z_2$-contractions are found.…

High Energy Physics - Theory · Physics 2009-10-28 Marc de Montigny

This work is a modern revisitation of a classical paper by Alessandro Terracini, going back to 1915, which suggests an elementary but powerful method for studing Grassmann defective varieties. In particular, the case of Veronese surfaces is…

Algebraic Geometry · Mathematics 2007-05-23 Carla Dionisi , Claudio Fontanari

In this article, we continue the investigation of hep-th 1611.02179 regarding iterative properties of dual conformal integrals in higher dimensions. In d=4, iterative properties of four and five point dual conformal integrals manifest…

High Energy Physics - Theory · Physics 2020-07-15 L. V. Bork , R. M. Iakhibbaev , D. I. Kazakov , D. M. Tolkachev

We show that equivalence of deterministic top-down tree-to-string transducers is decidable, thus solving a long standing open problem in formal language theory. We also present efficient algorithms for subclasses: polynomial time for total…

Formal Languages and Automata Theory · Computer Science 2017-01-30 Helmut Seidl , Sebastian Maneth , Gregor Kemper

We evaluate in closed form several alternating infinite series involving the binomial coefficients $C(4n,2n)$ and $C(4n+2,2n+1)$ in the denominator. One of our results generalizes an identity that was obtained experimentally by Sprugnoli in…

Number Theory · Mathematics 2024-04-10 Kunle Adegoke , Robert Frontczak , Taras Goy

We study modular forms of some congruence subgroups. In this paper, we treat the cases level is 2-power, 3-power or 5. Structures of graded rings and many identities of infinite sum or infinite product are given. Theory of rational (1/3,…

Number Theory · Mathematics 2020-09-01 Suda Tomohiko

We show that if a homogeneous polynomial $f$ in $n$ variables has Waring rank $n+1$, then the corresponding projective hypersurface $f=0$ has at most isolated singularities, and the type of these singularities is completely determined by…

Algebraic Geometry · Mathematics 2020-04-21 Alexandru Dimca , Gabriel Sticlaru

We characterise the sensitivity of several additive tensor decompositions with respect to perturbations of the original tensor. These decompositions include canonical polyadic decompositions, block term decompositions, and sums of tree…

Numerical Analysis · Mathematics 2024-07-02 Nick Dewaele , Paul Breiding , Nick Vannieuwenhoven

We investigate the correspondence between the time and space recognition complexity of languages. For this purpose, we will code the long-continued computations of deterministic two-tape Turing machines by the relatively short-length…

Computational Complexity · Computer Science 2024-12-24 Ivan V. Latkin

In this paper, we first give a simple combinatorial proof of Tepper's identity. Then, as a by product of this interesting identity we present another proof of the well-known Wilson's identity in number theory. Finally, we obtain a…

History and Overview · Mathematics 2022-05-10 Mortaza Bayat , Hossein Teimoori Faal

The following two decision problems capture the complexity of comparing integers or rationals that are succinctly represented in product-of-exponentials notation, or equivalently, via arithmetic circuits using only multiplication and…

Computational Complexity · Computer Science 2014-04-08 Kousha Etessami , Alistair Stewart , Mihalis Yannakakis

Recent road marking recognition has achieved great success in the past few years along with the rapid development of deep learning. Although considerable advances have been made, they are often over-dependent on unrepresentative datasets…

Computer Vision and Pattern Recognition · Computer Science 2019-10-11 Younkwan Lee , Juhyun Lee , Yoojin Hong , YeongMin Ko , Moongu Jeon

We prove that all polynomials in several variables can be decomposed as the sums of $k$th powers: $P(x_1,...,x_n) = Q_1(x_1,...,x_n)^k+...+ Q_s(x_1,...,x_n)^k$, provided that elements of the base field are themselves sums of $k$th powers.…

Number Theory · Mathematics 2011-10-20 Arnaud Bodin , Mireille Car

We introduce the $k$-variable-occurrence fragment, which is the set of terms having at most $k$ occurrences of variables. We give a sufficient condition for the decidability of the equational theory of the $k$-variable-occurrence fragment…

Logic in Computer Science · Computer Science 2025-06-03 Yoshiki Nakamura

We consider $5d$ KK dualities, that is multiple $5d$ gauge theories with the same $6d$ infinite coupling limit. We provide a prescription to associate $4d$ $N=1$ quivers to the $5d$ dual quivers, such that the $4d$ quivers are also dual to…

High Energy Physics - Theory · Physics 2024-02-22 Stephane Bajeot , Sergio Benvenuti

We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…

Algebraic Geometry · Mathematics 2018-09-27 Drew Lewis , Kaitlyn Perry , Armin Straub

Given an integer g, g > 1, an integer w, -1 < w <g - 1, and a set of g distinct numbers, c_1, ..., c_g, we present a conjectured identity for Stirling numbers of the first kind. We have proven all the equalities in case g < 7; and for the…

Combinatorics · Mathematics 2018-08-29 Paul Federbush

In a previous paper, the authors proved that in any system of three linear forms satisfying obvious necessary local conditions, there are at least two forms that infinitely often assume $E_2$-values; i.e., values that are products of…

Number Theory · Mathematics 2008-03-19 D. A. Goldston , S. W. Graham , J. Pintz , C. Y. Yildirim