Related papers: A Point Counting Algorithm for Cyclic Covers of th…

In this paper, we formally introduce the concept of a row-sum matrix over an arbitrary group $G$. When $G$ is cyclic, these types of matrices have been widely used to build uniform 2-factorizations of small Cayley graphs (or, Cayley…

The NP-hard Maximum Planar Subgraph problem asks for a planar subgraph $H$ of a given graph $G$ such that $H$ has maximum edge cardinality. For more than two decades, the only known non-trivial exact algorithm was based on integer linear…

We continue the examination of the stable reduction and fields of moduli of G-Galois covers of the projective line over a complete discrete valuation field of mixed characteristic (0, p), where G has a cyclic p-Sylow subgroup P of order…

We propose new algorithms for topic modeling when the number of topics is unknown. Our approach relies on an analysis of the concentration of mass and angular geometry of the topic simplex, a convex polytope constructed by taking the convex…

Consider the smooth projective models C of curves y^2=f(x) with f(x) in Z[x] monic and separable of degree 2g+1. We prove that for g >= 3, a positive fraction of these have only one rational point, the point at infinity. We prove a lower…

We study two important operations on polynomials defined over complete discrete valuation fields: Euclidean division and factorization. In particular, we design a simple and efficient algorithm for computing slope factorizations, based on…

We take new algebraic and geometric perspectives on the old subject of SQCD. We count chiral gauge invariant operators using generating functions, or Hilbert series, derived from the plethystic programme and the Molien-Weyl formula. Using…

We obtain a formula for the degrees of the varieties parameterizing complex algebraic curves of any divisor class and genus on P^2_6, the projective plane blown-up at 6 generic points. Moreover, the formula computes the degrees of the…

We present a class of algorithms based on rational Krylov methods to compute the action of a generalized matrix function on a vector. These algorithms incorporate existing methods based on the Golub-Kahan bidiagonalization as a special…

We study extensions of the classic \emph{Line Cover} problem, which asks whether a set of $n$ points in the plane can be covered using $k$ lines. Line Cover is known to be NP-hard, and we focus on two natural generalizations. The first is…

The $k$-dimensional Weisfeiler-Leman ($k$-WL) algorithm is a simple combinatorial algorithm that was originally designed as a graph isomorphism heuristic. It naturally finds applications in Babai's quasipolynomial time isomorphism…

In the Line Cover problem a set of n points is given and the task is to cover the points using either the minimum number of lines or at most k lines. In Curve Cover, a generalization of Line Cover, the task is to cover the points using…

Special covers are metacyclic covers of the projective line, with Galois group of order pm, which have a specific type of bad reduction to characteristic p. Such covers arise in the study of the arithmetic of Galois covers of the projective…

In this paper, we consider Abelian varieties over function fields that arise as twists of Abelian varieties by cyclic covers of irreducible quasi-projective varieties. Then, in terms of Prym varieties associated to the cyclic covers, we…

We present W-cycle multigrid algorithms for the solution of the linear system of equations arising from a wide class of $hp$-version discontinuous Galerkin discretizations of elliptic problems. Starting from a classical framework in…

We present a Mordell-Weil sieve that can be used to compute points on certain bielliptic modular curves $X_0(N)$ over fixed quadratic fields. We study $X_0(N)(\mathbb{Q}(\sqrt{d}))$ for $N \in \{ 53,61,65,79,83,89,101,131 \}$ and $\lvert d…

We develop a geometric version of the circle method and use it to compute the compactly supported cohomology of the space of rational curves through a point on a smooth affine hypersurface of sufficiently low degree.

The circular coordinates algorithm, a key tool in topological data analysis, relies on a theoretically unvalidated lifting step to convert cocycles from a prime field to integer coefficients. We provide a rigorous analysis of this…

Let X be an Abelian surface and C a holomorphic curve in X representing a primitive homology class. The space of genus g curves in the class of C is g dimensional. We count the number of such curves that pass through g generic points and we…

We give new bounds for the number of integral points on elliptic curves. The method may be said to interpolate between approaches via diophantine techniques ([BP], [HBR]) and methods based on quasiorthogonality in the Mordell-Weil lattice…