Related papers: A Point Counting Algorithm for Cyclic Covers of th…
Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…
Let $(C,p_1,\ldots,p_n)$ be a general curve. We consider the problem of enumerating covers of the projective line by $C$ subject to incidence conditions at the marked points. These counts have been obtained by the first named author with…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
A generalization of the Kontsevich Airy-model allows one to compute the intersection numbers of the moduli space of p-spin curves. These models are deduced from averages of characteristic polynomials over Gaussian ensembles of random…
The Mapper algorithm is a visualization technique in topological data analysis (TDA) that outputs a graph reflecting the structure of a given dataset. However, the Mapper algorithm requires tuning several parameters in order to generate a…
We construct inductively an equivariant compactification of the algebraic group ${\mathbb W}_n$ of Witt vectors of finite length over a field of characteristic $p>0$. We obtain smooth projective rational varieties $\bar{\mathbb W}_n$,…
In a previous paper [11] we introduced a weighted binary average of two 2D point-normal pairs, termed circle average, and investigated subdivision schemes based on it. These schemes refine point-normal pairs in 2D, and converge to limit…
We propose a generalization of tropical curves by dropping the rationality and integrality requirements while preserving the balancing condition. An interpretation of such curves as critical points of a certain quadratic functional allows…
In general, algorithms for computing the Selmer group of the Jacobian of a curve have relied on either homogeneous spaces or functions on the curve. We present a theoretical analysis of algorithms which use functions on the curve, and show…
We show in this paper that the Gentry-Szydlo algorithm for cyclotomic orders, previously revisited by Lenstra-Silverberg, can be extended to complex-multiplication (CM) orders, and even to a more general structure. This algorithm allows to…
We discuss the computation of coefficients of the L-series associated to a hyperelliptic curve over Q of genus at most 3, using point counting, generic group algorithms, and p-adic methods.
Inspired by Feynman integral computations in quantum field theory, Kontsevich conjectured in 1997 that the number of points of graph hypersurfaces over a finite field $\F_q$ is a (quasi-) polynomial in $q$. Stembridge verified this for all…
Coordinate descent algorithms are popular for huge-scale optimization problems due to their low cost per-iteration. Coordinate descent methods apply to problems where the constraint set is separable across coordinates. In this paper, we…
Counts of holomorphic disks are at the heart of the SYZ approach to mirror symmetry. In the non archimedean framework, these counts are expressed as counts of analytic cylinders. In simple cases, such as cluster varieties, these counts can…
We show how the size of the Galois groups of iterates of a quadratic polynomial $f(x)$ can be parametrized by certain rational points on the curves $C_n:y^2=f^n(x)$ and their quadratic twists. To that end, we study the arithmetic of such…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
Point containment queries on trimmed surfaces are fundamental to CAD modeling, solid geometry processing, and surface tessellation. Existing approaches such as ray casting and generalized winding numbers often face limitations in robustness…
In this paper, we prove a big monodromy theorem for the monodromy of cyclic coverings of projective line for cohomology with Fp-coefficients. This is a direct generalization of the results of Achter and Pries, where such a theorem is proved…
Numerical tools for computation of $\wp$-functions, also known as Kleinian, or multiply periodic, are proposed. In this connection, computation of periods of the both first and second kinds is reconsidered. An analytical approach to…
Raynaud gave a criterion for a branched $G$-cover of curves defined over a mixed-characteristic discretely valued field $K$ with residue characteristic $p$ to have good reduction in the case of either a three-point cover of $\mathbb{P}^1$…