Related papers: Lattice counting problem
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 study the error of the number of points of the lattice $\mathbb{Z}^{d}$ that fall into a dilated and translated hypercube centred around $0$ and whose axis are parallel to the axis of coordinates. We show that if $t$, the factor of…
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…
We study the error of the number of points of a lattice $L$ that belong to a rectangle, centred at $0$, whose axes are parallel to the coordinate axes, dilated by a factor $t$ and then translated by a vector $X \in \mathbb{R}^{2}$. When we…
In this paper, we obtain sharp estimates for the number of lattice points under and near the dilation of a general parabola, the former generalizing an old result of Popov. We apply Vaaler's lemma and the Erd\H{o}s-Turan inequality to…
We develop the theory of lattice point counting on connected and simply connected nilpotent Lie groups of step-two, endowed with the parabolic type dilation and a family of homogeneous norms $ \mathcal{N}_{\alpha,M}(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…
In the averaging process on a graph $G = (V, E)$, a random mass distribution $\eta$ on $V$ is repeatedly updated via transformations of the form $\eta_{v}, \eta_{w} \mapsto (\eta_{v} + \eta_{w})/2$, with updates made according to…
We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums…
We investigate in this paper the distribution of the discrepancy of various lattice counting functions. In particular, we prove that the number of lattice points contained in certain domains defined by products of linear forms satisfies a…
We show the existence of a limiting distribution $\cD_\cC$ of the adequately normalized discrepancy function of a random translation on a torus relative to a strictly convex set $\cC$. Using a correspondence between the small divisors in…
In order to characterize the fluctuation between the ergodic limit and the time-averaging estimator of a full discretization in a quantitative way, we establish a central limit theorem for the full discretization of the parabolic stochastic…
We consider the problem of counting lattice points contained in domains in $\mathbb{R}^d$ defined by products of linear forms and we show that the normalized discrepancies in these counting problems satisfy non-degenerate Central Limit…
The paper considers an Euler discretization based numerical scheme for approximating functionals of invariant distribution of an ergodic diffusion. Convergence of the numerical scheme is shown for suitably chosen discretization step, and a…
It has recently been shown that there are substantial differences in the regularity behavior of the empirical process based on scalar diffusions as compared to the classical empirical process, due to the existence of diffusion local time.…
We prove a counting theorem concerning the number of lattice points for the dual lattices of weakly admissible lattices in an inhomogeneously expanding box, which generalises a counting theorem of Skriganov. The error term is expressed in…
Unfolding problems often arise in the context of statistical data analysis. Such problematics occur when the probability distribution of a physical quantity is to be measured, but it is randomized (smeared) by some well understood process,…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
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 establish an asymptotic formula for the number of lattice points in the sets \[ \mathbf S_{h_1, h_2, h_3}(\lambda): =\{x\in\mathbb Z_+^3:\lfloor h_1(x_1)\rfloor+\lfloor h_2(x_2)\rfloor+\lfloor h_3(x_3)\rfloor=\lambda\} \quad…