Related papers: Counting sheaves using spherical codes

We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for…

We study a function $\mathcal{L}_{\Gamma}$ which quantifies the LEF (local embeddability into finite groups) property for a finitely generated group $\Gamma$. We compute this "LEF growth" function in some examples, including certain wreath…

We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.

Let Y be an infinite covering space of a projective manifold M in P^N of dimension n geq 2. Let C be the intersection with M of at most n-1 generic hypersurfaces of degree d in P^N. The preimage X of C in Y is a connected submanifold. Let…

Several problems in computer algebra can be efficiently solved by reducing them to calculations over finite fields. In this paper, we describe an algorithm for the reconstruction of multivariate polynomials and rational functions from their…

Statistical shape analysis can be done in a Riemannian framework by endowing the set of shapes with a Riemannian metric. Sobolev metrics of order two and higher on shape spaces of parametrized or unparametrized curves have several desirable…

We show that transcendental curves in $\mathbb R^n$ (not necessarily compact) have few rational points of bounded height provided that the curves are well behaved with respect to algebraic sets in a certain sense and can be parametrized by…

We prove upper bounds for Hecke-Laplace eigenfunctions on certain Riemannian manifolds of arithmetic type. The manifolds under consideration are d-fold products of 2-spheres or 3-spheres, realized as adelic quotients of quaternion algebras…

We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…

We provide an index bound for character sums of polynomials over finite fields. This improves the Weil bound for high degree polynomials with small indices, as well as polynomials with large indices that are generated by cyclotomic mappings…

We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $…

We produce explicit elliptic curves over \Bbb F_p(t) whose Mordell-Weil groups have arbitrarily large rank. Our method is to prove the conjecture of Birch and Swinnerton-Dyer for these curves (or rather the Tate conjecture for related…

An efficient evaluation method is described for polynomials in finite fields. Its complexity is shown to be lower than that of standard techniques when the degree of the polynomial is large enough. Applications to the syndrome computation…

This work will appear as a chapter in a forthcoming volume titled "Topics in Probabilistic Graph Theory". A theory of scaling limits for random graphs has been developed in recent years. This theory gives access to the large-scale geometric…

We consider natural polynomial truncations of hypergeometric power series defined over finite fields. For these truncations, we establish asymptotic upper bounds of order $O(p^{11/12})$ on the number of roots in the prime field…

Given an elliptic curve $E$ over a finite field $\mathbb{F}_q$ we study the finite extensions $\mathbb{F}_{q^n}$ of $\mathbb{F}_q$ such that the number of $\mathbb{F}_{q^n}$-rational points on $E$ attains the Hasse upper bound. We obtain an…

We prove a dynamical Shafarevich theorem on the finiteness of the set of isomorphism classes of rational maps with fixed degeneracies. More precisely, fix an integer d at least 2 and let K be either a number field or the function field of a…

We give a polynomial-time algorithm for computing upper bounds on some of the smaller energy eigenvalues in a spin-1/2 ferromagnetic Heisenberg model with any graph $G$ for the underlying interactions. An important ingredient is the…

We present a variety of geometrical and combinatorial tools that are used in the study of geometric structures on surfaces: volume, contact, symplectic, complex and almost complex structures. We start with a series of local rigidity results…

To count bundles on curves, we study zetas of elliptic curves and their zeros. There are two types, i.e., the pure non-abelian zetas defined using moduli spaces of semi-stable bundles, and the group zetas defined for special linear groups.…