Related papers: On parabolic subgroups of Artin groups

Let $G$ be a relatively hyperbolic group that admits a decomposition into a finite graph of relatively hyperbolic groups structure with quasi-isometrically (qi) embedded condition. We prove that the set of conjugates of all the vertex and…

Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\mathbb{Z}$ into…

Artin-Tits groups act on a certain delta-hyperbolic complex, called the "additional length complex". For an element of the group, acting loxodromically on this complex is a property analogous to the property of being pseudo-Anosov for…

We define the intersection complex for the universal cover of a compact weakly special square complex and show that it is a quasi-isometry invariant. By using this quasi-isometry invariant, we study the quasi-isometric classification of…

We study the geometry and dynamics of discrete subgroups $\Gamma$ of $\PSL(3,\mathbb{C})$ with an open invariant set $\Omega \subset \PC^2$ where the action is properly discontinuous and the quotient $\Omega/\Gamma$ contains a connected…

The Sylow graph $\Gamma(G)$ of a finite group $G$ originated from recent investigations on the so--called $\mathbf{N}$--closed classes of groups. The connectivity of $\Gamma(G)$ was proved only few years ago, involving the classification of…

The commuting graph ${\Gamma(G)}$ of a group $G$ is the simple undirected graph with group elements as a vertex set and two elements $x$ and $y$ are adjacent if and only if $xy=yx$ in $G$. By eliminating the identity element of $G$ and all…

Let $\Gamma$ denote an undirected, connected, regular graph with vertex set $X$, adjacency matrix $A$, and ${d+1}$ distinct eigenvalues. Let ${\mathcal A}={\mathcal A}(\Gamma)$ denote the subalgebra of Mat$_X({\mathbb C})$ generated by $A$.…

Let $\Gamma$ be a simple undirected graph on a finite vertex set and let $A$ be its adjacency matrix. Then $\Gamma$ is {\it singular} if $A$ is singular. The problem of characterising singular graphs is easy to state but very difficult to…

We discuss various types of Tits Alternative for subgroups of graph products of groups, and prove that, under some natural conditions, a graph product of groups satisfies a given form of Tits Alternative if and only if each vertex group…

This text brings to an end the classification of non-reduced parabolic subgroups in positive characteristic, especially two and three: they are all obtained as intersections of parabolics having maximal reduced part. We prove this result…

Let $G$ be a finite abelian group and $A$ a subset of $G$. The spectrum of $A$ is the set of its large Fourier coefficients. Known combinatorial results on the structure of spectrum, such as Chang's theorem, become trivial in the regime…

The cyclic graph $\Gamma(S)$ of a semigroup $S$ is the simple graph whose vertex set is $S$ and two vertices $x, y$ are adjacent if the subsemigroup generated by $x$ and $y$ is monogenic. In this paper, we classify the semigroup $S$ such…

Bass-Serre theory provides a powerful framework for studying group actions on trees. While extremely effective for structural questions in group theory, it is less suited to the systematic construction of group actions with prescribed local…

We prove that an Artin group splits over infinite cyclic subgroups if and only if its defining graph has a separating vertex, and explicitly construct a JSJ decomposition over infinite cyclic subgroups for all Artin groups. We then use…

If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…

Let $G$ be the right-angled Artin group associated to the flag complex $\Sigma$ and let $\pi:G\to\Z$ be its canonical height function. We investigate the presentation theory of the groups $\Gamma_n=\pi^{-1}(n\Z)$ and construct an algorithm…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

The $G$-graph $\Gamma(G,S)$ is a graph from the group $G$ generated by $S\subseteq G$, where the vertices are the right cosets of the cyclic subgroups $\langle s \rangle, s\in S$ with $k$-edges between two distinct cosets if there is an…

For a non-complete graph $\Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $u\neq w$ and $u,w$ are not adjacent. Then $\Gamma$ is said to be $2$-geodesic transitive if its automorphism…