Related papers: Truncation in Hahn Fields is Undecidable and Wild

We investigate the perturbative renormalisation of deformed conformal field theories from the Hamiltonian perspective. We discuss the relation with conformal perturbation theory, to which we provide an explicit match up to third order in…

A mathematically rigorous Hamiltonian formulation for classical and quantum field theories is given. New results include clarifications of the structure of linear fields, and a plausible formulation for nonlinear fields. Many mathematical…

The natural join and the inner union operations combine relations of a database. Tropashko and Spight [24] realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices.…

The Fock-space Hamiltonian truncation method is developed further, paying particular attention to the treatment of the scalar field zero mode. This is applied to the two-dimensional Phi^4 theory in the phase where the Z_2-symmetry is…

We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…

In this article we outline the methods that are used to prove undecidability of Hilbert's Tenth Problem for function fields of characteristic zero. Following Denef we show how rank one elliptic curves can be used to prove undecidability for…

We describe some families of differentiable vector fields with the Hopf bifurcation at infinity, without assuming the continuous differentiability. These vector fields have isolated singular points on the plane, and the initial families are…

We compare the expressiveness of two extensions of monadic second-order logic (MSO) over the class of finite structures. The first, counting monadic second-order logic (CMSO), extends MSO with first-order modulo-counting quantifiers,…

Is there a fixed dimension $n$ such that translational tiling of $\mathbb{Z}^n$ with a monotile is undecidable? Several recent results support a positive answer to this question. Greenfeld and Tao disprove the periodic tiling conjecture by…

We show the diagonal problem for higher-order pushdown automata (HOPDA), and hence the simultaneous unboundedness problem, is decidable. From recent work by Zetzsche this means that we can construct the downward closure of the set of words…

For p = 3 and p = 5, we exhibit a finite nonsolvable extension of the rational numbers which is ramified only at p via explicit computations with Hilbert modular forms.

We show that the tropicalization of a connected variety over a higher rank valued field is a path connected topological space. This establishes an affirmative answer to a question posed by Banerjee. Higher rank tropical varieties are…

We continue our analysis of establishing the reliability of "simple" effective theories where massive fields are "frozen" rather than integrated out, in a wide class of four dimensional theories with global or local N=1 supersymmetry. We…

Ordinary binary multiplication of natural numbers can be generalized in a non-trivial way to a ternary operation by considering discrete volumes of lattice hexagons. With this operation, a natural notion of `3-primality' -- primality with…

Building on work of J. Robinson and A. Shlapentokh, we develop a general framework to obtain definability and decidability results of large classes of infinite algebraic extensions of $\mathbb{F}_p(t)$. As an application, we show that for…

The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…

We consider a first-order logic for the integers with addition. This logic extends classical first-order logic by modulo-counting, threshold-counting and exact-counting quantifiers, all applied to tuples of variables (here, residues are…

We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical…

We prove that the existential theory of any function field $K$ of characteristic $p> 0$ is undecidable in the language of rings provided that the constant field does not contain the algebraic closure of a finite field. We also extend the…