Related papers: Strong accessibility of Coxeter groups over minima…

We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…

A group $G$ is integrable if it is isomorphic to the derived subgroup of a group $H$; that is, if $H'\simeq G$, and in this case $H$ is an integral of $G$. If $G$ is a subgroup of $U$, we say that $G$ is integrable within $U$ if $G=H'$ for…

In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…

A non-complete graph $G$ is said to be $t$-tough if for every vertex cut $S$ of $G$, the ratio of $|S|$ to the number of components of $G-S$ is at least $t$. The toughness $\tau(G)$ of the graph $G$ is the maximum value of $t$ such that $G$…

We prove that the lower central series of the cactus group associated with a non commutative Coxeter group never stabilizes. We also compute a minimal presentation in terms of generators for the cactus group associated with a finite Coxeter…

The paper investigates two invariants for totally disconnected locally compact groups: the number of ends and the rational discrete cohomological dimension. For such a compactly generated group $G$ it is shown that its number of ends can be…

A topological group $G$ is {\em extremely amenable} if every compact $G$-space has a $G$-fixed point. Let $X$ be compact and $G\subset{\mathrm{Homeo}} (X)$. We prove that the following are equivalent: (1) $G$ is extremely amenable; (2)…

We prove that a family of at least two non-trivial, almost-connected locally compact groups cannot have a coproduct in the category of locally compact groups if at least one of the groups is connected; this confirms the intuition that…

A connected graph G with at least two vertices is matching covered if each of its edges lies in a perfect matching. We say that an edge e in a matching covered graph G is removable if G-e is matching covered. A pair {e; f} of edges of a…

We lay the foundations of the first-order model theory of Coxeter groups. Firstly, with the exception of the $2$-spherical non-affine case (which we leave open), we characterize the superstable Coxeter groups of finite rank, which we show…

We prove the definability, and actually the finiteness of the commutator width, of many commutator subgroups in groups definable in o-minimal structures. It applies in particular to derived series and to lower central series of solvable…

We introduce a new quasi-isometry invariant of 2-dimensional right-angled Coxeter groups, the hypergraph index, that partitions these groups into infinitely many quasi-isometry classes, each containing infinitely many groups. Furthermore,…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

Let $\Gamma(G)$ be the Gruenberg-Kegel graph of a finite group $G$. We prove that if $G$ is solvable and $\sigma$ is a cut-set for $\Gamma(G)$, then $G$ has a $\sigma$-series of length $5$ whose factors are controlled. As a consequence, we…

Let G be a connected reductive linear algebraic group. We use geometric methods to investigate G-completely reducible subgroups of G, giving new criteria for G-complete reducibility. We show that a subgroup of G is G-completely reducible if…

We prove a decomposition of definable groups in o-minimal structures generalizing the Jordan-Chevalley decomposition of linear algebraic groups. It follows that any definable linear group G is a semidirect product of its maximal normal…

In various classes of infinite groups, we identify groups that are presentable by products, i.e. groups having finite index subgroups which are quotients of products of two commuting infinite subgroups. The classes we discuss here include…

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of $G$, they differ in exactly one vertex. Simplex graphs form…

We consider a the minimum k-way cut problem for unweighted graphs with a size bound s on the number of cut edges allowed. Thus we seek to remove as few edges as possible so as to split a graph into k components, or report that this requires…

Let $G$ be a finite group. Denoting by ${\rm{cd}}(G)$ the set of the degrees of the irreducible complex characters of $G$, we consider the {\it character degree graph} of $G$: this is the (simple, undirected) graph whose vertices are the…