Abstract
A -complement of a subgroup is a subgroup such that . If we also ask to have trivial intersection with , then we say that is a -complement of . The minimum possible rank of a -complement (resp. -complement) of is called the -corank (resp. -corank) of . We use Stallings automata to study these notions and the relations between them. In particular, we characterize when complements exist, compute the -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.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.