English
Related papers

Related papers: Intersective polynomials and Diophantine approxima…

200 papers

Using purely combinatorial means we obtain results on simultaneous Diophantine approximation modulo 1 for systems of polynomials with real coefficients and no constant term.

Number Theory · Mathematics 2013-07-03 Ernie Croot , Neil Lyall , Alex Rice

We prove a strong simultaneous Diophantine approximation theorem for values of additive and multiplicative functions provided that the functions have certain regularity on the primes.

Number Theory · Mathematics 2009-06-18 Emre Alkan , Kevin Ford , Alexandru Zaharescu

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…

Number Theory · Mathematics 2010-01-26 Wieb Bosma , Ionica Smeets

The number of lattice points $\left| tP \cap \mathbb{Z}^d \right|$, as a function of the real variable $t>1$ is studied, where $P \subset \mathbb{R}^d$ belongs to a special class of algebraic cross-polytopes and simplices. It is shown that…

Number Theory · Mathematics 2018-06-05 Bence Borda

We obtain conditions for a trigonometric polynomial t of one variable to equal or be approximated by |p|^2 where p has frequencies in a Bohr set of integers obtained by projecting lattice points in the open planar region bounded by the…

Number Theory · Mathematics 2011-10-25 Wayne Lawton

We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…

Data Structures and Algorithms · Computer Science 2010-03-30 Antonio Ignacio Vera

We prove a generalization of W.M. Schmidt's theorem related to the Diophantine approximations for a linear form of the type $\alpha_1x_1+\alpha_2x_2 +y$ with {\it positive} integers $x_1,x_2$.

Number Theory · Mathematics 2011-12-22 Nikolay G. Moshchevitin

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…

Number Theory · Mathematics 2016-06-29 Dubi Kelmer

We estimate the lattice sums arising in the context of the integer point counting in polyhedra.

Combinatorics · Mathematics 2026-05-14 M. M. Skriganov

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…

Classical Analysis and ODEs · Mathematics 2020-12-22 Faruk Temur

In this short note, we closely follow the approach of Green and Tao to extend the best known bound for recurrence modulo 1 from squares to the largest possible class of polynomials. The paper concludes with a brief discussion of a…

Number Theory · Mathematics 2014-04-22 Neil Lyall , Alex Rice

This paper introduces some methods to determine the simultaneous approximation constants of a class of well approximable numbers $\zeta_{1},\zeta_{2},...,\zeta_{k}$. The approach relies on results on the connection between the set of all…

Number Theory · Mathematics 2017-01-05 Johannes Schleischitz

In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…

Number Theory · Mathematics 2020-05-15 Matthias Nickel

We study the problem of Diophantine approximation on lines in R^2 with prime numerator and denominator.

Number Theory · Mathematics 2013-09-23 Stephan Baier , Anish Ghosh

We study the problem of best approximations of a vector $\alpha\in{\mathbb R}^n$ by rational vectors of a lattice $\Lambda\subset {\mathbb R}^n$ whose common denominator is bounded. To this end we introduce successive minima for a periodic…

Number Theory · Mathematics 2007-05-23 Iskander Aliev , Martin Henk

We prove various theorems on approximation using polynomials with integer coefficients in the Bernstein basis of any given order. In the extreme, we draw the coefficients from $\{ \pm 1\}$ only. A basic case of our results states that for…

Information Theory · Computer Science 2022-12-08 C. Sinan Güntürk , Weilin Li

In this short paper we prove a quantitative version of the Khintchine-Groshev Theorem with congruence conditions. Our argument relies on a classical argument of Schmidt on counting generic lattice points, which in turn relies on a certain…

Number Theory · Mathematics 2022-08-01 Mahbub Alam , Anish Ghosh , Shucheng Yu

Some particular examples of classical and quantum systems on the lattice are solved with the help of orthogonal polynomials and its connection to continuous models are explored.

Mathematical Physics · Physics 2007-05-23 M. Lorente

We prove new quantitative Schmidt-type theorem for Diophantine approximations with restraint denominators on fractals (more precisely, on $M_0$-sets). Our theorems introduce a sharp balance condition between the growth rate of the sequence…

Number Theory · Mathematics 2024-01-18 Volodymyr Pavlenkov , Evgeniy Zorin

Recent years have seen very important developments at the interface of Diophantine approximation and homogeneous dynamics. In the first part of the paper we give a brief exposition of a dictionary developed by Dani and Kleinbock-Margulis…

Number Theory · Mathematics 2014-01-28 Anish Ghosh , Alexander Gorodnik , Amos Nevo
‹ Prev 1 2 3 10 Next ›