Related papers: Primitive points in rational polygons
We generalize Ehrhart's idea of counting lattice points in dilated rational polytopes: Given a rational simplex, that is, an n-dimensional polytope with n+1 rational vertices, we use its description as the intersection of n+1 halfspaces,…
We generalise M. M. Skriganov's notion of weak admissibility for lattices to include standard lattices occurring in Diophantine approximation and algebraic number theory, and we prove estimates for the number of lattice points in sets such…
In this article we will show that for every natural $d$ and $n>1$ there exists a natural number $t$ such that for every $d$-dimensional simplicial complex $\mathcal{T}$ with vertices in $\mathbb{Z}^d$, the number of lattice points in the…
Let Q(u,v) be a positive definite binary quadratic form with arbitrary real coefficients. For large real x, one may ask for the number B(x) of primitive lattice points (integer points (m,n) with gcd(m,n) = 1) in the ellipse disc Q(u,v) < x,…
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…
A point in the $d$-dimensional integer lattice $\mathbb{Z}^d$ is primitive when its coordinates are relatively prime. Two primitive points are multiples of one another when they are opposite, and for this reason, we consider half of the…
On the circle of radius $R$ centred at the origin, consider a ``thin'' sector about the fixed line $y = \alpha x$ with edges given by the lines $y = (\alpha \pm \epsilon) x$, where $\epsilon = \epsilon_R \rightarrow 0$ as $ R \to \infty $.…
We study the error of the number of unimodular lattice points that fall into a dilated and centred ellipse around $0$. We first show that the study of the error, when the error is normalized by $\sqrt{t}$ with $t$ the parameter of…
We obtain an analogue of the prime number theorem for a class of branched covering maps on the $2$-sphere called expanding Thurston maps $f$, which are topological models of some rational maps without any smoothness or holomorphicity…
D.H. Lehmer found a quadratic polynomial such that 326 is a primitive root for the first 206 primes represented by this polynomial. It is shown that this is related to the class number one problem and prime producing quadratics. An…
A set of integers is \emph{primitive} if it does not contain an element dividing another. Denote by $f(n)$ the number of maximum-size primitive subsets of $\{1,\ldots, 2n\}$. We prove that the limit $\alpha=\lim_{n\rightarrow…
By combining and improving recent techniques and results, we provide explicit estimates for the error terms $|\pi(x)-\text{li}(x)|$, $|\theta(x)-x|$ and $|\psi(x)-x|$ appearing in the prime number theorem. For example, we show for all…
We obtain an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly expanding rational maps without any smoothness…
We study the error of the number of points of a unimodular lattice that fall in a strictly convex and analytic set having the origin and that is dilated by a factor $t$. The aim is to generalize the result of a previous article. We first…
Let $f$ be a Hecke-Maass cusp form for the full modular group and let $\chi$ be a primitive Dirichlet character modulo a prime $q$. Let $s_0=\sigma_0+it_0$ with $\frac{1}{2}\leq\sigma_0<1$. We improve the error term for the first moment of…
We obtain an analog of the prime number theorem for a class of branched covering maps on the $2$-sphere $S^2$ called expanding Thurston maps, which are topological models of some non-uniformly expanding rational maps without any smoothness…
Let $p>1$ be a large prime number, let $q=O(\log\log p)$ and let $1\leq a<q$ be a pair of relatively prime integers. It is proved that there is a prime primitive root $u\ll (\log p)(\log \log p)^5$ such that $u\equiv a\bmod q$ in the prime…
We study the distribution of lattice points with prime coordinates lying in the dilate of a convex planar domain having smooth boundary, with nowhere vanishing curvature. Counting lattice points weighted by a von Mangoldt function gives an…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
Let $E$ be an elliptic curve of rank $\text{rk}(E) \geq 1$, and let $P \in E(\mathbb{Q})$ be a point of infinite order. The number of elliptic primes $p \leq x$ for which $\langle P\rangle=E(\mathbb{F}_p)$ is expected to be…