English
Related papers

Related papers: Strong accessibility of Coxeter groups over minima…

200 papers

We prove an accessibility result for finitely generated groups that combines Sela's acylindrical accessibility with Linell accessibility.

Group Theory · Mathematics 2007-05-23 Richard Weidmann

In a previous article by the author and P. Wesolek, it was shown that a compactly generated locally compact group $G$ admits a finite normal series $(G_i)$ in which the factors are compact, discrete or irreducible in the sense that no…

Group Theory · Mathematics 2021-06-30 Colin D. Reid

A minimal separating set in a connected topological space $X$ is a subset $L \subset X$ with the property that $X \setminus L$ is disconnected, but if $L^{\prime}$ is a proper subset of $L$, then $X \setminus L^{\prime}$ is connected. Such…

Combinatorics · Mathematics 2025-07-17 Christopher N. Aagaard , J. J. P. Veerman

We extend the theory of dual Coxeter and Artin groups to all rank-three Coxeter systems, beyond the previously studied spherical and affine cases. Using geometric, combinatorial, and topological techniques, we show that rank-three…

Group Theory · Mathematics 2025-01-15 Emanuele Delucchi , Giovanni Paolini , Mario Salvetti

Consider a group G and a family $\mathcal{A}$ of subgroups of G. We say that vertex finiteness holds for splittings of G over $\mathcal{A}$ if, up to isomorphism, there are only finitely many possibilities for vertex stabilizers of minimal…

Group Theory · Mathematics 2019-06-07 Vincent Guirardel , Gilbert Levitt

Our main result is that every graph $G$ on $n\ge 10^4r^3$ vertices with minimum degree $\delta(G) \ge (1 - 1 / 10^4 r^{3/2} ) n$ has a fractional $K_r$-decomposition. Combining this result with recent work of Barber, K\"uhn, Lo and Osthus…

Combinatorics · Mathematics 2018-09-05 Ben Barber , Daniela Kühn , Allan Lo , Richard Montgomery , Deryk Osthus

Let $G$ be a real reductive Lie group, $L$ a compact subgroup, and $\pi$ an irreducible admissible representation of $G$. In this article we prove a necessary and sufficient condition for the finiteness of the multiplicities of $L$-types…

Representation Theory · Mathematics 2023-04-25 Toshiyuki Kobayashi

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

Group Theory · Mathematics 2016-03-23 Cora Welsch

We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…

Combinatorics · Mathematics 2026-05-14 Joseph Paul MacManus

The following results are proved: The center of any finite index subgroup of an irreducible, infinite, non-affine Coxeter group is trivial; Any finite index subgroup of an irreducible, infinite, non-affine Coxeter group cannot be expressed…

Group Theory · Mathematics 2007-05-23 Dongwen Qi

For a graph $H$, a graph $G$ is an $H$-graph if it is an intersection graph of connected subgraphs of some subdivision of $H$. $H$-graphs naturally generalize several important graph classes like interval or circular-arc graph. This class…

Data Structures and Algorithms · Computer Science 2020-02-24 Fedor V. Fomin , Petr A. Golovach , Jean-Florent Raymond

Let $(W,S)$ be a Coxeter system of type $A$, so that $W$ can be identified with the symmetric group $\mathrm{Sym}(n)$ for some positive integer $n$ and $S$ with the set of simple transpositions $\{\,(i,i+1)\mid 1\leqslant i\leqslant…

Group Theory · Mathematics 2015-03-05 Van Minh Nguyen

Let $G$ be a finite group and let $H_1,H_2<G$ be two subgroups. In this paper, we are concerned with the bipartite graph whose vertices are $G/H_1\cup G/H_2$ and a coset $g_1H_1$ is connected with another coset $g_2H_2$ if and only if…

Group Theory · Mathematics 2022-08-25 Péter P. Varjú

Parahoric group schemes are certain possibly non-reductive, smooth, affine integral models of reductive group schemes defined over a henselian discretely valued field $K$ whose residue field is perfect. We show that any such group scheme…

Algebraic Geometry · Mathematics 2026-03-09 Arnab Kundu

A subspace Y of a separable metrizable space X is separable, but without X metrizable this is not true even If Y is a closed linear subspace of a topological vector space X. K.H. Hofmann and S.A. Morris introduced the class of pro-Lie…

General Topology · Mathematics 2015-01-14 Arkady Leiderman , Sidney A. Morris , Mikhail G. Tkachenko

In this paper, we show that any Coxeter graph which defines a higher rank Coxeter group must have disjoint induced subgraphs each of which defines a hyperbolic or higher rank Coxeter group. We then use this result to demonstrate several…

Group Theory · Mathematics 2010-07-23 Ryan Blair , Ryan Ottman

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Logic · Mathematics 2016-07-07 Frank Olaf Wagner

A subset $F$ of edges in a connected graph $G$ is a $h$-extra edge-cut if $G-F$ is disconnected and every component has more than $h$ vertices. The $h$-extra edge-connectivity $\la^{(h)}(G)$ of $G$ is defined as the minimum cardinality over…

Combinatorics · Mathematics 2013-01-22 Zhen-Mu Hong , Jun-Ming Xu

Croke-Kleiner admissible groups firstly introduced by Croke-Kleiner belong to a particular class of graph of groups which generalize fundamental groups of $3$--dimensional graph manifolds. In this paper, we show that if $G$ is a…

Group Theory · Mathematics 2021-01-25 Hoang Thanh Nguyen , Wenyuan Yang

We consider the Membership and the Half-Space Reachability problems for matrices in dimensions two and three. Our first main result is that the Membership Problem is decidable for finitely generated sub-semigroups of the Heisenberg group…

Computational Complexity · Computer Science 2019-04-30 Thomas Colcombet , Joël Ouaknine , Pavel Semukhin , James Worrell