Related papers: Estimates on Lattice Points in the Circle
In this paper, we consider the rectilinear one-center problem on uncertain points in the plane. In this problem, we are given a set $P$ of $n$ (weighted) uncertain points in the plane and each uncertain point has $m$ possible locations each…
We give an explicit estimate of the area of a closed surface by the diameter and a lower bound of curvature. This is better than Calabi-Cao's estimate for a nonnegatively curved two-sphere.
Experimental designs that spread out points apart from each other on projections are important for computer experiments when not necessarily all factors have substantial influence on the response. We provide a theoretical framework to…
Ring galaxies are amazing objects exemplified by the famous case of the Hoag's Object. Here the mass of the central galaxy may be comparable to the mass of the ring, making it a difficult case to model mechanically. In a previous paper, it…
I discuss old and new determinations of the light quark masses using lattice QCD. Most lattice results using various approximations can be fit together in a simple picture which is consistent with lower values than conventionally supposed:…
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…
We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…
The paper reports a generalized expression for filling the congruent circles (of radius r) in a circle (of radius R). First, a generalized expression for the biggest circle (r) inscribed in the nth part of the bigger circle (R) was…
We estimate the lattice sums arising in the context of the integer point counting in polyhedra.
Based on a fairly precise approximation to the lattice discrepancy of a Lame disc, an asymptotic formula is established for the number of lattice points in a related three-dimensional body, linearly dilated by a large real parameter x.…
This paper contains some personal reflections on several computational contributions to what is now known as the "String Theory Landscape". It consists of two parts. The first part concerns the origin of big numbers, and especially the…
We give an upper bound for the number of rational points of height at most $B$, lying on a surface defined by a quadratic form $Q$. The bound shows an explicit dependence on $Q$. It is optimal with respect to $B$, and is also optimal for…
A general introduction to lattice QCD suitable for graduate students in experimental and theoretical particle physics. Aimed at those who want to know how lattice calculations are done, and what the pitfalls are, without having to do the…
We show that the number of lattice points lying in a thin annulus has a Gaussian value distribution if the width of the annulus tends to zero sufficiently slowly as we increase the inner radius.
In this paper we prove explicit estimates for the size of small lifts of points in homogeneous spaces. Our estimates are polynomially effective in the volume of the space and the injectivity radius.
The gluon propagator in Landau gauge is calculated in quenched QCD on a large (32^3X64) lattice at beta=6.0. In order to assess finite volume and finite lattice spacing artefacts, we also calculate the propagator on a smaller volume for two…
In this paper, we study dilation of cyclic polytopes with the vertices defined by a generator of the simplest cubic fields. In particular, for a specific range of values, we give a precise number of the contained lattice points.
We develop a procedure for the complete computational enumeration of lattice $3$-polytopes of width larger than one, up to any given number of lattice points. We also implement an algorithm for doing this and enumerate those with at most…
In the late 90's, Tom Wolff introduced the circle tangency counting problem in his expository article on the Kakeya conjecture. For collections of well-spaced circles, we break the $N^{3/2}$-barrier, proving that a set of $N$ well-spaced…
The problem of percolation along sites of square lattice is studied. The number of contours being external boundaries for finite clusters has been estimated using geometric considerations. This estimation makes it possible to determine more…