Related papers: Counting Tripods on the Torus
To a closed braid in a solid torus we associate a trace graph in a thickened torus in such a way that closed braids are isotopic if and only if their trace graphs can be related by trihedral and tetraherdal moves. For closed braids with a…
Asymptotics are given for the number of rational points in the domain of a morphism of weighted projective stacks whose images have bounded height and satisfy a (possibly infinite) set of local conditions. As a consequence we obtain results…
For real projective spaces, (a) the Euclidean immersion dimension, (b) the existence of axial maps, and (c) the topological complexity are known to be three facets of the same problem. But when it comes to embedding dimension, the classical…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
We reduce the problem of counting self-avoiding walks in the square lattice to a problem of counting the number of integral points in multidimensional domains. We obtain an asymptotic estimate of the number of self-avoiding walks of length…
We consider geodesic nets (critical points of a length functional on the space of embedded graphs) on doubled polygons (topological 2-spheres endowed with a flat metric away from finitely many cone singularities). We use the theorem of…
We derive a sharp cusp count for finite volume complex hyperbolic surfaces which admit smooth toroidal compactifications. We use this result, and the techniques developed in [DiC12], to study the geometry of cusped complex hyperbolic…
We provide a simple and efficient algorithm for computing the Euclidean projection of a point onto the capped simplex---a simplex with an additional uniform bound on each coordinate---together with an elementary proof. Both the MATLAB and…
Abelian orbifolds of C^3 are known to be encoded by hexagonal brane tilings. To date it is not known how to count all such orbifolds. We fill this gap by employing number theoretic techniques from crystallography, and by making use of…
The problem of finding the number of lattice points in a triangle has a classical solution if the lattice is $\mathbf{Z}^2$ and the vertices of the triangle have integer valued coordinates. We consider what happens when we replace the…
We perform a refined count of BPS states in the compactification of M-theory on $K3 \times T^2$, keeping track of the information provided by both the $SU(2)_L$ and $SU(2)_R$ angular momenta in the $SO(4)$ little group. Mathematically, this…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
A peculiarity of the geometry of the euclidean 3-sphere $\S3$ is that it allows for the existence of compact without boundary minimally immersed surfaces. Despite a wealthy of examples of such surfaces, the only known tori minimally…
We prove a quantitative estimate with a power saving error term for the number of filling closed geodesics of a given topological type and length $\leq L$ on an arbitrary closed, orientable, negatively curved surface. More generally, we…
Using a quadratic version of the Bott residue theorem, we give a quadratic refinement of the count of twisted cubic curves on hypersurfaces and complete intersections in a projective space.
We count the number of lattice paths lying under a cyclically shifting piecewise linear boundary of varying slope. Our main result extends well known enumerative formulae concerning lattice paths, and its derivation involves a classical…
We study the asymptotic behavior of the number of paths of length $N$ on several classes of infinite graphs with a single special vertex. This vertex can work as an entropic trap for the path, i.e. under certain conditions the dominant part…
This paper develops asymptotic methods to count faces of random high-dimensional polytopes. Beyond its intrinsic interest, our conclusions have surprising implications - in statistics, probability, information theory, and signal processing…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
The problem of map enumeration concerns counting connected spatial graphs, with a specified number $j$ of vertices, that can be embedded in a compact surface of genus $g$ in such a way that its complement yields a cellular decomposition of…