Related papers: Counting sheaves using spherical codes

We prove lower bounds on the error incurred when approximating any oscillating function using piecewise polynomial spaces. The estimates are explicit in the polynomial degree and have optimal dependence on the meshwidth and frequency when…

In [14] we found the large genus asymptotics of Hurwitz numbers for the Riemann sphere with a fixed number of general profiles and some (2,1^{d-2}) profiles. In this paper, motivated from [3], we generalize these results to Hurwitz numbers…

We establish asymptotic lower bounds for the number of elliptic curves over $\mathbb{Q}$ with prescribed entanglement of division fields, ordered by naive height. Such elliptic curves are obtained as $1$-parameter families arising from…

We give new upper bounds for the number of nonconstant holomorphic maps depending only on the genus. Our estimates improve previously known bounds. The proof is based on the study of pullbacks of holomorphic differentials, together with…

We study the number of rational points of smooth projective curves over finite fields in some relative situations in the spirit of a previous paper from an euclidean point of vue. We prove some kinds of relative Weil bounds, derived from…

We provide a description of the interpolating and sampling sequences on a space of holomorphic functions with a uniform growth restriction defined on finite Riemann surfaces.

We prove that the number of iterations taken by the Weisfeiler-Leman algorithm for configurations coming from Schreier graphs is closely linked to the diameter of the graphs themselves: an upper bound is found for general Schreier graphs,…

The Lovasz theta function provides a lower bound for the chromatic number of finite graphs based on the solution of a semidefinite program. In this paper we generalize it so that it gives a lower bound for the measurable chromatic number of…

We obtain a full asymptotic expansion for orthogonal polynomials with respect to weighted area measure on a Jordan domain $\mathscr{D}$ with real-analytic boundary. The weight is fixed and assumed to be real-analytically smooth and strictly…

By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…

We explicitly compute examples of sheaves over the projectivization of the spectrum of the cohomology of sl_2. In particular, we compute \ker\Theta_M for every indecomposable M and we compute F_i(M) when M is an indecomposable Weyl module…

We bound the number of incidences between points and spheres in finite vector spaces by bounding the sum of the number of points in the pairwise intersections of the spheres. We obtain new incidence bounds that are interesting when the…

In this paper we provide a framework for the study of isoperimetric problems in finitely generated group, through a combinatorial study of universal covers of compact simplicial complexes. We show that, when estimating filling functions,…

We give upper bounds of the numbers of holomorphic sections of Veech holomorphic families of Riemann surfaces. The numbers depend only on the topological types of base Riemann surfaces and fibers. We also show a relation between types of…

For a complete noncompact connected Riemannian manifold with bounded geometry, we prove the existence of isoperimetric regions in a larger space obtained by adding finitely many limit manifolds at infinity. As one of many possible…

A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…

Motivated by a question of van der Poorten about the existence of infinite chain of prime numbers (with respect to some base), in this paper we advance the study of sequences of consecutive polynomials whose coefficients are chosen…

In this paper we investigate the Erd\"os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We prove a good upper bound for spherical means that have been…

We give a sheaf theoretic interpretation of Potts models with external magnetic field, in terms of constructible sheaves and their Euler characteristics. We show that the polynomial countability question for the hypersurfaces defined by the…

We provide a novel achievability proof of the Slepian-Wolf theorem for i.i.d. sources over finite alphabets. We demonstrate that random codes that are linear over the real field achieve the classical Slepian-Wolf rate-region. For finite…