Related papers: A note on well distributed sequences
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
We describe the spectrum of ordinary Diophantine exponents for $d$-dimensional lattices. The result reduces the problem to two-dimensional case and uses argument of metric theory.
We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.
We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
Following the development of weighted asymptotic approximation properties of matrices, we introduce the analogous uniform approximation properties (that is, study the improvability of Dirichlet's Theorem). An added feature is the use of…
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…
We study the problem of Diophantine approximation on lines in R^2 with prime numerator and denominator.
Recently in joint work with E. Sert, we proved sharp boundedness results on discrete fractional integral operators along binary quadratic forms. Present work vastly enhances the scope of those results by extending boundedness to bivariate…
The classical Khintchine-Groshev theorem is a generalization of Khintchine's theorem on simultaneous Diophantine approximation, from approximation of points in $\mathbb R^m$ to approximation of systems of linear forms in $\mathbb R^{nm}$.…
We fill a gap in the study of the Hausdorff dimension of the set of exact approximation order considered by Fregoli [Proc. Amer. Math. Soc. 152 (2024), no. 8, 3177--3182].
We study the asymptotic consistency properties of $\alpha$-R\'enyi approximate posteriors, a class of variational Bayesian methods that approximate an intractable Bayesian posterior with a member of a tractable family of distributions, the…
In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.
Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…
We give an algorithm that finds a sequence of approximations with Dirichlet coefficients bounded by a constant only depending on the dimension. The algorithm uses the LLL-algorithm for lattice basis reduction. We present a version of the…
We classify the metric spaces that can be approximated by finite homogeneous ones.
In this short note we introduce a new metric on certain finite groups. It leads to a class of groups for which the element orders satisfy an interesting inequality. This extends the class CP_2 studied in our previous paper [16].
In this paper we give a simple proof of an inequality for intermediate Diophantine exponents obtained recently by W. M. Schmidt and L. Summerer.
Wirsing's theorem on approximating algebraic numbers by algebraic numbers of bounded degree is a generalization of Roth's theorem in Diophantine approximation. We study variations of Wirsing's theorem where the inequality in the theorem is…
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…
We generalize Dirichlet's diophantine approximation theorem to approximating any real number $\alpha$ by a sum of two rational numbers $\frac{a_1}{q_1} + \frac{a_2}{q_2}$ with denominators $1 \leq q_1, q_2 \leq N$. This turns out to be…