Related papers: Isolated Diophantine numbers
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
We study the topology of the complements of discriminants of simple real boundary singularities by counting the connected components of these sets and assigning to them certain topological characteristics. Results of this paper serve as a…
Fix an integer $n\ge 2$. To each non-zero point $\mathbf{u}$ in $\mathbb{R}^n$, one attaches several numbers called exponents of Diophantine approximation. However, as Khintchine first observed, these numbers are not independent of each…
Diophantine quadruples are sets of four distinct positive integers such that the product of any two is one less than a square. All known examples belong to an infinite set which can be constructed recursively. Some observations on these…
We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…
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…
Let R be a recursive subring of a number field. We show that recursively enumerable sets are diophantine for the polynomial ring R[Z].
We collect a number of open questions concerning Diophantine equations, Diophantine Approximation and transcendental numbers. Revised version: corrected typos and added references.
We consider the numerical evaluation of a class of double integrals with respect to a pair of self-similar measures over a self-similar fractal set (the attractor of an iterated function system), with a weakly singular integrand of…
Cantor's famous proof of the non-denumerability of real numbers does apply to any infinite set. The set of exclusively all natural numbers does not exist. This shows that the concept of countability is not well defined. There remains no…
In 1926 Khintchine introduced a topological argument proving the existence of uncountably many nontrivial singular linear forms of $n \geq 2$ variables. Throughout the years, this argument has been extensively modified and generalized. Most…
According to a recent conjecture, isospectral objects have different nodal count sequences. We study generalized Laplacians on discrete graphs, and use them to construct the first non-trivial counter-examples to this conjecture. In…
In this paper we introduce the notion of a weak uniform Diophantine exponent of a real number and obtain the complete description of the spectrum of its values.
In the present article, the main attention is given to fractal sets whose elements have certain restrictions on using digits or combinations of digits in own nega-P-representation. Topological, metric, and fractal properties of images of…
We study the minimal number of existential quantifiers needed to define a diophantine set over a field and relate this number to the essential dimension of the functor of points associated to such a definition.
We prove that infinite p-adically discrete sets have Diophantine definitions in large subrings of some number fields. First, if K is a totally real number field or a totally complex degree-2 extension of a totally real number field, then…
We investigate some self-similar Cantor sets $C(l,r,p)$, which we call S-Cantor sets, generated by numbers $l,r,p \in \mathbb{N}$, $l+r<p$. We give a full characterization of the set $C(l_1,r_1,p)-C(l_2,r_2,p)$ which can take one of the…
Fractals equipped with intrinsic arithmetic lead to a natural definition of differentiation, integration and complex numbers. Applying the formalism to the problem of a Fourier transform on fractals we show that the resulting transform has…
Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…
A general construction yielding infinitely many families of $D(m^2)$-triples of triangular numbers is presented. Moreover, each triple obtained from this construction contains the same triangular number $T_n$.