English
Related papers

Related papers: Big Free Groups are Almost Free

200 papers

This paper deals with graph automaton groups associated with trees and some generalizations. We start by showing some algebraic properties of tree automaton groups. Then we characterize the associated semigroup, proving that it is…

Group Theory · Mathematics 2023-04-10 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno , Emanuele Rodaro

We use topological methods to study the maximal subgroups of the free idempotent generated semigroup on a biordered set. We use these to give an example of a free idempotent generated semigroup with maximal subgroup isomorphic to the free…

Group Theory · Mathematics 2008-08-14 Mark Brittenham , Stuart W. Margolis , John Meakin

Given a set $F$ of words, one associates to each word $w$ in $F$ an undirected graph, called its extension graph, and which describes the possible extensions of $w$ on the left and on the right. We investigate the family of sets of words…

Groups of almost upper triangular infinite matrices with entries indexed by integers are studied. It is shown that, when the matrices are over a finite field, these groups admit a nondiscrete totally disconnected, locally compact group…

Group Theory · Mathematics 2019-12-17 Peter Groenhout , Colin D. Reid , George A. Willis

Let $F_n$ be the free group of a finite rank $n$. We study orbits $Orb_{\phi}(u)$, where $u$ is an element of the group $F_n$, under the action of an automorphism $\phi$. If an orbit like that is finite, we determine precisely what its…

Group Theory · Mathematics 2007-05-23 Alexei G. Myasnikov , Vladimir Shpilrain

The process of replacing an arbitrary Boolean function by a bijective one, a fundamental tool in reversible computing and in cryptography, is interpreted algebraically as a particular instance of a certain group homomorphism from the X-fold…

Category Theory · Mathematics 2022-08-25 Laurent Poinsot , Hans-E Porst

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

History and Overview · Mathematics 2024-07-18 Sergey Kurapov , Maxim Davidovsky

It has been shown by Lubotzky in [10] that the set of verbal images of a fixed non-abelian finite simple group G is precisely the set of endomorphism invariant subsets of G. Here we use his result to determine the verbal images of certain…

Group Theory · Mathematics 2013-02-04 Matthew Levy

Affine difference algebraic groups are a generalization of affine algebraic groups obtained by replacing algebraic equations with algebraic difference equations. We show that the isomorphism theorems from abstract group theory have…

Algebraic Geometry · Mathematics 2020-07-16 Michael Wibmer

We consider the class of groups whose word problem is poly-context-free; that is, an intersection of finitely many context-free languages. We show that any group which is virtually a finitely generated subgroup of a direct product of free…

Group Theory · Mathematics 2015-10-09 Tara Brough

We give new characterizations of sofic groups: -- A group $G$ is sofic if and only if it is a subgroup of a quotient of a direct product of alternating or symmetric groups. -- A group $G$ is sofic if and only if any system of equations…

Group Theory · Mathematics 2017-01-19 Lev Glebsky

We investigate which free constructions (amalgamated products and HNN-extensions) over word hyperbolic groups produce groups that are again word hyperbolic. A complete answer is obtained for the case when the amalgamated subgroups are…

Group Theory · Mathematics 2008-02-03 Olga Kharlampovich , Alexey Myasnikov

Let G be a group and let k be a cardinal. A subset A of G is called left (right) k-large if there exists a subset F of G such that |F| < { and G = FA (G = AF). We say that A is k-large if A is left and right k-large. It is known that every…

Group Theory · Mathematics 2014-08-26 Igor Protasov , Sergii Slobodianiuk

We present new results regarding automatic continuity, unifying some diagonalization concepts that have been developed over the years. For example, any homomorphism from a completely metrizable topological group to Thompson's group $F$ has…

Group Theory · Mathematics 2019-08-13 Gregory R. Conner , Samuel M. Corson

Let T be a d-regular tree (d > 2) and A=Aut(T), its automorphism group. Let G be a group generated by n independent Haar-random elements of A. We show that almost surely, every nontrivial element of G has finitely many fixed points on T.

Group Theory · Mathematics 2008-10-10 Miklos Abert , Yair Glasner

In this paper, we mainly discuss some generalized metric properties and the character of the free paratopological groups, and extend several results valid for free topological groups to free paratopological groups.

General Topology · Mathematics 2013-02-19 Fucai Lin

We study the algebraic entropy of continuous endomorphisms of compactly covered, locally compact, topologically quasihamiltonian groups. We provide a Limit-free formula which helps us to simplify the computations of this entropy. Moreover,…

Dynamical Systems · Mathematics 2019-05-08 Wenfei Xi , Menachem Shlossberg , Daniele Toller

We continue in this paper the study of locally minimal groups started in \cite{LocMin}. The minimality criterion for dense subgroups of compact groups is extended to local minimality. Using this criterion we characterize the compact abelian…

General Topology · Mathematics 2010-06-29 Lydia Aussenhofer , María Jesús Chasco , Dikran Dikranjan , Xabier Domínguez

This is a selection of open problems dealing with ``large'' (non locally compact) topological groups and concerning extreme amenability (fixed point on compacta property), oscillation stability, universal minimal flows and other aspects of…

General Topology · Mathematics 2007-09-03 Vladimir Pestov

In this paper we investigate the word problem of the free Burnside semigroup satisfying x^2=x^3 and having two generators. Elements of this semigroup are classes of equivalent words. A natural way to solve the word problem is to select a…

Formal Languages and Automata Theory · Computer Science 2011-02-22 A. N. Plyushchenko , A. M. Shur