An official website of the United States government
Abstract For a pseudo-Anosov flow $$\varphi $$ without perfect fits on a closed $$3$$ -manifold, Agol–Guéritaud produce a veering triangulation $$\tau $$ on the manifold M obtained by deleting the singular orbits of $$\varphi $$ . We show that $$\tau $$ can be realized in M so that its 2-skeleton is positively transverse to $$\varphi $$ , and that the combinatorially defined flow graph $$\Phi $$ embedded in M uniformly codes the orbits of $$\varphi $$ in a precise sense. Together with these facts, we use a modified version of the veering polynomial, previously introduced by the authors, to compute the growth rates of the closed orbits of $$\varphi $$ after cutting M along certain transverse surfaces, thereby generalizing the work of McMullen in the fibered setting. These results are new even in the case where the transverse surface represents a class in the boundary of a fibered cone of M . Our work can be used to study the flow $$\varphi $$ on the original closed manifold. Applications include counting growth rates of closed orbits after cutting along closed transverse surfaces, defining a continuous, convex entropy function on the ‘positive’ cone in $H^1$ of the cut-open manifold, and answering a question of Leininger about the closure of the set of all stretch factors arising as monodromies within a single fibered cone of a $$3$$ -manifold. This last application connects to the study of endperiodic automorphisms of infinite-type surfaces and the growth rates of their periodic points.
more »
« less
From loom spaces to veering triangulations
We introduce loom spaces, a generalisation of both the leaf spaces associated to pseudo- Anosov flows and the link spaces associated to veering triangulations. Following work of Guéritaud, we prove that there is a locally veering triangulation canonically associated to every loom space, and that the realisation of this triangulation is homeomorphic to R^3.
more »
« less
- Award ID(s):
- 2203993
- PAR ID:
- 10511535
- Publisher / Repository:
- EMS Press
- Date Published:
- Journal Name:
- Groups, Geometry, and Dynamics
- Volume:
- 18
- Issue:
- 2
- ISSN:
- 1661-7207
- Page Range / eLocation ID:
- 419 to 462
- Subject(s) / Keyword(s):
- veering triangulations pseudo-Anosov flows loom spaces astroid lemma
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
In the face of rising population, erratic climate, resource depletion, and increased exposure to natural hazards, environmental monitoring is increasingly important. Satellite data form most of our observations of Earth. On-the-ground observations based on in situ sensor systems are crucial for these remote measurements to be dependable. Providing open-source options to rapidly prototype environmental datalogging systems allows quick advancement of research and monitoring programs. This paper introduces Loom, a development environment for low-power Arduino-programmable microcontrollers. Loom accommodates a range of integrated components including sensors, various datalogging formats, internet connectivity (including Wi-Fi and 4G Long Term Evolution (LTE)), radio telemetry, timing mechanisms, debugging information, and power conservation functions. Additionally, Loom includes unique applications for science, technology, engineering, and mathematics (STEM) education. By establishing modular, reconfigurable, and extensible functionality across components, Loom reduces development time for prototyping new systems. Bug fixes and optimizations achieved in one project benefit all projects that use Loom, enhancing efficiency. Although not a one-size-fits-all solution, this approach has empowered a small group of developers to support larger multidisciplinary teams designing diverse environmental sensing applications for water, soil, atmosphere, agriculture, environmental hazards, scientific monitoring, and education. This paper not only outlines the system design but also discusses alternative approaches explored and key decision points in Loom’s development.more » « less
-
Our work aims to increase the collaborative ability of college students in computer science classrooms where students must work towards a shared goal with peers from different backgrounds and abilities. Our work focuses specifically on leveraging high-quality collaborative design to bridge the gap between fiber arts and robotics by enlightening students to their shared foundations in mathematics and computational thinking. We achieve this goal through the design of SPEERLoom (Semi-automated Pattern Executing Educational Robotic Loom), a new open-source Jacquard loom kit designed to foster students' exploration of weaving, mechatronics, mathematics, and computational thinking. In this demonstration we present SPEERLoom and allow the exploration of a sample lesson using the loom.more » « less
-
A new algorithm is presented to compute nonrigid, possibly partial comparisons of shapes defined by unstructured triangulations of their surfaces. The algorithm takes as input a pair of surfaces with each surface given by a distinct and unrelated triangulation. Its goal is to define a possibly partial correspondence between the vertices of the two triangulations, with a cost associated with this correspondence that can serve as a measure of the similarity of the two shapes. To find this correspondence, the vertices in each triangulation are characterized by a signature vector of features. We tested both the LD-SIFT signatures, based on the concept of spin images, and the wave kernel signatures obtained by solving the Shrödinger equation on the triangulation. A cost matrix C is constructed such that C(k,l) is the norm of the difference of the signature vectors of vertices k and l. The correspondence between the triangulations is then computed as the transport plan that solves the optimal transport or optimal partial transport problem between their sets of vertices. We use a statistical physics approach to solve these problems. The presentation of the proposed algorithm is complemented with examples that illustrate its effectiveness and manageable computing cost.more » « less
-
Let $$G$$ be a graph with vertex set $$\{1,2,\ldots,n\}$$. Its bond lattice, $BL(G)$, is a sublattice of the set partition lattice. The elements of $BL(G)$ are the set partitions whose blocks induce connected subgraphs of $$G$$. In this article, we consider graphs $$G$$ whose bond lattice consists only of noncrossing partitions. We define a family of graphs, called triangulation graphs, with this property and show that any two produce isomorphic bond lattices. We then look at the enumeration of the maximal chains in the bond lattices of triangulation graphs. Stanley's map from maximal chains in the noncrossing partition lattice to parking functions was our motivation. We find the restriction of his map to the bond lattice of certain subgraphs of triangulation graphs. Finally, we show the number of maximal chains in the bond lattice of a triangulation graph is the number of ordered cycle decompositions.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Journal Article:
- https://doi.org/10.4171/GGD/742
