Related papers: Counting rational points on the sphere with bounde…

We obtain new restrictions on the linear programming bound for sphere packing, by optimizing over spaces of modular forms to produce feasible points in the dual linear program. In contrast to the situation in dimensions 8 and 24, where the…

We prove a limit theorem for the the maximal interpoint distance (also called the diameter) for a sample of n i.i.d. points in the unit ball of dimension 2 or more. The exact form of the limit distribution and the required normalisation are…

We determine the maximum number of rational points on a curve over $\mathbb{F}_2$ with fixed gonality and small genus.

We develop a link between degree estimates for rational sphere maps and compressed sensing. We provide several new ideas and many examples, both old and new, that amplify connections with linear programming. We close with a list of ten open…

We investigate the problem of density estimation on the unit circle and the unit sphere from a computational perspective. Our primary goal is to develop new density estimators that are both rate-optimal and computationally efficient for…

A sieve for rational points on suitable varieties is developed, together with applications to counting rational points in thin sets, the number of varieties in a family which are everywhere locally soluble, and to the notion of friable…

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

Based on computational evidence, we formulate a number of conjectures on the distribution of rational points on curves of genus 2 over the rational numbers, in terms of the size of the coefficients of an equation of the form y^2 = f(x) >.

We classify connected sums of three-dimensional lens spaces which smoothly bound rational homology balls. We use this result to determine the order of each lens space in the group of rational homology 3-spheres up to rational homology…

We study a weighted divisor function $\mathop{{\sum}'}\limits_{mn\leq x}\cos(2\pi m\theta_1)\sin(2\pi n\theta_2)$, where $\theta_i (0<\theta_i<1)$ is a rational number. By connecting it with the divisor problem with congruence conditions,…

In this paper we study the boundedness of extension operators associated with spheres in vector spaces over finite fields.In even dimensions, we estimate the number of incidences between spheres and points in the translated set from a…

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 prove that, for any $n\geq 0$, there exists an uncountable, $n$-dimensional, excellent, regular local ring with countable spectrum.

Let $S=\{x^2+c_1, x^2+c_2,\dots, x^2+c_s\}$ be a set of quadratic polynomials with rational coefficients, and let $P$ be a rational basepoint. We classify the pairs $(S,P)$ for which $P$ has finite orbit for $S$, assuming that the maximum…

Let $p/q$ ($p, q \in \mathbb{N}^*$) be a positive rational number such that $p > q^2$. We show that for any $\epsilon > 0$, there exists a set $A(\epsilon) \subset [0, 1[$, with finite border and with Lebesgue measure $< \epsilon$, for…

We give a sharp upper bound for the entries of the representations of a rational number as a sum of Egyptian fractions.

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

We address the problem of the maximal finite number of real points of a real algebraic curve (of a given degree and, sometimes, genus) in the projective plane. We improve the known upper and lower bounds and construct close to optimal…

We give an upper bound on the number of perfect matchings in simple graphs with a given number of vertices and edges. We apply this result to give an upper bound on the number of 2-factors in a directed complete bipartite balanced graph on…

A formalism is given to count integer and rational solutions to polynomial equations with rational coefficients. These polynomials $P(x)$ are parameterized by three integers, labeling an elliptic curve. The counting of the rational…