English
Related papers

Related papers: A note on test elements for monomorphisms of free …

200 papers

We give a characterisation of quantum automorphism groups of trees. In particular, for every tree, we show how to iteratively construct its quantum automorphism group using free products and free wreath products. This can be considered a…

Quantum Algebra · Mathematics 2023-11-09 Josse van Dobben de Bruyn , Prem Nigam Kar , David E. Roberson , Simon Schmidt , Peter Zeman

Working in the soft-element (classical) viewpoint, we introduce \emph{soft bitopological groups}: soft groups endowed with two soft topologies such that the induced topologies on the set of soft elements make the soft-element group into a…

General Topology · Mathematics 2026-02-16 S. Ray

The Whitehead Model of free groups can be used to measure the complexity, or degree, of automorphisms of free groups. The bound for the degree of the $f \circ g$ for deg$(f) =$ deg($g) = 0$ had previously been discovered. We extend this…

Group Theory · Mathematics 2023-05-16 Robert Rust

An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…

Data Structures and Algorithms · Computer Science 2007-05-23 Moshe Schwartz

Let $H$ be a torsion-free $\delta$-hyperbolic group with respect to a finite generating set $S$. Let $a_1,..., a_n$ and $a_{1*},..., a_{n*}$ be elements of $H$ such that $a_{i*}$ is conjugate to $a_i$ for each $i=1,..., n$. Then, there is a…

Group Theory · Mathematics 2010-02-24 O. Bogopolski , E. Ventura

Let A be a regular domain of dimension d containing an infinite field and let n be an integer with 2n\geq d+3. For a stably free A-module P of rank n, we prove that (i) P has a unimodular element if and only if the euler class of P is zero…

Commutative Algebra · Mathematics 2010-06-16 Manoj K Keshari

Factors $\frac{X}{Y}$ in a free group $F$ with $Y$ normal in $X$ are considered. Precise results on the free structure of ${Y}$ relative to the free structure of ${X}$ when $\frac{X}{Y}$ is abelian are obtained. Some extensions and…

Group Theory · Mathematics 2009-07-14 Ted Hurley

We describe an algorithm that uses Stallings' folding technique to decompose an element of $Aut(F_n)$ as a product of Whitehead automorphisms (and hence as a product of Nielsen transformations.) We use this to give an alternative method of…

Group Theory · Mathematics 2014-06-27 Richard D. Wade

A combinatorial summation identity over the lattice of labelled hypertrees is established that allows one to gain concrete information on the Euler characteristics of various automorphism groups of free products of groups.

Group Theory · Mathematics 2007-05-23 Craig Jensen , Jon McCammond , John Meier

By a map we mean a $2$-cell decomposition of a closed compact surface, i.e., an embedding of a graph such that every face is homeomorphic to an open disc. Automorphism of a map can be thought of as a permutation of the vertices which…

Combinatorics · Mathematics 2021-01-08 Ken-ichi Kawarabayashi , Bojan Mohar , Roman Nedela , Peter Zeman

This paper studies when a pair of elements in F are the images of the standard generators of F under a self monomorphism.

Group Theory · Mathematics 2009-12-04 Bronlyn Wassink

We associate each endomorphism of a finite cyclic group with a digraph and study many properties of this digraph, including its adjacent matrix and automorphism group.

Combinatorics · Mathematics 2011-08-16 Min Sha

We consider the question of when the dual of a Whitehead group is a test group for Whitehead groups. This turns out to be equivalent to the question of when the tensor product of two Whitehead groups is Whitehead. We investigate what…

Logic · Mathematics 2007-05-23 Paul C. Eklof , Laszlo Fuchs , Saharon Shelah

We give an algorithm that, for every fixed k, decides isomorphism of graphs of rank width at most k in polynomial time. As the clique width of a graph is bounded in terms of its rank width, we also obtain a polynomial time isomorphism test…

Discrete Mathematics · Computer Science 2015-05-15 Martin Grohe , Pascal Schweitzer

The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…

Group Theory · Mathematics 2015-05-07 A. Grishkov , D. Rasskazova , M. Rasskazova , I. Stuhl

We give a presentation by generators and relations of a certain monoid generating a subgroup of index two in the group Aut(F_2) of automorphisms of the rank two free group F_2 and show that it can be realized as a monoid in the group B_4 of…

Group Theory · Mathematics 2010-03-25 Christian Kassel , Christophe Reutenauer

In this paper, we continue our study of the class of diagram groups. Simply speaking, a diagram is a labelled plane graph bounded by a pair of paths (the top path and the bottom path). To multiply two diagrams, one simply identifies the top…

Group Theory · Mathematics 2007-05-23 Victor Guba , Mark Sapir

Let $F$ be a finitely generated free group. By using Bestvina-Handel theory, as well as some further improvements, the eigengroups of a given automorphism of $F$ (and its fixed subgroup among them) are globally analyzed and described. In…

Group Theory · Mathematics 2007-05-23 A. Martino , E. Ventura

We give formulae for a module presentation of the module of identities among relations for a presentation of a group, in terms of information on 0- and 1-combings of the Cayley graph. This is seen as a special case of extending a partial…

Group Theory · Mathematics 2007-05-23 Ronald Brown , A. Razak Salleh

This is a biased survey for the Johnson homomorphisms of the automorphism groups of free groups. We just exposit some well known facts and recent developments for the Johnson homomorphisms and its related topics.

Algebraic Topology · Mathematics 2013-06-11 Takao Satoh