Related papers: Counting sheaves using spherical codes
We push further the classical proof of Weil upper bound for the number of rational points of an absolutely irreducible smooth projective curve $X$ over a finite field in term of euclidean relationships between the Neron Severi classes in…
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…
We prove an analogue of the Riemann-Hurwitz theorem for computing Euler characteristics of pullbacks of coherent sheaves through finite maps of smooth projective varieties, subject only to the condition that the irreducible components of…
In 2014, Flynn and the second author bounded the average number of components of the functional graphs of polynomials of fixed degree over a finite field. When the fixed degree was large (relative to the size of the finite field), their…
In this paper we give an upper bound for the number of integral points on an elliptic curve E over F_q[T] in terms of its conductor N and q. We proceed by applying the lower bounds for the canonical height that are analogous to those given…
A function field over a finite field is called maximal if it achieves the Hasse-Weil bound. Finding possible genera that maximal function fields achieve has both theoretical interest and practical applications to coding theory and other…
We explicitly calculate an arithmetic adelic quotient group for a locally free sheaf on an arithmetic surface when the fiber over the infinite point of the base is taken into account. The calculations are presented via a short exact…
We prove effective bounds on the rate in the quadratic growth asymptotics for the orbit of a non-uniform lattice of SL(2,R), acting linearly on the plane. This gives an error bound in the count of saddle connection holonomies, for some…
We provide upper bounds for the size of subsets of finite fields lacking the polynomial progression $$ x, x+y, ..., x+(m-1)y, x+y^m, ..., x+y^{m+k-1}.$$ These are the first known upper bounds in the polynomial Szemer\'{e}di theorem for the…
Sampling theory has traditionally drawn tools from functional and complex analysis. Past successes, such as the Shannon-Nyquist theorem and recent advances in frame theory, have relied heavily on the application of geometry and analysis.…
Estimating the number of vertices of a two dimensional projection, called a shadow, of a polytope is a fundamental tool for understanding the performance of the shadow simplex method for linear programming among other applications. We prove…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…
We study locally free sheaves of rank two on the projective line over the integers, especially indecomposable ones. Subsequently we apply various concepts of Arakelov geometry to these sheaves. We compute for example the arithmetic Chern…
Sheaf cohomology or, more generally, higher direct images of coherent sheaves along proper morphisms are central to modern algebraic geometry. However, the computation of these objects is a non-trivial and expensive task which easily…
Estimation algebras have been extensively studied in Euclidean space, where finite-dimensional estimation algebras form the foundation of the Kalman and Benes filters, and have contributed to the discovery of many other finite-dimensional…
Using a recent verification of the Riemann hypothesis up to height $3\cdot 10^{12}$, we provide strong estimates on $\pi(x)$ and other prime counting functions for finite ranges of $x$. In particular, we get that…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…
We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…
Branched covers between Riemann surfaces are associated with certain combinatorial data, and Hurwitz existence problem asks whether given data satisfying those combinatorial constraints can be realized by some branched cover. We connect…