English
Related papers

Related papers: On two lattice points problems about the parabola

200 papers

We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the number of lattice points in a Euclidean ball in terms of sublattice determinants, and conjecture its optimal form. The conjecture exhibits…

Metric Geometry · Mathematics 2016-06-23 Daniel Dadush , Oded Regev

Suppose $a,~b$ are fixed algebraic numbers with $1\leq a<b$. Let $\Delta_{a,b}(x)$ be the error term for the number of lattice points in a two-dimensional area $h^ar^b\leq x $ with $h, r$ positive integers. In this paper, we establish an…

Number Theory · Mathematics 2025-03-19 Lirui Jia , Wenguang Zhai

We study lattice points on hyperbolic circles centred at Heegner points of class number one. Our main result is that, on a density one subset of radii tending to infinity, the angles of such points equidistribute on the unit circle. To…

Number Theory · Mathematics 2022-06-17 Giacomo Cherubini , Alessandro Fazzari

Combining $2$-descent techniques with Riemann-Roch and B\'ezout's theorems, we give an upper bound on the number of rational points of bounded height on elliptic and hyperelliptic curves over function fields of characteristic $\neq 2$. We…

Number Theory · Mathematics 2025-10-16 Jean Gillibert , Emmanuel Hallouin , Aaron Levin

We introduce in this document a direct method allowing to solve numerically inverse type problems for linear parabolic equations. We consider the reconstruction of the full solution of the parabolic equation posed in $\Omega\times (0,T)$ -…

Optimization and Control · Mathematics 2024-02-11 Arnaud Munch , Diego Souza

We obtain new omega results for the error terms in two classical lattice point problems. These results are likely to be the best possible.

Number Theory · Mathematics 2007-05-23 Kannan Soundararajan

We give an explicit upper bound on the volume of lattice simplices with fixed positive number of interior lattice points. The bound differs from the conjectural sharp upper bound only by a linear factor in the dimension. This improves…

Combinatorics · Mathematics 2017-10-25 Gennadiy Averkov , Jan Krümpelmann , Benjamin Nill

Let $\Gamma$ be an irreducible lattice in $\PSL_2(\RR)^d$ ($d\in\NN$) and $z$ a point in the $d$-fold direct product of the upper half plane. We study the discrete set of componentwise distances ${\bf D}(\Gm,z)\subset \RR^d$ defined in (1).…

Number Theory · Mathematics 2009-04-21 Roelof Bruggeman , Fritz Grunewald , Roberto Miatello

We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums…

Optimization and Control · Mathematics 2025-07-08 Abderrahim Hantoute , Alexander Y. Kruger , Marco A. López

The iterated composition of two operators, both of which are involutions and translation invariant, partitions the set of lattice points in the plane into an infinite sequence of discrete parabolas. Each such parabola contains an associated…

Number Theory · Mathematics 2025-01-07 Cristian Cobeli , Aaditya Raghavan , Alexandru Zaharescu

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

Number Theory · Mathematics 2013-11-13 Samuel Holmin

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

Number Theory · Mathematics 2022-07-21 Ralph Howard , Ognian Trifonov

For d-dimensional irrational ellipsoids E with d >= 9 we show that the number of lattice points in rE is approximated by the volume of rE, as r tends to infinity, up to an error of order o(r^{d-2}). The estimate refines an earlier authors'…

Number Theory · Mathematics 2016-09-07 Vidmantas Bentkus , Friedrich Götze

We present new estimates for sums of the divisor function, and other similar arithmetic functions, in short intervals over function fields. (When the intervals are long, one obtains a good estimate from the Riemann hypothesis.) We obtain an…

Number Theory · Mathematics 2020-04-21 Will Sawin

An asymptotic formula is established for the number of rational points of bounded anticanonical height which lie on a certain Zariski open subset of an arbitrary smooth biquadratic hypersurface in sufficiently many variables. The proof uses…

Number Theory · Mathematics 2018-10-22 T. D. Browning , L. Q. Hu

Given a primitive collection of vectors in the integer lattice, we count the number of ways it can be extended to a basis by vectors with sup-norm bounded by $T$, producing an asymptotic estimate as $T \to \infty$. This problem can be…

Number Theory · Mathematics 2022-01-27 Maxwell Forst , Lenny Fukshansky

We use classical methods from analytic number theory to resolve the lattice point counting problem on the first Heisenberg group, in the case where the gauge function is taken to be the Cygan-Kor$\acute{a}$nyi Heisenberg-norm…

Number Theory · Mathematics 2017-10-10 Yoav A. Gath

The aim of this article is to show how certain parabolic theorems follow from their elliptic counterparts. This technique is demonstrated through new proofs of five important theorems in parabolic unique continuation and the regularity…

Analysis of PDEs · Mathematics 2017-10-18 Blair Davey

We study an optimal stretching problem, which is a variant lattice point problem, for convex domains in $\mathbb{R}^d$ ($d\geq 2$) with smooth boundary of finite type that are symmetric with respect to each coordinate hyperplane/axis. We…

Number Theory · Mathematics 2021-11-12 J. Guo , T. Jiang

We prove a sharp upper bound on the number of boundary lattice points of a rational polygon in terms of its denominator and the number of interior lattice points, generalizing Scott's inequality. We then give sharp lower and upper bounds on…

Combinatorics · Mathematics 2024-11-19 Martin Bohnert , Justus Springer