OpenAlex ·
Lattice point visibility along powers of quadratic polynomials
- Published
- Source
- OpenAlex
- Published in
- arXiv (Cornell University)
- DOI
- 10.48550/arxiv.2609.05027
- Original
- Read it at the publisher
- Topics
Abstract
We study the growth of the number of invisible lattice points along powers of quadratic polynomials. Let $f(x)=Ax^2+Bx+C\in\mathbb{Z}[x]$ have a positive leading coefficient and nonzero discriminant, and let $F(x)=f(x)^m$ with $m\geq 2$. For $m\geq 3$ we prove that the number of invisible lattice points in $[1,N]^2$ has order $N\log N$, and when $m=2$ the number of invisible lattice points satisfies $N\log N \ll_F\#\mathrm{Invisible}_F(N)\ll_F N(\log N)^4$. These estimates refine a previous result of the authors.
The authors’ abstract, as arXiv lists it. arXiv’s listings, abstracts included, are free for anyone to reuse.
Read it on ReadSearch
Each opens after you create an account, and brings you back to this paper.
More in Combinatorics
An Improved Upper Bound for Multicolour Ramsey Numbers
Integral Dependence over One-Sided Ideals, Part I: Foundations and Classical Applications
Local Jacquet-Shalika integrals and modifying factors
Comparisons between ordinary and symbolic powers of edge ideals with respect to regularity and depth
Cone upgrade for effective equidistribution and weighted Khintchine--Schmidt theorem on fractals
Get the few papers worth your time in Combinatorics every morning.
ReadSearch reads the new papers in your field each day and brings you the few worth reading, each with its key finding in a sentence.