English
Related papers

Related papers: Virtually fibering random right-angled Coxeter gro…

200 papers

Let W be a 2-dimensional right-angled Coxeter group. We characterise such W with linear and quadratic divergence, and construct right-angled Coxeter groups with divergence polynomial of arbitrary degree. Our proofs use the structure of…

Group Theory · Mathematics 2013-06-19 Pallavi Dani , Anne Thomas

We introduce new objects, called $(G,c)$-bands, associated with a simple simply-connected algebraic group $G$, and a Coxeter element $c$ in its Weyl group. We show that bands of a given type are the $K$-points of an infinite dimensional…

Representation Theory · Mathematics 2025-04-22 Luca Francone , Bernard Leclerc

In this article, we study the manifold structure and the relatively hyperbolic structure of right-angled Coxeter groups with planar nerves. We then apply our results to the quasi-isometry problem for this class of right-angled Coxeter…

Group Theory · Mathematics 2019-09-09 Matthew Haulmark , Hoang Thanh Nguyen , Hung Cong Tran

Let $G_{n,p}$ be the standard Erd\H{o}s-R\'enyi-Gilbert random graph and let $G_{n,n,p}$ be the random bipartite graph on $n+n$ vertices, where each $e\in [n]^2$ appears as an edge independently with probability $p$. For a graph $G=(V,E)$,…

Combinatorics · Mathematics 2015-11-19 Alan Frieze , Tony Johansson

We give a criterion for a finitely generated odd-angled Coxeter group to have a proper finite index subgroup generated by reflections. The answer is given in terms of the least prime divisors of the exponents of the Coxeter relations.

Group Theory · Mathematics 2019-10-25 Anna Felikson , Jessica Fintzen , Pavel Tumarkin

A graph $X$ is defined inductively to be $(a_0,\dots,a_{n-1})$-regular if $X$ is $a_0$-regular and for every vertex $v$ of $X$, the sphere of radius $1$ around $v$ is an $(a_1,\dots,a_{n-1})$-regular graph. Such a graph $X$ is said to be…

Group Theory · Mathematics 2020-09-21 Marston Conder , Alexander Lubotzky , Jeroen Schillewaert , François Thilmany

We develop a battery of tools for studying quasi-isometric rigidity and classification problems for splittings of groups. The techniques work best for finite graphs of groups where all edge and vertex groups are coarse PD groups. For…

Group Theory · Mathematics 2007-05-23 Lee Mosher , Michah Sageev , Kevin Whyte

Let $W$ be a Coxeter group whose proper parabolic subgroups are finite. According to Theorem~1.12 of [1], if the module of a finite $W$-digraph $\Gamma$ is isomorphic to the module of a $W$-graph over $Q$, then $\Gamma$ is acyclic. We…

Representation Theory · Mathematics 2021-10-28 Dean Alvis

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…

Logic · Mathematics 2022-02-02 Bernhard Muhlherr , Gianluca Paolini , Saharon Shelah

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

Group Theory · Mathematics 2016-09-07 Paul E. Schupp

Let G be a semisimple group over an algebraically closed field. Steinberg has associated to a Coxeter element w of minimal length r a subvariety V of G isomorphic to an affine space of dimension r which meets the regular unipotent class Y…

Representation Theory · Mathematics 2011-03-10 Xuhua He , George Lusztig

The mincut graph bisection problem involves partitioning the n vertices of a graph into disjoint subsets, each containing exactly n/2 vertices, while minimizing the number of "cut" edges with an endpoint in each subset. When considered over…

Statistical Mechanics · Physics 2010-04-27 Allon G. Percus , Gabriel Istrate , Bruno Goncalves , Robert Z. Sumi , Stefan Boettcher

We consider a number $\nu_n$ of components in a random graph $G(n,p)$ with $n$ vertices, where the probability of an edge is equal to $p$. By operating with special generating functions we shows the next asymptotic relation for factorial…

Probability · Mathematics 2019-04-03 Nikolay Kazimirow

By exploiting properties of boundaries associated with Coxeter groups we obtain a complete characterization of simple right-angled multi-parameter Hecke C$^{\ast}$-algebras. This extends previous results by Caspers, Larsen and the author.…

Operator Algebras · Mathematics 2022-09-29 Mario Klisse

For each $\Delta>0$, we prove that there exists some $C=C(\Delta)$ for which the binomial random graph $G(n,C\log n/n)$ almost surely contains a copy of every tree with $n$ vertices and maximum degree at most $\Delta$. In doing so, we…

Combinatorics · Mathematics 2019-08-22 Richard Montgomery

For any set $\Omega$ of non-negative integers such that $\{0,1\}\subseteq \Omega$ and $\{0,1\}\ne \Omega$, we consider a random $\Omega$-$k$-tree ${\sf G}_{n,k}$ that is uniformly selected from all connected $k$-trees of $(n+k)$ vertices…

Probability · Mathematics 2016-05-18 Michael Drmota , Emma Yu Jin , Benedikt Stufler

Let $G$ be a relatively hyperbolic group and let $Q$ and $R$ be relatively quasiconvex subgroups. It is known that there are many pairs of finite index subgroups $Q' \leqslant_f Q$ and $R' \leqslant_f R$ such that the subgroup join $\langle…

Group Theory · Mathematics 2025-04-03 Lawk Mineh

Let $W$ be a finitely generated right-angled Coxeter group with group von Neumann algebra $\mathcal{L}(W)$. We prove the following dichotomy: either $\mathcal{L}(W)$ is strongly solid or $W$ contains $\mathbb{Z} \times \mathbb{F}_2$ as a…

Operator Algebras · Mathematics 2024-06-17 Matthijs Borst , Martijn Caspers

Let $G$ be a connected graph of order $n$.The Wiener index $W(G)$ of $G$ is the sum of the distances between all unordered pairs of vertices of $G$. In this paper we show that the well-known upper bound $\big( \frac{n}{\delta+1}+2\big) {n…

Combinatorics · Mathematics 2023-06-22 Peter Dankelmann , Alex Alochukwu

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the simple undirected graph whose vertex set is $G$, in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer $n\geq 2$, let $C_n$…

Combinatorics · Mathematics 2019-05-28 Ramesh Prasad Panda , Kamal Lochan Patra , Binod Kumar Sahoo