Intersections of automorphism fixed subgroups in the free group of rank three.
Martino, A. (2004)
Algebraic & Geometric Topology
Similarity:
Displaying similar documents to “The Tits alternative for . I: Dynamics of exponentially-growing automorphisms.”
Intersections of automorphism fixed subgroups in the free group of rank three.
Doubles of groups and hyperbolic LERF 3-manifolds.
Gitik, Rita (1999)
Annals of Mathematics. Second Series
Similarity:
The cube recurrence.
Carroll, Gabriel D., Speyer, David (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Maximal index automorphisms of free groups with no attracting fixed points on the boundary are Dehn twists.
Martino, Armando (2002)
Algebraic & Geometric Topology
Similarity:
Automorphisms and abstract commensurators of 2-dimensional Artin groups.
Crisp, John (2005)
Geometry & Topology
Similarity:
Almost all words are seen in critical site percolation on the triangular lattice.
Kesten, H., Sidoravicius, V., Zhang, Y. (1998)
Electronic Journal of Probability [electronic only]
Similarity:
Multicoloured Hamilton cycles.
Albert, Michael, Frieze, Alan, Reed, Bruce (1995)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Percolation of arbitrary words on the close-packed graph of .
Kesten, H., Sidoravicius, V., Zhang, Y. (2001)
Electronic Journal of Probability [electronic only]
Similarity:
On a problem of Marco Buratti.
Horak, Peter, Rosa, Alexander (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Mapping tori of free group automorphisms are coherent.
Feighn, Mark, Handel, Michael (1999)
Annals of Mathematics. Second Series
Similarity:
The classification of punctured-torus groups.
Minsky, Yair N. (1999)
Annals of Mathematics. Second Series
Similarity:
Combing Euclidean buildings.
Noskov, Gennady A. (2000)
Geometry & Topology
Similarity:
Paths through fixed vertices in edge-colored graphs
W. S. Chou, Y. Manoussakis, O. Megalakaki, M. Spyratos, Zs. Tuza (1994)
Mathématiques et Sciences Humaines
Similarity:
We study the problem of finding an alternating path having given endpoints and passing through a given set of vertices in edge-colored graphs (a path is alternating if any two consecutive edges are in different colors). In particular, we show that this problem in NP-complete for 2-edge-colored graphs. Then we give a polynomial characterization when we restrict ourselves to 2-edge-colored complete graphs. We also investigate on (s,t)-paths through fixed vertices, i.e. paths of length...