skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Counting pairs of saddle connections
We show that for almost every translation surface the number of pairs of saddle connections with bounded virtual area has asymptotic growth like cR^2 where the constant c depends only on the area and the connected component of the stratum. The proof techniques combine classical results for counting saddle connections with the crucial result that the Siegel-Veech transform is in L^2. In order to capture information about pairs of saddle connections, we consider pairs with bounded virtual area since the set of such pairs can be approximated by a fibered set which is equivariant under geodesic flow. In the case of lattice surfaces, small virtual area is equivalent to counting parallel pairs of saddle connections, which also have a quadratic growth of cR^2 where c depends in this case on the given lattice surface.  more » « less
Award ID(s):
2003528
PAR ID:
10514597
Author(s) / Creator(s):
; ;
Publisher / Repository:
Elsevier
Date Published:
Journal Name:
Advances in Mathematics
Volume:
431
Issue:
C
ISSN:
0001-8708
Page Range / eLocation ID:
109233
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, Geometriae Dedicata)
    Abstract A translation surface is given by polygons in the plane, with sides identified by translations to create a closed Riemann surface with a flat structure away from finitely many singular points. Understanding geodesic flow on a surface involves understanding saddle connections. Saddle connections are the geodesics starting and ending at these singular points and are associated to a discrete subset of the plane. To measure the behavior of saddle connections of length at mostR, we obtain precise decay rates as$$R\rightarrow \infty $$ R → ∞ for the difference in angle between two almost horizontal saddle connections. 
    more » « less
  2. ; ; ; ; ; ; ; ; (, 2D Materials)
    Abstract Chemical vapor deposition growth of metal carbides is of great interest as this method provides large area growth of MXenes. This growth is mainly done using a melted diffusion based process; however, different morphologies in growth process is not well understood. In this work, we report deterministic synthesis of layered (non-uniform c -axis growth) and planar (uniform c -axis growth) of molybdenum carbide (Mo 2 C) using a diffusion-mediated growth. Mo-diffusion limited growth mechanism is proposed where the competition between Mo and C adatoms determines the morphology of grown crystals. Difference in thickness of catalyst at the edge and center lead to enhanced Mo diffusion which plays a vital role in determining the structure of Mo 2 C. The layered structures exhibit an expansion in the lattice confirmed by the presence of strain. Density functional theory shows consistent presence of strain which is dependent upon Mo diffusion during growth. This work demonstrates the importance of precise control of diffusion through the catalyst in determining the structure of Mo 2 C and contributes to broader understanding of metal diffusion in growth of MXenes. 
    more » « less
  3. ; (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Censor-Hillel, Keren; Grandoni, Fabrizio; Ouaknine, Joel; Puppis, Gabriele (Ed.)
    We study the classic problem of subgraph counting, where we wish to determine the number of occurrences of a fixed pattern graph H in an input graph G of n vertices. Our focus is on bounded degeneracy inputs, a rich family of graph classes that also characterizes real-world massive networks. Building on the seminal techniques introduced by Chiba-Nishizeki (SICOMP 1985), a recent line of work has built subgraph counting algorithms for bounded degeneracy graphs. Assuming fine-grained complexity conjectures, there is a complete characterization of patterns H for which linear time subgraph counting is possible. For every r ≥ 6, there exists an H with r vertices that cannot be counted in linear time. In this paper, we initiate a study of subquadratic algorithms for subgraph counting on bounded degeneracy graphs. We prove that when H has at most 9 vertices, subgraph counting can be done in Õ(n^{5/3}) time. As a secondary result, we give improved algorithms for counting cycles of length at most 10. Previously, no subquadratic algorithms were known for the above problems on bounded degeneracy graphs. Our main conceptual contribution is a framework that reduces subgraph counting in bounded degeneracy graphs to counting smaller hypergraphs in arbitrary graphs. We believe that our results will help build a general theory of subgraph counting for bounded degeneracy graphs. 
    more » « less
  4. ; (, Journal of Applied Probability)
    Abstract Gaussian random polytopes have received a lot of attention, especially in the case where the dimension is fixed and the number of points goes to infinity. Our focus is on the less-studied case where the dimension goes to infinity and the number of points is proportional to the dimensiond. We study several natural quantities associated with Gaussian random polytopes in this setting. First, we show that the expected number of facets is equal to$$C(\alpha)^{d+o(d)}$$, where$$C(\alpha)$$is some constant which depends on the constant of proportionality$$\alpha$$. We also extend this result to the expected number ofk-facets. We then consider the more difficult problem of the asymptotics of the expected number of pairs ofestranged facetsof a Gaussian random polytope. When the number of points is 2d, we determine the constantCsuch that the expected number of pairs of estranged facets is equal to$$C^{d+o(d)}$$. 
    more » « less
  5. ; ; (, Algebraic & Geometric Topology)
    The slope gap distribution of a translation surface is a measure of how random the directions of the saddle connections on the surface are. It is known that Veech surfaces, a highly symmetric type of translation surface, have gap distributions that are piecewise real analytic. Beyond that, however, very little is currently known about the general behavior of the slope gap distribution, including the number of points of non-analyticity or the tail. We show that the limiting gap distribution of slopes of saddle connections on a Veech translation surface is always piecewise real-analytic with finitely many points of non-analyticity. We do so by taking an explicit parameterization of a Poincaré section to the horocycle flow on SL(2,R)/SL(X,ω) associated to an arbitrary Veech surface SL(X,ω) and establishing a key finiteness result for the first return map under this flow. We use the finiteness result to show that the tail of the slope gap distribution of Veech surfaces always has quadratic decay. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email