English
Related papers

Related papers: Three-term Machin-type formulae

200 papers

In this paper, we study the representations of integral quadratic polynomials. Particularly, it is shown that there are only finitely many equivalence classes of positive ternary universal integral quadratic polynomials, and that there are…

Number Theory · Mathematics 2012-08-31 Wai Kiu Chan , Byeong-Kweon Oh

We prove that, for fixed n there exist only finitely many embeddings of Q-factorial toric varieties X into P^n that are induced by a complete linear system. The proof is based on a combinatorial result that for fixed nonnegative integers d…

We show that there are at most finitely many one cusped orientable hyperbolic 3-manifolds which have more than eight non-hyperbolic Dehn fillings. Moreover, we show that determining these finitely many manifolds is decidable.

Geometric Topology · Mathematics 2014-11-11 Ian Agol

Let $\mathbf{A}$ be a finite algebra generating a finitely decidable variety and having nontrivial strongly solvable radical $\tau$. We provide an improved bound on the number of variables in which a term can be sensitive to changes within…

Logic · Mathematics 2013-11-13 Matthew Smedberg

We give sufficient conditions for the existence and uniqueness, in bounded uniformly convex domains $\Omega$, of solutions of degenerate elliptic equations depending also on the nonlinear gradient term $H$, in term of the size of $\Omega$,…

Analysis of PDEs · Mathematics 2020-04-16 I. Birindelli , G. Galise , A. Rodríguez

We establish representation types (finite, tame or wild) of finite dimensional Munn algebras with semisimple bases. As an application, we establish representation types of finite 0-simple semigroups and their mutually annihilating unions.

Representation Theory · Mathematics 2022-08-22 Yuriy A. Drozd , Andriana I. Plakosh

We show that one can construct positively defined matrix of elastic constants representing medium of trigonal symmetry for which exactly 16 distinct degenerate directions exist.

Other Condensed Matter · Physics 2007-05-23 Artur Duda

It is well known, and easy to see, that not each nondeterministic Buchi automaton on infinite words can be simulated by a nondeterministic co-Buchi automaton. We show that in the cases when such a simulation is possible, the number of…

Formal Languages and Automata Theory · Computer Science 2009-06-07 Jerzy Marcinkowski , Jakub Michaliszyn

Single-tape nondeterministic Turing machines that are allowed to replace the symbol in each tape cell only when it is scanned for the first time are also known as 1-limited automata. These devices characterize, exactly as finite automata,…

Formal Languages and Automata Theory · Computer Science 2023-09-07 Giovanni Pighizzini , Luca Prigioniero

The main result is a short effective proof of Tao Li's theorem that a closed non Haken hyperbolic 3-manifold N has at most finitely many irreducible Heegaard splittings.

Geometric Topology · Mathematics 2018-11-14 Tobias Holck Colding , David Gabai

The least upper bound on degrees of elements of a minimal system of generators of the algebra of invariants of 3x3 matrices is found, and the nilpotency degree of a relatively free finitely generated algebra with the identity x^3=0 is…

Rings and Algebras · Mathematics 2007-05-23 A. A. Lopatin

We consider the problem of enumerating hypermatrices of format $2 \times (k + 1) \times k$ over a finite field that have nonzero hyperdeterminant and whose nonzero entries are restricted to a plane partition. We conjecture an attractive…

Combinatorics · Mathematics 2026-02-26 Brandon Koprowski , Joel Brewster Lewis

We prove that for any distinct $x,y \in \{0,1\}^n$, there is a deterministic finite automaton with $\widetilde{O}(n^{1/3})$ states that accepts $x$ but not $y$. This improves Robson's 1989 upper bound of $\widetilde{O}(n^{2/5})$.

Combinatorics · Mathematics 2022-01-12 Zachary Chase

It is proved that all recursively enumerable sets of natural numbers can be represented by arithmetic formulas (of two kinds) with only 3 quantifiers.

Logic · Mathematics 2008-02-08 Yuri Matiyasevich , Julia Robinson

In three dimensions, there are two distinct mass-generating mechanisms for gauge fields: adding the usual Proca/Pauli-Fierz, or the more esoteric Chern-Simons (CS), terms. Here we analyze the three-term models where both types are present,…

High Energy Physics - Theory · Physics 2009-11-07 S. Deser , Bayram Tekin

Under mild non-degeneracy assumptions on branching rates in each generation, we provide a criterion for almost-sure extinction of a multi-type branching process with time-dependent branching rates. We also provide a criterion for the total…

Probability · Mathematics 2018-11-22 Dmitry Dolgopyat , Pratima Hebbar , Leonid Koralov , Mark Perlman

We determine all the terms that are gauge-invariant up to a total spacetime derivative ("semi-invariant terms") for gauged non-linear sigma models. Assuming that the isotropy subgroup $H$ of the gauge group is compact or semi-simple, we…

High Energy Physics - Theory · Physics 2009-10-31 M. Henneaux , A. Wilch

We prove that, paying a polynomial increase in size only, every unrestricted two-way nondeterministic finite automaton (2NFA) can be complemented by a 1-limited automaton (1-LA), a nondeterministic extension of 2NFAs still characterizing…

Formal Languages and Automata Theory · Computer Science 2025-07-16 Bruno Guillon , Luca Prigioniero , Javad Taheri

The finite dimensional representations of associative quadratic algebras with three generators are investigated by using a technique based on the deformed parafermionic oscillator algebra. One application on the calculation of the…

Mathematical Physics · Physics 2007-05-23 C. Daskaloyannis

We prove that there are 3-CNF formulas over n variables that can be refuted in resolution in width w but require resolution proofs of size n^Omega(w). This shows that the simple counting argument that any formula refutable in width w must…

Computational Complexity · Computer Science 2014-09-10 Albert Atserias , Massimo Lauria , Jakob Nordström