Related papers: Membership Problem in groups acting freely on Z^n-…
We characterize twisted right-angled Artin groups (T-RAAGs) that are subgroup separable using only their defining mixed graphs: such a group is subgroup separable if and only if the underlying simplicial graph contains neither induced paths…
We construct an efficient model for graphs of finitely generated subgroups of free groups. Using this we give a very short proof of Dicks's reformulation of the strengthened Hanna Neumann Conjecture as the Amalgamated Graph Conjecture. In…
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 adjacent if and only if either $u=v^m$ or $v=u^n$ for…
The gathering problem requires a set of mobile agents, arbitrarily positioned at different nodes of a network to group within finite time at the same location, not fixed in advanced. The extensive existing literature on this problem shares…
Ara\'ujo, Kinyon and Konieczny (2011) pose several problems concerning the construction of arbitrary commuting graphs of semigroups. We observe that every star-free graph is the commuting graph of some semigroup. Consequently, we suggest…
Understanding the structure of a graph along with the structure of its subgraphs is important for several problems in graph theory. Two examples are the Reconstruction Conjecture and isomorph-free generation. This paper raises the question…
We find polynomial-time solutions to the word problem for free-by-cyclic groups, the word problem for automorphism groups of free groups, and the membership problem for the handlebody subgroup of the mapping class group. All of these…
A graph is called claw-free if it contains no induced subgraph isomorphic to the complete bipartite graph $K_{1, 3}$. The undirected power graph of a group $G$ has vertices the elements of $G$, with an edge between $g_1$ and $g_2$ if one of…
The paper is devoted to the problem of finding free generators in the fields of invariants for actions of unipotent groups on affine varieties. We consider the case when the unipotent group is the unipotent radical in an arbitrary parabolic…
Let $p$ be an odd prime. We construct a non-abelian extension $\Gamma$ of $S^1$ by $Z/p \times Z/p$, and prove that any finite subgroup of $\Gamma$ acts freely and smoothly on $S^{2p-1} \times S^{2p-1}$. In particular, for each odd prime…
We describe an effective procedure to compute the local subgroup zeta functions of the free class-$2$-nilpotent groups on $d$ generators, for all $d$. For $d=4$, this yields a new, explicit formula. For $d\in\{4,5\}$, we compute the…
Given a graph $\Gamma$ and a number $n$, the associated $n^{th}$ graph braid group $B_n(\Gamma)$ is the fundamental group of the unordered configuration space of $n$ points on $\Gamma$. \'{S}wi\k{a}tkowski showed that for a given $\Gamma$…
Geometric methods proposed by Stallings for treating finitely generated subgroups of free groups were successfully used to solve a wide collection of decision problems for free groups and their subgroups. It turns out that Stallings'…
We generalize the enhanced power graph by replacing elements with conjugacy classes. The main result of this paper is to determine when this graph is triangle-free.
We provide an elementary proof that subgroups of free groups are free via group actions.
We give a positive answer, in the measurable-group-theory context, to von Neumann's problem of knowing whether a non-amenable countable discrete group contains a non-cyclic free subgroup. We also get an embedding result of the free-group…
A strong clique in a graph is a clique intersecting all inclusion-maximal stable sets. Strong cliques play an important role in the study of perfect graphs. We study strong cliques in the class of diamond-free graphs, from both structural…
We start by studying the distribution of (cyclically reduced) elements of the free groups Fn with respect to their abelianization (or equivalently, their integer homology class. We derive an explicit generating function, and a limiting…
This study addresses the challenge of forming effective groups in collaborative problem-solving environments. Recognizing the complexity of human interactions and the necessity for efficient collaboration, we propose a novel approach…
We unite elements of category theory, K-theory, and geometric group theory, by defining a class of groups called $k$-cube groups, which act freely and transitively on the product of $k$ trees, for arbitrary $k$. The quotient of this action…