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.


Title: Surface groups, infinite generating sets, and stable commutator length
Abstract We give a new proof of a theorem of D. Calegari that says that the Cayley graph of a surface group with respect to any generating set lying in finitely many mapping class group orbits has infinite diameter. This applies, for instance, to the generating set consisting of all simple closed curves.  more » « less
Award ID(s):
1811941 1811322
PAR ID:
10154652
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Proceedings of the Royal Society of Edinburgh: Section A Mathematics
ISSN:
0308-2105
Page Range / eLocation ID:
1 to 8
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. null (Ed.)
    We introduce the package PhylogeneticTrees for Macaulay2, which allows users to compute phylogenetic invariants for group-based tree models. We provide some background information on phylogenetic algebraic geometry and show how the package PhylogeneticTrees can be used to calculate a generating set for a phylogenetic ideal as well as a lower bound for its dimension. Finally, we show how methods within the package can be used to compute a generating set for the join of any two ideals. 
    more » « less
  2. Abstract A group is said to have rational growth with respect to a generating set if the growth series is a rational function. It was shown by Parry that certain torus bundle groups of even trace exhibits rational growth. We generalize this result to a class of torus bundle groups with odd trace. 
    more » « less
  3. The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of the most impressive instances of the cyclic sieving phenomenon is a theorem of Rhoades asserting that the set of plane partitions in a rectangular box under the action of promotion exhibits cyclic sieving. In Rhoades's result the sieving polynomial is the size generating function for these plane partitions, which has a well-known product formula due to MacMahon. We extend Rhoades's result by also considering symmetries of plane partitions: specifically, complementation and transposition. The relevant polynomial here is the size generating function for symmetric plane partitions, whose product formula was conjectured by MacMahon and proved by Andrews and Macdonald. Finally, we explain how these symmetry results also apply to the rowmotion operator on plane partitions, which is closely related to promotion. 
    more » « less
  4. Abstract A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial invariants on the space of barcodes. A partial order can be defined on these multipermutations, resulting in a class of posets known as combinatorial barcode lattices. In this paper, we provide a number of equivalent definitions for the combinatorial barcode lattice, show that its Möbius function is a restriction of the Möbius function of the symmetric group under the weak Bruhat order, and show its ground set is the Jordan-Hölder set of a labeled poset. Furthermore, we obtain formulas for the number of join-irreducible elements, the rank-generating function, and the number of maximal chains of combinatorial barcode lattices. Lastly, we make connections between intervals in the combinatorial barcode lattice and certain classes of matchings. 
    more » « less
  5. We show that all versions of Heegaard Floer homology, link Floer homology, and sutured Floer homology are natural. That is, they assign concrete groups to each based 3-manifold, based link, and balanced sutured manifold, respectively. Furthermore, we functorially assign isomorphisms to (based) diffeomorphisms, and show that this assignment is isotopy invariant. The proof relies on finding a simple generating set for the fundamental group of the “space of Heegaard diagrams,” and then showing that Heegaard Floer homology has no monodromy around these generators. In fact, this allows us to give sufficient conditions for an arbitrary invariant of multi-pointed Heegaard diagrams to descend to a natural invariant of 3-manifolds, links, or sutured manifolds. 
    more » « less