Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1406.5460

A generating set for the palindromic Torelli group

Neil J. Fullarton
View original source ↗Read source document ↗Export metadata ↓

Abstract

A palindrome in a free group F_n is a word on some fixed free basis of F_n that reads the same backwards as forwards. The palindromic automorphism group ΠA_n of the free group F_n consists of automorphisms that take each member of some fixed free basis of F_n to a palindrome; the group ΠA_n has close connections with hyperelliptic mapping class groups, braid groups, congruence subgroups of GL(n,Z), and symmetric automorphisms of free groups. We obtain a generating set for the subgroup of ΠA_n consisting of those elements acting trivially on the abelianisation of F_n, the palindromic Torelli group PI_n. The group PI_n is a free group analogue of the hyperelliptic Torelli subgroup of the mapping class group of an oriented surface. We obtain our generating set by constructing a simplicial complex on which PI_n acts in a nice manner, adapting a proof of Day-Putman. The generating set leads to a finite presentation of the principal level 2 congruence subgroup of GL(n,Z).

Explore related subjects

math.GTmath.GR

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Neil J. Fullarton. 2015-10-05. A generating set for the palindromic Torelli group. https://doi.org/10.2140/agt.2015.15.3535

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Word Length Formulae, Normal Forms, Conjugation and Root-finding Algorithms in Surface Groups

In this paper, we mainly study the following symmetric presentation of the surface group $$π_1(Σ_g)=\left\langle c_1,\dots, c_{2g}\mid c_1\cdots c_{2g}c_1^{-1}\cdots c_{2g}^{-1}\right\rangle.$$ For every nontrivial element $x\in π_1(Σ_g)$ and $k\geq 2$, we obtain a uniform representative of the normal forms $\mathfrak{nf}(x^k)$ of $x^k$ under the length-lexicographical order: $$\mathfrak{nf}(x^k) = \overline{LW^{k-2}R}.$$ Building on this result, we establish a new relation among these normal forms, and then derive the following three formulae related to the word length: $|x^2|>|x|$; $|x^k|=(k-1)(|x^2|-|x|)+|x|$; $\lim_{k\to\infty}\frac{|x^k|}{k}=|x^2|-|x|$. Furthermore, we extend these results to obtain a coarser analogue for every minimal geometric presentation. We then define normal forms of conjugacy classes in $π_1(Σ_g)$ and provide a criterion for determining the conjugacy of group elements. As a consequence, we provide efficient algorithms for solving the root-finding and conjugacy problems. Finally, we present applications to the computation of several growth rates.

math.GT↗
arXiv2026

Plane separating continua inscribe rectangles

We prove the following: If $X$ is a plane separating continuum, then every embedding of $X$ into $\mathbb{R}^2$ contains the vertices of a Euclidean rectangle. We arrive to this result by extending a known result by H. Vaughan for Jordan curves to a wider class of topological objects via shape theory and Steenrod homology.

math.GT↗
arXiv2026

Every Link Has Infinitely Many Explicit Generalised T-Link Presentations

Generalised $T$-links provide a simple description of all links in $S^3$ as closures of products of standard twisting blocks, parametrised by finite sequences of integers. We prove that every link admits infinitely many pairwise distinct generalised $T$-link presentations. Starting from any such presentation, we give explicit parameter transformations that preserve the represented link and generate families of pairwise distinct presentations depending on arbitrarily many independent integer parameters.

math.GT↗