Related papers: Deformation Quantization and Irrational Numbers
In this paper, we establish asymptotic formulae with optimal errors for the number of rational points that are close to a planar curve, which unify and extend the results of Beresnevich-Dickinson-Velani and Vaughan-Velani. Furthermore, we…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
The problem of infinities in quantum field theory (QRT) is a long standing problem in physics.For solving this problem, different renormalization techniques have been suggested but the problem still persists. Here we suggest another…
We consider the problem of approaching real numbers with rational numbers with prime denominator and with a single numerator allowed for each denominator. We then present a simple application, related to possible correlations between trace…
In this paper we study counting functions representing the number of solutions of systems of linear inequalities which arise in the theory of Diophantine approximation. We develop a method that allows us to explain the random-like behavior…
Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…
We study the rational approximation properties of special manifolds defined by a set of polynomials with rational coefficients. Mostly we will assume the case of all polynomials to depend on only one variable. In this case the manifold can…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
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…
The input to the distant representatives problem is a set of $n$ objects in the plane and the goal is to find a representative point from each object while maximizing the distance between the closest pair of points. When the objects are…
We give upper and lower bounds for Diophantine exponents measuring how well a point in the plane can be approximated by points in the orbit of a lattice $\Gamma<\mathrm{SL}_2(\mathbb{R})$ acting linearly on $\mathbb{R}^2$. Our method gives…
Suppose that $F(x)\in\mathbb{Z}[[x]]$ is a Mahler function and that $1/b$ is in the radius of convergence of $F(x)$. In this paper, we consider the approximation of $F(1/b)$ by algebraic numbers. In particular, we prove that $F(1/b)$ cannot…
Metric Diophantine approximation in its classical form is the study of how well almost all real numbers can be approximated by rationals. There is a long history of results which give partial answers to this problem, but there are still…
The objective of this paper is to (partially) address the issue of finding an analogue to Khintchine's theorem for IFS Fractals. We study the convergence case for Diophantine approximations, and show an improved result for higher…
We develop a theory of diophantine approximation on generalized flag varieties, varieties that can be obtained as a quotient of a semisimple algebraic group by a parabolic subgroup. Using methods from the theory of arithmetic groups, due in…
This PhD thesis elaborates on a problem raised by Schmidt in 1967. We study Diophantine exponents for subspaces, which generalize the irrationality measure for real numbers. We construct subspaces with prescribed exponents and demonstrate…
The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…
In a previous paper, we studied certain sequences of simultaneous rational approximations in ${\bf R}^2$ which present some analogy with the continued fractions. We got results around the Littlewood conjecture by using such approximations.…
We study properties of Diophantine exponents of lattices and so-called related "weak" uniform approximations introduced in recent papers by Oleg German, in the simplest two-dimensional case. In contrast to the multidimensional case, in the…