English
Related papers

Related papers: Rotations by roots of unity and Diophantine approx…

200 papers

In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…

Algebraic Geometry · Mathematics 2019-07-19 Joachim von zur Gathen , Guillermo Matera

Given $n\in N$ and $x,\gamma\in R$, let \begin{equation*} ||\gamma-nx||^\prime=\min\{|\gamma-nx+m|:m\in Z, \gcd (n,m)=1\}, \end{equation*} %where $(n,m)$ is the largest common divisor of $n$ and $m$. Two conjectures in the coprime…

Number Theory · Mathematics 2019-09-02 Svetlana Jitomirskaya , Wencai Liu

We prove that there exist arbitrarily small positive real numbers $\epsilon$ such that every integral power $(1 + \vepsilon)^n$ is at a distance greater than $2^{-17} \epsilon |\log \vepsilon|^{-1}$ to the set of rational integers. This is…

Number Theory · Mathematics 2010-09-24 Yann Bugeaud , Nikolay Moshchevitin

In this paper we study a quantitative notion of exactness within Diophantine approximation. Given $\Psi:(0,\infty)\to (0,\infty)$ and $\omega:(0,\infty)\to (0,1)$ satisfying $\lim_{q\to\infty}\omega(q)=0$, we study the set of points, which…

Number Theory · Mathematics 2025-10-22 Simon Baker , Benjamin Ward

In [Compositio Math. 155 (2019)] Kleinbock and Wadleigh proved a "zero-one law" for uniform inhomogeneous Diophantine approximations. We generalize this statement with arbitrary weight functions and establish a new and simple proof of this…

Number Theory · Mathematics 2025-08-05 Vasiliy Neckrasov

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

Number Theory · Mathematics 2021-03-11 Johannes Schleischitz

We study the approximability of Max Ones when the number of variable occurrences is bounded by a constant. For conservative constraint languages (i.e., when the unary relations are included) we give a complete classification when the number…

Computational Complexity · Computer Science 2007-05-23 Fredrik Kuivinen

Let $\Omega$ be a measurable Euclidean set in $\mathbb{R}^{n}$ that is symmetric, i.e. $\Omega=-\Omega$, such that $\Omega\times\mathbb{R}$ has the smallest Gaussian surface area among all measurable symmetric sets of fixed Gaussian volume.…

Probability · Mathematics 2022-04-27 Steven Heilman

We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…

Dynamical Systems · Mathematics 2011-01-21 Manfred Einsiedler , Lior Fishman , Uri Shapira

Recently, W. M. Schmidt and L. Summerer introduced a new theory which allowed them to recover the main known inequalities relating the usual exponents of Diophantine approximation to a point in $\mathbb{R}^n$, and to discover new ones. They…

Number Theory · Mathematics 2016-04-26 Damien Roy

The inhomogeneous Khintchine-Groshev Theorem is a classical generalization of Khintchine's Theorem in Diophantine approximation, by approximating points in $\mathbb{R}^m$ by systems of linear forms in $n$ variables. Analogous to the…

Number Theory · Mathematics 2023-12-05 Manuel Hauke

In this paper, we establish hybrid results on Diophantine approximation with primes from short intervals. In particular, we prove the following result in a slightly modified form: If $\alpha$ is an irrational number having a continued…

Number Theory · Mathematics 2026-04-07 Stephan Baier , Sayantan Roy

This paper deals with the problem of quantifying the approximation a probability measure by means of an empirical (in a wide sense) random probability measure, depending on the first n terms of a sequence of random elements. In Section 2,…

Probability · Mathematics 2018-08-23 Emanuele Dolera , Eugenio Regazzini

We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length $n$, counted by their number of cycles. We then use this result to prove that if $k$ is the number of…

Numerical Analysis · Mathematics 2007-05-23 Miklos Bona

It is shown that the correlation functions of the random variables $\det(\lambda - X)$, in which $X$ is a real symmetric $ N\times N$ random matrix, exhibit universal local statistics in the large $N$ limit. The derivation relies on an…

Mathematical Physics · Physics 2009-11-07 E. Brezin , S. Hikami

We show that the parabola is of strong Khintchine type for convergence, which is the first result of its kind for curves. Moreover, Jarnik type theorems are established in both the simultaneous and the dual settings, without monotonicity on…

Number Theory · Mathematics 2018-12-18 Jing-Jing Huang

In this paper, we give a definition of Diophantine points of type $\gamma$ for $\gamma\geq0$ in a homogeneous space $G/\Gamma$, and compute the Hausdorff dimension of the subset of points which are not Diophantine of type $\gamma$ when $G$…

Dynamical Systems · Mathematics 2019-08-06 Cheng Zheng

Let $\mathbf X=(X_{jk})$ denote a Hermitian random matrix with entries $X_{jk}$, which are independent for $1\le j\le k$. We consider the rate of convergence of the empirical spectral distribution function of the matrix $\mathbf X$ to the…

Probability · Mathematics 2013-10-29 Friedrich Götze , Alexander Tikhomirov

We prove an analogue the Khinchin theorem for the Diophantine approximation by integer vectors lying on a quadratic variety. The proof is based on the study of a dynamical system on a homogeneous space of the orthogonal group. We show that…

Number Theory · Mathematics 2018-12-07 Alexander Gorodnik , Nimish A. Shah

We discuss several open problems in Diophantine approximation. Among them there are famous Littlewood's and Zaremba's conjectures as well as some new and not so famous problems.

Number Theory · Mathematics 2012-12-27 Nikolay G. Moshchevitin