Related papers: Counting sheaves using spherical codes

For a reduced projective scheme over the ring of integers of a number field, the set of places over which the fibres of the scheme are not reduced is a finite set. We give an explicit upper bound for the product of the norms of places in…

We introduce a notion of complexity of a complex of ell-adic sheaves on a quasi-projective variety and prove that the six operations are "continuous", in the sense that the complexity of the output sheaves is bounded solely in terms of the…

Ribbon graphs embedded on a Riemann surface provide a useful way to describe the double line Feynman diagrams of large N computations and a variety of other QFT correlator and scattering amplitude calculations, e.g in MHV rules for…

We introduce a notion of a sheaf of vector spaces on a graph, and develop the foundations of homology theories for such sheaves. One sheaf invariant, its "maximum excess," has a number of remarkable properties. It has a simple definition,…

This paper introduces the concept of supermanifolds, viewed as the super-analogues of classical manifolds. Instead of treating supermanifolds as sets of points, we adopt an algebraic-geometric perspective, emphasizing the algebra of…

In this paper, we introduce numerical cohomology for arithmetic surfaces, which leads to an absolute version of arithmetic Riemann-Roch formula. As an application, we derive an upper bound for the self-intersection number of relative…

Let $F$ be a field of characteristic not $2$ with finitely many square classes. Using combinatorial arguments applied to objects related to vector spaces over finite fields, we deduce an upper bound for the number of Pfister forms over $F$.…

By making use of the classification of real simple Lie algebra, we get the maximum of the squared length of restricted roots case by case, thus we get the upper bounds of sectional curvature for irreducible Riemannian symmetric spaces of…

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…

We find new polynomial upper bounds for the size of nodal sets of eigenfunctions when the Riemannian manifold has a Gevrey or quasianalytic regularity.

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better…

Let $D$ be a division algebra, finite-dimensional over its center, and $R=D[t;\sigma,\delta]$ a skew polynomial ring. Using skew polynomials $f\in R$, we construct division algebras and a generalization of maximum rank distance codes…

We determine all isomorphism classes of hyperfields of a given finite order which can be obtained as quotients of finite fields of sufficiently large order. Using this result, we determine which hyperfields of order at most 4 are quotients…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

We show that it is possible to approximate the zeta-function of a curve over a finite field by meromorphic functions which satisfy the same functional equation and moreover satisfy (respectively do not satisfy) the analogue of the Riemann…

"Most" hypersurfaces in projective space are irreducible, and rather precise estimates are known for the probability that a random hypersurface over a finite field is reducible. This paper considers the parametrization of space curves by…

We introduce numerical algebraic geometry methods for computing lower bounds on the reach, local feature size, and the weak feature size of the real part of an equidimensional and smooth algebraic variety using the variety's defining…

In this paper, we study meromorphic functions on a domain $\Omega \subset \mathbb{C}$ whose image has finite spherical area, counted with multiplicity. The paper is composed of two parts. In the first part, we show that the limit of a…

We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…