Related papers: Considering The Satisfiability of Cubic Diophantin…
We derive lower und upper bounds for the degree of regularity of an overdetermined, zero-dimensional and homogeneous quadratic semi-regular system of polynomial equations. The analysis is based on the interpretation of the associated…
We consider three classification systems for distributed decision tasks: With unbounded computation and certificates, defined by Balliu, D'Angelo, Fraigniaud, and Olivetti [JCSS'18], and with (two flavors of) polynomially bounded local…
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…
We derive finite-dimensional quantum mechanics from a single ontological principle, that \emph{existence is constituted by distinguishability}, together with two structural commitments: finite capacity $N$ (parametric input) and…
Determining the validity of a quantified Boolean formula (QBF) is a PSPACE-complete problem with rich expressive power. Despite interest in efficient solvers, there is, compared to problems in NP, a lack of positive theoretical results, and…
For $\theta$ a non-algebraic point on a quasi projective variety over a number field, I prove that $\theta$ has an approximation by a series of algebraic points of bounded height and degree which is essentially best possible. Applications…
We develop a theory of $p$-adic continued fractions for a quaternion algebra $B$ over $\mathbb Q$ ramified at a rational prime $p$. Many properties holding in the commutative case can be proven also in this setting. In particular, we focus…
There is a theory of continued fractions for Laurent series in x^{-1} with coefficients in a field F. This theory bears a close analogy with classical continued fractions for real numbers with Laurent series playing the role of real numbers…
We use a variety of computational tools to obtain a degree-$\binom{m + n - 2}{m - 1}$ polynomial equation conjecturally satisfied by the top-left entry of the Sinkhorn limit of a positive $m \times n$ matrix. The degree of this equation has…
A polynomial f(x) has emergent reducibility at depth n if f^{\circ k}(x) is irreducible for 0\leq k\leq n-1 but f^{\circ n}(x) is reducible. In this paper we prove that there are infinitely many irreducible cubics f \in \mathbb{Z}[x] with…
Arithmetic of K3 surfaces defined over finite fields is investigated. In particular, we show that any K3 surface of finite height over a finite field k of characteristic p > 3 has a quasi-canonical lifting to characteristic 0, and that for…
We show NP-completeness for several planar variants of the monotone satisfiability problem with bounded variable appearances. With one exception the presented variants have an associated bipartite graph where the vertex degree is bounded by…
We extend the classification of mixed states of quantum systems composed of arbitrary number of subsystems of arbitrary dimensions. This extended classification is complete in the sense of partial separability and gives 1+18+1 partial…
We construct combinatorial volume forms of hyperbolic three manifolds fibering over the circle. These forms define non-trivial classes in bounded cohomology. After introducing a new seminorm on exact bounded cohomology, we use these…
A code $C \colon \{0,1\}^k \to \{0,1\}^n$ is a $q$-locally decodable code ($q$-LDC) if one can recover any chosen bit $b_i$ of the message $b \in \{0,1\}^k$ with good confidence by randomly querying the encoding $x := C(b)$ on at most $q$…
A thorough analysis is made of the Fourier coefficients for vector-valued modular forms associated to three-dimensional irreducible representations of the modular group. In particular, the following statement is verified for all but a…
We investigate the classical and distributed complexity of \emph{$k$-partial $c$-coloring} where $c=k$, a natural generalization of Brooks' theorem where each vertex should be colored from the palette $\{1,\ldots,c\} = \{1,\ldots,k\}$ such…
Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and…
Given a global field $K$ and a positive integer $n$, we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have any root in $K$. This strengthens the known result that the set of non-$n$-th-powers…
Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…