English
Related papers

Related papers: $\mathbb Q\setminus\mathbb Z$ is diophantine over …

200 papers

We investigate Diophantine definability and decidability over some subrings of algebraic numbers contained in quadratic extensions of totally real algebraic extensions of $\mathbb Q$. Among other results we prove the following. The big…

Number Theory · Mathematics 2007-05-23 Alexandra Shlapentokh

Fix $d\in\mathbb N$, and let $S\subseteq\mathbb R^d$ be either a real-analytic manifold or the limit set of an iterated function system (for example, $S$ could be the Cantor set or the von Koch snowflake). An $extrinsic$ Diophantine…

Number Theory · Mathematics 2015-07-30 Lior Fishman , David Simmons

The following result, a consequence of Dumas criterion for irreducibility of polynomials over integers, is generally proved using the notion of Newton diagram: Let $f(x)$ be a polynomial with integer coefficients and $k$ be a positive…

History and Overview · Mathematics 2016-12-21 Akash Jena , Binod Kumar Sahoo

In this paper we consider some fragments of $\mathsf{IOpen}$ (Robinson arithmetic $\mathsf Q$ with induction for quantifier-free formulas) proposed by Harvey Friedman and answer some questions he asked about these theories. We prove that…

Logic · Mathematics 2023-06-21 Konstantin Kovalyov

We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of…

Number Theory · Mathematics 2012-02-14 Cormac O'Sullivan , Anthony Weaver

The Jacobian conjecture in dimension $n$ asserts that any polynomial endomorphism of $n$-dimensional affine space over a field of zero characteristic, with the Jacobian equal 1, is invertible. The Dixmier conjecture in rank $n$ asserts that…

Rings and Algebras · Mathematics 2017-12-05 Alexei Belov-Kanel , Maxim Kontsevich

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…

Logic in Computer Science · Computer Science 2026-05-19 Piotr Bacik , Joris Nieuwveld , Joël Ouaknine , Mihir Vahanwala , Madhavan Venkatesh , Emil Rugaard Wieser

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…

Number Theory · Mathematics 2026-04-14 Divyum Sharma , L. Singhal

For any $\varepsilon > 0$ we derive effective estimates for the size of a non-zero integral point $m \in \mathbb{Z}^d \setminus \{0\}$ solving the Diophantine inequality $\lvert Q[m] \rvert < \varepsilon$, where $Q[m] = q_1 m_1^2 + \ldots +…

Number Theory · Mathematics 2021-11-16 Paul Buterus , Friedrich Götze , Thomas Hille

Let $E\subset [0,1]$ be a set that supports a probability measure $\mu$ with the property that $|\widehat{\mu}(t)|\ll (\log |t|)^{-A}$ for some constant $A>2.$ Let $\mathcal{A}=(q_n)_{n\in \N}$ be a positive, real-valued, lacunary sequence.…

Number Theory · Mathematics 2024-09-06 Bo Tan , Qing-Long Zhou

In 1958, Sz\"{u}sz proved an inhomogeneous version of Khintchine's theorem on Diophantine approximation. Sz\"{u}sz's theorem states that for any non-increasing approximation function $\psi:\mathbb{N}\to (0,1/2)$ with $\sum_q \psi(q)=\infty$…

Number Theory · Mathematics 2021-06-15 Han Yu

In this paper we present a new method of solving certain quartic and higher degree homogeneous polynomial diophantine equations in four variables. The method can also be extended to solve simultaneous homogeneous polynomial diophantine…

Number Theory · Mathematics 2017-02-28 Ajai Choudhry

We prove that there exist infinitely many quartic rational Diophantine quadruples, that is, sets of four pairwise distinct nonzero rational numbers whose pairwise products increased by 1 are fourth powers in Q. To the best of our knowledge,…

Number Theory · Mathematics 2026-04-22 Alen Andrašek , Matija Kazalicki , Domagoj Vlah

In this paper we study the polynomial version of Pillai's conjecture on the exponential Diophantine equation \begin{equation*} p^n - q^m = f. \end{equation*} We prove that for any non-constant polynomial $ f $ there are only finitely many…

Number Theory · Mathematics 2023-12-05 Sebastian Heintze

We formalise the undecidability of solvability of Diophantine equations, i.e. polynomial equations over natural numbers, in Coq's constructive type theory. To do so, we give the first full mechanisation of the…

Logic in Computer Science · Computer Science 2023-06-22 Dominique Larchey-Wendling , Yannick Forster

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Logic · Mathematics 2024-07-23 Philipp Hieronymi , Sven Manthe , Chris Schulz

In this paper we consider the even monic degree-8 cuboid polynomial $P_{a,u}(t)$ with coprime integers $a\neq u>0$. We prove irreducibility over $\mathbb{Z}$ by excluding all degree-8 splittings. First, any putative $4{+}4$ factorization is…

General Mathematics · Mathematics 2025-10-14 Valery Asiryan

Diophantine subsets of $\mathbb{Z}$ play a key role in the negative answer to Hilbert's tenth problem. The definition of diophantine set generalizes in several ways to other commutative rings. We compare these definitions. Along the way, we…

Number Theory · Mathematics 2025-11-25 Bhargav Bhatt , Bjorn Poonen

This paper initiates a novel research direction in the theory of Diophantine equations: define an appropriate version of the equation's size, order all polynomial Diophantine equations starting from the smallest ones, and then solve the…

General Mathematics · Mathematics 2022-04-15 Bogdan Grechuk

A polynomial with rational coefficients is said to be pure with respect to a rational prime $p$ if its Newton polygon has one slope. In this article, we prove that the number of irreducible factors of the $n$-th iterate of a pure polynomial…

Number Theory · Mathematics 2023-01-31 Mohamed O Darwish , Mohammad Sadek