Related papers: Divergence, thickness and hypergraph index for gen…

We attach to every Coxeter system (W,S) an extension C_W of the corresponding Iwahori-Hecke algebra. We construct a 1-parameter family of (generically surjective) morphisms from the group algebra of the corresponding Artin group onto C_W.…

We bound the volume of thick embeddings of finite graphs into the Heisenberg group, as well as the volume of coarse wirings of finite graphs into groups with polynomial growth. This work follows the work of Kolmogorov-Brazdin, Gromov-Guth…

We introduce a technique of projection onto the Coxeter plane of an arbitrary higher dimensional lattice described by the affine Coxeter group. The Coxeter plane is determined by the simple roots of the Coxeter graph I2 (h) where h is the…

Mixed graphs can be seen as digraphs with arcs and edges (or digons, that is, two opposite arcs). In this paper, we consider the case where such graphs are bipartite and in which the undirected and directed degrees are one. The best graphs,…

Affine subgroups having the same Coxeter number with the affine Coxeter groups W(An), W(Dn), and W(En) are constructed by graph folding technique. The affine groups W(Cn) and W(Bn) are obtained from the Coxeter groups W(A2n-1) and W(D2n-1)…

Let $\mathcal{W}$ be the set of strongly real elements of $W$, a Coxeter group. Then for $w \in \mathcal{W}$, $e(w)$, the excess of $w$, is defined by $e(w) = \min\{\ell(x) + \ell(y) - \ell(w) \; | \; w=xy, x^2 = y^2 = 1\}$. When $W$ is…

Let $(W,S)$ be a Coxeter system, and write $S=\{s_i:i\in I\}$, where $I$ is a finite index set. Fix a nonempty convex subset $\mathscr{L}$ of $W$. If $W$ is of type $A$, then $\mathscr{L}$ is the set of linear extensions of a poset, and…

We study $Q$-polynomial distance-regular graphs from the point of view of what we call descendents, that is to say, those vertex subsets with the property that the width $w$ and dual width $w^*$ satisfy $w+w^*=d$, where $d$ is the diameter…

In the spirit of peripheral subgroups in relatively hyperbolic groups, we exhibit a simple class of quasi-isometrically rigid subgroups in graph products of finite groups, which we call eccentric subgroups. As an application, we prove that,…

We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…

Let $(W,S)$ be a Coxeter system, let $S=I \dot{\cup} J$ be a partition of $S$ such that no element of $I$ is conjugate to an element of $J$, let $\widetilde{J}$ be the set of $W_I$-conjugates of elements of $J$ and let $\widetilde{W}$ be…

We define and study generalized nil-Coxeter algebras associated to Coxeter groups. Motivated by a question of Coxeter (1957), we construct the first examples of such finite-dimensional algebras that are not the 'usual' nil-Coxeter algebras:…

The notion of a linear Coxeter system introduced by Vinberg generalizes the geometric representation of a Coxeter group. Our main theorem asserts that if $v$ is an element of the Tits cone of a linear Coxeter system and $\cW$ is the…

Given a system $\mathcal{G} =\{G_1,G_2,\dots,G_m\}$ of graphs/digraphs/hypergraphs on the common vertex set $V$ of size $n$, an $m$-edge graph/digraph/hypergraph $H$ on $V$ is transversal in $\mathcal{G}$ if there exists a bijection…

Let $k,r \geq 2$ be two integers. We consider the problem of partitioning the hyperedge set of an $r$-uniform hypergraph $H$ into the minimum number $\chi_k'(H)$ of edge-disjoint subhypergraphs in which every vertex has either degree $0$ or…

Let $(W, S)$ be a Coxeter system equipped with a fixed automorphism $\ast$ of order $\leq 2$ which preserves $S$. Lusztig (and with Vogan in some special cases) have shown that the space spanned by set of "twisted" involutions was naturally…

The Hecke algebra $\mathbb{C}_q[W]$ of a Coxter group $W$, associated to parameter $q$, can be completed to a von Neumann algebra $\mathcal{N}_q(W)$. We study such algebras in case where $W$ is right-angled. We determine the range of $q$…

For a connected graph $G$, the Wiener index, denoted by $W(G)$, is the sum of the distance of all pairs of distinct vertices and the eccentricity, denoted by $\varepsilon(G)$, is the sum of the eccentricity of individual vertices. In…

We introduce the computer algebra package {\sf PyCox}, written entirely in the {\sf Python} language. It implements a set of algorithms - in a spirit similar to the older {\sf CHEVIE} system - for working with Coxeter groups and Hecke…

We generalise the notion of a separating intersection of links (SIL) to give necessary and sufficient criteria on the defining graph $\Gamma$ of a right-angled Coxeter group $W_\Gamma$ so that its outer automorphism group is large: that is,…