{"title":"On the lattice of subgroups of a free group: complements and rank","authors":"Jordi Delgado, Pedro V. Silva","doi":"10.46298/jgcc.2020.12.1.6059","DOIUrl":null,"url":null,"abstract":"A $\\vee$-complement of a subgroup $H \\leqslant \\mathbb{F}_n$ is a subgroup $K\n\\leqslant \\mathbb{F}_n$ such that $H \\vee K = \\mathbb{F}_n$. If we also ask $K$\nto have trivial intersection with $H$, then we say that $K$ is a\n$\\oplus$-complement of $H$. The minimum possible rank of a $\\vee$-complement\n(resp. $\\oplus$-complement) of $H$ is called the $\\vee$-corank (resp.\n$\\oplus$-corank) of $H$. We use Stallings automata to study these notions and\nthe relations between them. In particular, we characterize when complements\nexist, compute the $\\vee$-corank, and provide language-theoretical descriptions\nof the sets of cyclic complements. Finally, we prove that the two notions of\ncorank coincide on subgroups that admit cyclic complements of both kinds.\nComment: 27 pages, 5 figures","PeriodicalId":41862,"journal":{"name":"Groups Complexity Cryptology","volume":"1 1","pages":""},"PeriodicalIF":0.1000,"publicationDate":"2019-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Groups Complexity Cryptology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.46298/jgcc.2020.12.1.6059","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 4
Abstract
A $\vee$-complement of a subgroup $H \leqslant \mathbb{F}_n$ is a subgroup $K
\leqslant \mathbb{F}_n$ such that $H \vee K = \mathbb{F}_n$. If we also ask $K$
to have trivial intersection with $H$, then we say that $K$ is a
$\oplus$-complement of $H$. The minimum possible rank of a $\vee$-complement
(resp. $\oplus$-complement) of $H$ is called the $\vee$-corank (resp.
$\oplus$-corank) of $H$. We use Stallings automata to study these notions and
the relations between them. In particular, we characterize when complements
exist, compute the $\vee$-corank, and provide language-theoretical descriptions
of the sets of cyclic complements. Finally, we prove that the two notions of
corank coincide on subgroups that admit cyclic complements of both kinds.
Comment: 27 pages, 5 figures