English
Related papers

Related papers: Lusztig's $a$-function for Coxeter groups with com…

200 papers

For affine symmetric groups we construct finite $W$-graphs corresponding to two-row shapes, and prove their uniqueness. This gives the first non-trivial family of examples of finite $W$-graphs in an affine type. We compare our construction…

Combinatorics · Mathematics 2019-08-29 Dongkwan Kim , Pavlo Pylyavskyy

We prove that if the Cayley graph of a finitely generated group enjoys the property L_delta then the group is almost convex and has a sub-cubic isoperimetric function.

Group Theory · Mathematics 2012-05-16 Murray Elder

The rich theory of Coxeter groups is used to provide an algebraic construction of finite volume hyperbolic n-manifolds. Combinatorial properties of finite images of these groups can be used to compute the volumes of the resulting manifolds.…

Geometric Topology · Mathematics 2007-06-13 Brent Everitt

In this paper we characterize groups according to the number of end vertices in the associated coprime graphs. An upper bound on the order of the group that depends on the number of end vertices is obtained. We also prove that $2-$groups…

Group Theory · Mathematics 2018-03-08 Tariq A. Alraqad , Muhammad S. Saeed. , Etaf S. Alshawarbeh

We consider the class of countable groups possessing an action on a finite product of hyperbolic graphs where every infinite order element acts loxodromically. When the graphs are locally finite, we obtain strong structure theorems for the…

Group Theory · Mathematics 2020-09-23 J. O. Button

Let $(W,S)$ be a Coxeter system and $\Gamma$ be a group of automorphisms of $W$ such that $\gamma(S)=S$ for all $\gamma \in \Gamma$. Then it is known that the group of fixed points $W^\Gamma$ is again a Coxeter group with a canonically…

Representation Theory · Mathematics 2014-12-18 Meinolf Geck , Lacrimioara Iancu

We establish a necessary and sufficient condition for a normal subgroup of a finite group to be a subgroup perfect code.

Combinatorics · Mathematics 2025-05-08 Masoumeh Koohestani , Doost Ali Mojdeh , Mohsen Ghasemi , Hassan Khodaiemehr

In graph theory, knowing the number of complete subgraphs with r vertices that a graph g has, limits the number of its complete subgraphs with s vertices, for s > r. A useful upper bound is provided by the Kruskal-Katona theorem, but this…

Combinatorics · Mathematics 2018-12-31 Robert Cowen

We study and classify a class of representations (called generalized geometric representations) of a Coxeter group of finite rank. These representations can be viewed as a natural generalization of the geometric representation. The…

Representation Theory · Mathematics 2023-12-11 Hongsheng Hu

The $L^2$-zeta function of an infinite graph Y (defined previously in a ball around zero) has an analytic extension. For a tower of finite graphs covered by Y, the normalized zeta functions of the finite graphs converge to the $L^2$-zeta…

Number Theory · Mathematics 2007-05-23 Bryan Clair , Shahriar Mokhtari-Sharghi

This paper is the continuation of the work in~\cite{Yin}. In that paper we generalized the definition of $W$-graph ideal in the weighted Coxeter groups, and showed how to construct a $W$-graph from a given $W$-graph ideal in the case of…

Representation Theory · Mathematics 2015-04-01 Yunchuan Yin

We consider the class of those Coxeter groups for which removing from the Cayley graph any tubular neighbourhood of any wall leaves exactly two connected components. We call these Coxeter groups bipolar. They include both the virtually…

Group Theory · Mathematics 2012-03-07 Pierre-Emmanuel Caprace , Piotr Przytycki

One classical result of Freimann gives the optimal lower bound for the cardinality of A+A if A is a d-dimensional finite set in the Euclidean d-space. Matolcsi and Ruzsa have recently generalized this lower bound to |A+kB| if B is…

Combinatorics · Mathematics 2016-02-08 Karoly Boroczky , Francisco Santos , Oriol Serra

Let $(W,S)$ be a finite Coxeter group. Kazhdan and Lusztig introduced the concept of $W$-graphs and Gyoja proved that every irreducible representation of the Iwahori-Hecke algebra $H(W,S)$ can be realized as a $W$-graph. Gyoja defined an…

Representation Theory · Mathematics 2017-07-11 Johannes Hahn

Leighton's graph covering theorem says that two finite graphs with a common cover have a common finite cover. We present a new proof of this using groupoids, and use this as a model to prove two generalisations of the theorem. The first…

Group Theory · Mathematics 2022-08-25 Sam Shepherd , Giles Gardam , Daniel J. Woodhouse

Through highly non-constructive methods, works by Bestvina, Culler, Feighn, Morgan, Paulin, Rips, Shalen, and Thurston show that if a finitely presented group does not split over a virtually solvable subgroup, then the space of its discrete…

Geometric Topology · Mathematics 2009-02-17 Yvonne Lai

We define the Cayley graph and its growth function for multivalued groups. We prove that if we change a finite set of generators of multivalued group, or change the starting point, we get an equivalent growth function. We prove that if we…

Group Theory · Mathematics 2025-05-27 Valeriy G. Bardakov , Tatyana A. Kozlovskaya , Matvei N. Zonov

We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…

Representation Theory · Mathematics 2023-06-28 Eric J. Hanson

A conjecture proposed by Gaetz and Gao asserts that the Cayley graph of any Coxeter group satisfies the strong hull property. In this paper, we prove this conjecture for all affine irreducible Coxeter groups of rank 3. Our approach exploits…

Combinatorics · Mathematics 2026-03-25 Ziming Liu

In this paper, we investigate a relation between finite graphs, simplicial flag complexes and right-angled Coxeter groups, and we provide a class of reconstructible finite graphs. We show that if $\Gamma$ is a finite graph which is the…

Combinatorics · Mathematics 2015-03-17 Tetsuya Hosaka