English
Related papers

Related papers: Diophantine Equations over $\mathbb Z$: Universal …

200 papers

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

Rings and Algebras · Mathematics 2020-05-12 A. A. Chilikov , A. Ya. Belov

In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…

Number Theory · Mathematics 2026-05-05 Gaurav Aggarwal , Anish Ghosh

How difficult are interactive theorem provers to use? We respond by reviewing the formalization of Hilbert's tenth problem in Isabelle/HOL carried out by an undergraduate research group at Jacobs University Bremen. We argue that, as…

Logic in Computer Science · Computer Science 2021-06-24 Jonas Bayer , Marco David , Abhik Pal , Benedikt Stock

We develop a variety of new techniques to treat Diophantine equations of the shape $x^2+D =y^n$, based upon bounds for linear forms in $p$-adic and complex logarithms, the modularity of Galois representations attached to Frey-Hellegouarch…

Number Theory · Mathematics 2022-08-01 Michael A. Bennett , Samir Siksek

We investigate in the paper general (not necessarily definite) canonical systems of differential equation in the framework of extension theory of symmetric linear relations. For this aim we first introduce the new notion of a boundary…

Functional Analysis · Mathematics 2011-09-14 Vadim Mogilevskii

Introduction to the special issue of Phil. Trans. R. Soc. A 376, 2018, `Hilbert's Sixth Problem'. The essence of the Sixth Problem is discussed and the content of this issue is introduced. In 1900, David Hilbert presented 23 problems for…

History and Philosophy of Physics · Physics 2018-03-20 Alexander N. Gorban

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, we show that the following two problems can be solved in the complexity class PSPACE: (I) Given polynomials f_1,...,f_m in…

Number Theory · Mathematics 2007-05-23 J. Maurice Rojas

Simultaneous Diophantine approximation is concerned with the approximation of a point $\mathbf x\in\mathbb R^d$ by points $\mathbf r\in\mathbb Q^d$, with a view towards jointly minimizing the quantities $\|\mathbf x - \mathbf r\|$ and…

Number Theory · Mathematics 2018-01-25 Lior Fishman , David Simmons

Diophantine approximation explores how well irrational numbers can be approximated by rationals, with foundational results by Dirichlet, Hurwitz, and Liouville culminating in Roth's theorem. Schmidt's subspace theorem extends Roth's results…

Number Theory · Mathematics 2025-02-06 Shivani Goel , Rashi Lunia , Anwesh Ray

In this paper we prove the boundedness and H\"older continuity of quasilinear elliptic problems involving variable exponents for a homogeneous Dirichlet and a nonhomogeneous Neumann boundary condition, respectively. The novelty of our work…

Analysis of PDEs · Mathematics 2022-01-10 Ky Ho , Yun-Ho Kim , Patrick Winkert , Chao Zhang

An important unsolved problem in Diophantine number theory is to establish a general method to effectively find all solutions to any given $S$-unit equation with at least four terms. Although there are many works contributing to this…

Number Theory · Mathematics 2025-03-04 Takafumi Miyazaki

We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…

Number Theory · Mathematics 2025-10-20 J. Maurice Rojas

We study the Diophantine problem, i.e. the decision problem of solving systems of equations, for some families of one-relator groups, and provide some background for why this problem is of interest. The method used is primarily the…

Group Theory · Mathematics 2022-08-16 Carl-Fredrik Nyberg-Brodda

Consider the equation $q_1\alpha^{x_1}+\dots+q_k\alpha^{x_k} = q$, with constants $\alpha \in \overline{\mathbb{Q}} \setminus \{0,1\}$, $q_1,\ldots,q_k,q\in\overline{\mathbb{Q}}$ and unknowns $x_1,\ldots,x_k$, referred to in this paper as…

Number Theory · Mathematics 2023-03-24 Richard Mandel , Alexander Ushakov

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

Geometric Topology · Mathematics 2015-07-07 Jason Behrstock , Cornelia Drutu

By applying inter-universal Teichm\"uller theory and its slight modification over the rational number field, we prove new Diophantine results towards effective abc inequalities and the generalized Fermat equations. For coprime integers $a,…

Number Theory · Mathematics 2025-03-20 Zhong-Peng Zhou

The heights of iterates of the discrete Painleve equations over number fields appear to grow no faster than polynomials while the heights of generic solutions of non-integrable discrete equations grow exponentially. This gives rise to a…

Exactly Solvable and Integrable Systems · Physics 2009-11-11 R. G. Halburd

Machine learning researchers and practitioners steadily enlarge the multitude of successful learning models. They achieve this through in-depth theoretical analyses and experiential heuristics. However, there is no known general-purpose…

Computational Complexity · Computer Science 2023-10-18 Matthias C. Caro

This work presents a study of perturbations of symmetric Boolean functions. In particular, it establishes a connection between exponential sums of these perturbations and Diophantine equations of the form $$ \sum_{l=0}^n \binom{n}{l}…

Combinatorics · Mathematics 2018-01-12 Francis N. Castro , Oscar E. González , Luis A. Medina

A recent paper of Arnold, Falk, and Winther [Bull AMS, 47 (2010)] showed that a large class of mixed finite element methods can be formulated naturally on Hilbert complexes, where using a Galerkin-like approach, one solves a variational…

Numerical Analysis · Mathematics 2012-08-01 Michael Holst , Ari Stern