Related papers: Counting Tripods on the Torus
In this article we present theoretical and computational results on the existence of polyhedral embeddings of graphs. The emphasis is on cubic graphs. We also describe an efficient algorithm to compute all polyhedral embeddings of a given…
Euclidean lattices occupy a central position in number theory, the geometry of numbers, and modern cryptography. In the present article, the theory of Euclidean lattices is employed to investigate normed $\mathbb{Z}$-modules of finite rank.…
We consider asymptotics of certain BPS state counts in M-theory compactified on a K3 surface. Our investigation is parallel to (and was inspired by) recent work in the mathematics literature by Filip, who studied the asymptotic count of…
We define and count lattice points in the moduli space of stable genus g curves with n labeled points. This extends a construction of the second author for the uncompactified moduli space. The enumeration produces polynomials with top…
Estimating the number of triangles in a graph is one of the most fundamental problems in sublinear algorithms. In this work, we provide an algorithm that approximately counts the number of triangles in a graph using only polylogarithmic…
Building on work of Kapouleas and Yang, we construct sequences of minimal surfaces embedded in the round 3-sphere which converge to the Clifford torus counted with multiplicity two and have second fundamental form blowing up at every point…
A fast algorithm for counting intersections of two normal curves on a triangulated surface is proposed. It yields a convenient way for treating mapping class groups of punctured surfaces by presenting mapping classes by matrices, and the…
This article reports on an approach to point counting on algebraic varieties over finite fields that is based on a detailed investigation of the $2$-adic orthogonal group. Combining the new approach with a $p$-adic method, we count the…
We prove several rigorous results about the asymptotic behaviour of the numbers of tadpoles (or lassos) embedded in a lattice, including cases where the head is subject to a constraint like being unknotted, or where the tail pierces the…
We study counting limit laws that compare length functions on infinite graphs. We then apply these results to flat surfaces to obtain a statistical comparison between the geometric length and the number of singularities visited by geodesic…
We consider the natural problem of counting isotopy classes of essential surfaces in 3-manifolds, focusing on closed essential surfaces in a broad class of hyperbolic 3-manifolds. Our main result is that the count of (possibly disconnected)…
The arithmetic of elliptic curves, namely polynomial addition and scalar multiplication, can be described in terms of global sections of line bundles on $E\times E$ and $E$, respectively, with respect to a given projective embedding of $E$…
The study of (minimally) rigid graphs is motivated by numerous applications, mostly in robotics and bioinformatics. A major open problem concerns the number of embeddings of such graphs, up to rigid motions, in Euclidean space. We capture…
We report on the implementation of an algorithm for computing the set of all regular triangulations of finitely many points in Euclidean space. This algorithm, which we call down-flip reverse search, can be restricted, e.g., to computing…
To every 3-manifold M one can associate a two-dimensional N=(2,2) supersymmetric field theory by compactifying five-dimensional N=2 super-Yang-Mills theory on M. This system naturally appears in the study of half-BPS surface operators in…
The theory of coverings of the two-dimensional torus is a standard part of algebraic topology and has applications in several topics in string theory, for example, in topological strings. This paper initiates applications of this theory to…
Constructions and exploration of plane algebraic curves has received a new push with the development of automated methods, whose algorithms are continuously improved and implemented in various software packages. We use them to explore the…
Triangle counting is an important problem in graph mining. Clustering coefficients of vertices and the transitivity ratio of the graph are two metrics often used in complex network analysis. Furthermore, triangles have been used…
We show that for almost every translation surface the number of pairs of saddle connections with bounded magnitude of the cross product has asymptotic growth like $c R^2$ where the constant $c$ depends only on the area and the connected…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…