Related papers: Membership Problem in groups acting freely on Z^n-…
We introduce two families of examples of groups acting on trees, one consisting of group amalgamations and the other consisting of HNN-extensions, motivated by the problems of $C^*$-simplicity and unique trace property. Moreover, we prove…
We consider several subgroup-related algorithmic questions in groups, modeled after the classic computational lattice problems, and study their computational complexity. We find polynomial time solutions to problems like finding a subgroup…
We study free and compact group actions on unital C*-algebras. In particular, we provide a complete classification theory of these actions for compact Abelian groups and explain its relation to the classical classification theory of…
McCarthy's Theorem for the mapping class group of a closed hyperbolic surface states that for any two mapping classes $\sigma,\tau \in \mathrm{Mod}(S)$ there is some power $N$ such that the group $\langle \sigma^N,\tau^N\rangle$ is either…
In this paper, we study the structure of the permutability graphs of subgroups, and the permutability graphs of non-normal subgroups of the following groups: the dihedral groups $D_n$, the generalized quaternion groups $Q_n$, the…
Let T be a k-regular tree (k>2) and A its automorphism group. We analyze a generic finitely generated subgroup Gamma of A. We show that Gamma is free and establish a trichotomy on the closure of Gamma: it is either discrete, compact or has…
Besides the need for a better understanding of networks, there is a need for prescriptive models and tools to specify requirements concerning networks and their associated graph representations. We propose class-based graphs as a means to…
A random graph of free groups contains a surface subgroup
We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…
We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$…
We present algorithms for the group independent reduction of group theory factors of Feynman diagrams. We also give formulas and values for a large number of group invariants in which the group theory factors are expressed. This includes…
The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either…
We look at group actions on metric spaces, particularly at group actions on geodesic hyperbolic spaces. We classify the types of automorphisms on these spaces and prove several results about the density of the hyperbolic limit set of the…
We give an efficient algorithm to randomly generate finitely generated subgroups of a given size, in a finite rank free group. Here, the size of a subgroup is the number of vertices of its representation by a reduced graph such as can be…
We study line patterns in a free group by considering the topology of the decomposition space, a quotient of the boundary at infinity of the free group related to the line pattern. We show that the group of quasi-isometries preserving a…
We show that the freeness problems for automaton semigroups and for automaton monoids are undecidable and, thereby, solve an open problem listed by Grigorchuk, Nekrashevych and Sush\-chansk\u{\i}i. We achieve this using a new technique to…
Let Gamma be a group generated by two positive multi-twists. We give some sufficient conditions for Gamma to be free or have no `unexpectedly reducible' elements. For a group Gamma generated by two Dehn twists, we classify the elements in…
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time $O(n^4)$ whether three given vertices of a graph belong to an induced tree. Here, we study four-in-a-tree for triangle-free graphs. We give a structural answer to the…
We introduce the concept of a pants decomposition for a finitely generated free group and construct the corresponding pants graph. A pants decomposition of a free group leads to the formation of a simplicial graph, referred to as the pants…
We describe an efficient practical procedure for enumerating and regrouping vacuum Feynman graphs of a given order in perturbation theory. The method is based on a combination of Schwinger-Dyson equations and the two-particle-irreducible…