Related papers: Some combinatorial models for reduced expressions …

Let (G,S) be a finitely generated Coxeter group, such that the Coxeter system is indecomposable and the canonical bilinear form is indefinite but non-degenerate. We show that the reduced C-*-algebra of G is simple with unique normalised…

We give generators for a certain complex hyperbolic braid group. That is, we remove a hyperplane arrangement from complex hyperbolic $13$-space, take the quotient of the remaining space by a discrete group, and find generators for the…

Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…

We investigate the question which Q-valued characters and characters of Q-representations of finite groups are Z-linear combinations of permutation characters. This question is known to reduce to that for quasi-elementary groups, and we…

We describe algorithms and heuristics that allow us to express arbitrary elements of SLn (Z) and Sp2n (Z) as products of generators in particular "standard" generating sets. For elements obtained experimentally as random products, it…

We discuss the symmetries of the Lagrangian of the leptonic sector. We consider the case when this symmetry group is a Coxeter group. The number of elements of the PMNS matrix predicted by this group structure would depend on the number of…

Given an Orthogonal Array we analyze the aberrations of the sub-fractions which are obtained by the deletion of some of its points. We provide formulae to compute the Generalized Word-Length Pattern of any sub-fraction. In the case of the…

A right-angled Coxeter group is a group with a given set of generators of order two, subject only to the relations that certain pairs of the generators commute. Various papers have shown how homological properties of the Coxeter group are…

In recent papers we have refined a conjecture of Lehrer and Solomon expressing the characters of a finite Coxeter group $W$ afforded by the homogeneous components of its Orlik-Solomon algebra as sums of characters induced from linear…

We find a simple product formula for the characteristic polynomial of the permutations with a fixed descent set under the weak order. As a corollary we obtain a simple product formula for the characteristic polynomial of alternating…

Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…

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…

In 2011 Eriko Hironaka introduced an interesting generalization of Coxeter groups, motivated by studying certain mapping classes. The generalization is by labeling the vertices of a Coxeter graph either by +1 or by -1, and then generalizing…

We introduce several new constructions of finite posets with the number of linear extensions given by generalized continued fractions. We apply our results to the problem of the minimum number of elements needed for a poset with a given…

Counting distinct permutations with replacement, especially when involving multiple subwords, is a longstanding challenge in combinatorial analysis, with critical applications in cryptography, bioinformatics, and statistical modeling. This…

We study classes of right-angled Coxeter groups with respect to the strong submodel relation of parabolic subgroup. We show that the class of all right-angled Coxeter group is not smooth, and establish some general combinatorial criteria…

We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…

Involution words are variations of reduced words for twisted involutions in Coxeter groups. They arise naturally in the study of the Bruhat order, of certain Iwahori-Hecke algebra modules, and of orbit closures in flag varieties.…

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…

Aiming for a revival of the theory of crystallographic complex reflection groups, we compute (minimal) Coxeter-like reflection presentations for the infinite families of those non-genuine groups which satisfy Steinberg's fixed point…