相关论文: Chordal Coxeter Groups

Let W be an infinite irreducible Coxeter group with (s_1, ..., s_n) the simple generators. We give a simple proof that the word s_1 s_2 ... s_n s_1 s_2 >... s_n ... s_1 s_2 ... s_n is reduced for any number of repetitions of s_1 s_2 >...…

In this paper we prove, without the finite rank assumption, that any irreducible Coxeter group of infinite order is directly indecomposable as an abstract group. The key ingredient of the proof is that we can determine, for an irreducible…

Let $G$ be a finite group and let $S$ be an inverse-closed subset of $G$ not containing the identity. The Cayley graph $\mathrm{Cay}(G,S)$ has vertex set $G$, where two vertices $x$ and $y$ are adjacent if and only if $x^{-1}y \in S$.…

For every quiver (valued) of finite representation type we define a finitely presented group called a picture group. This group is very closely related to the cluster theory of the quiver. For example, positive expressions for the Coxeter…

Let $(W,S)$ be a Coxeter system of finite rank and let $J,K\subset S$. We study the rationality of the Poincar\'e series of the set of representatives of minimal length of $(W_J,W_K)$-double cosets of $W$: we conclude that it depends mostly…

We consider presentations that were derived in \cite{BaumeisterNeaimeRees} for the interval groups associated with proper quasi-Coxeter elements of the Coxeter group $W(D_n)$. We use combinatorial methods to derive alternative presentations…

An axiomatic approach to the representation theory of Coxeter groups and their Hecke algebras was presented in [1]. Combinatorial aspects of this construction are studied in this paper. In particular, the symmetric group case is…

This paper presents a construction of fibered links $(K,\Sigma)$ out of chord diagrams $\sL$. Let $\Gamma$ be the incidence graph of $\sL$. Under certain conditions on $\sL$ the symmetrized Seifert matrix of $(K,\Sigma)$ equals the bilinear…

Wirtinger presentations of deficiency 1 appear in the context of knots, long virtual knots, and ribbon 2-knots. They are encoded by (word) labeled oriented trees and, for that reason, are also called LOT presentations. These presentations…

Shephard groups are common generalizations of Coxeter groups, Artin groups, and graph products of cyclic groups. Their definition is similar to that of a Coxeter group, but generators may have arbitrary order rather than strictly order 2.…

Results are obtained concerning the roots of asymmetric geometric representations of Coxeter groups. These representations were independently introduced by Vinberg and Eriksson, and generalize the standard geometric representation of a…

For a Coxeter system $(W,S)$ let $a_n^{(W,S)}$ be the cardinality of the sphere of radius $n$ in the Cayley graph of $W$ with respect to the standard generating set $S$. It is shown that, if $(W,S)\preceq(W',S')$ then $a_n^{(W,S)}\leq…

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

Let $(W,S)$ be a Coxeter system and let $s \in S$. We call $s$ a right-angled generator of $(W,S)$ if $st = ts$ or $st$ has infinite order for each $t \in S$. We call $s$ an intrinsic reflection of $W$ if $s \in R^W$ for all Coxeter…

Braid groups may be defined for every Coxeter diagram. Artin's braid group is of type A. Analogs of Temperley-Lieb, Hecke and Birman-Wenzl algebras exist for B-type. Our general hypothethis is that the braid group of B-type replaces Artin's…

In the course of investigating regular subalgebras of E(10) related to cosmological solutions of 11-dimensional supergravity supporting an electric 4-form field, a class of rank 10 Coxeter subgroups of the Weyl group of E(10) was uncovered…

We combinatorially characterize the number $\mathrm{cc}_2$ of conjugacy classes of involutions in any Coxeter group in terms of higher rank odd graphs. This notion naturally generalizes the concept of odd graphs, used previously to count…

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater…

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…

We attach with every finite, involutive, nondegenerate set-theoretic solution of the Yang--Baxter equation a finite group that plays for the associated structure group the role that a finite Coxeter group plays for the associated…