1996
DOI: 10.1090/memo/0582
|View full text |Cite
|
Sign up to set email alerts
|

Symmetric automorphisms of free products

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
99
0
3

Year Published

2001
2001
2022
2022

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 35 publications
(103 citation statements)
references
References 0 publications
1
99
0
3
Order By: Relevance
“…For each i, choose a λ i ∈ G i − {1}. Let P(J 0 ) be the Whitehead poset constructed in [10]. Elements of P(J 0 ) correspond to labelled bipartite trees, where the n + 1 labels come from the set { * , G 1 , .…”
Section: Preliminariesmentioning
confidence: 99%
See 4 more Smart Citations
“…For each i, choose a λ i ∈ G i − {1}. Let P(J 0 ) be the Whitehead poset constructed in [10]. Elements of P(J 0 ) correspond to labelled bipartite trees, where the n + 1 labels come from the set { * , G 1 , .…”
Section: Preliminariesmentioning
confidence: 99%
“…The poset structure in P(J 0 ) comes from an operation called folding (when the elements are thought of as labelled trees) or by setting A(k) ≤ B(k) if elements of A(k) are unions of elements of B(k). See McCullough and Miller [10] for more details.…”
Section: Preliminariesmentioning
confidence: 99%
See 3 more Smart Citations