English
Related papers

Related papers: Generating series of cyclically fully commutative …

200 papers

We prove that a non-spherical irreducible Coxeter group is (directly) indecomposable and that a non-spherical and non-affine Coxeter group is strongly indecomposable in the sense that all its finite index subgroups are (directly)…

Group Theory · Mathematics 2007-05-23 Luis Paris

We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…

Group Theory · Mathematics 2017-03-21 Taras Panov , Yakov Veryovkin

A complete system of primitive pairwise orthogonal idempotents for the Coxeter groups of type $B$ and, more generally, for the complex reflection groups $G(m,1,n)$ is constructed by a sequence of evaluations of a rational function in…

Representation Theory · Mathematics 2015-01-27 O. V. Ogievetsky , L. Poulain d'Andecy

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 >...…

Combinatorics · Mathematics 2007-10-18 David E Speyer

In this article we show how the structure of Coxeter groups are present in gate sets of reversible and quantum computing. These groups have efficient word problems which means that circuits built from these gates have potential to be…

Quantum Physics · Physics 2018-10-23 Jon Aytac , Ammar Husain

We illustrate the principle: rational generating series occuring in arithmetic geometry are motivic in nature.

Number Theory · Mathematics 2007-05-23 J. Denef , F. Loeser

For an arbitrary cocompact hyperbolic Coxeter group G with finite generator set S and complete growth function P(x)/Q(x), we provide a recursion formula for the coefficients of the denominator polynomial Q(x) which allows to determine…

Metric Geometry · Mathematics 2010-06-24 Ruth Kellerhals , Genevieve Perren

Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…

We define the notion of a climbing element in a finite real reflection group relative to a total order on the reflection set and we characterise these elements in the case where the total order arises from a bipartite Coxeter element.

Combinatorics · Mathematics 2010-05-06 Thomas Brady , Aisling Kenny , And Colum Watt

A finite group $G$ is coprimely-invariably generated if there exists a set of generators $\{g_1, \ldots, g_d\}$ of $G$ with the property that the orders $|g_1|, \ldots, |g_d|$ are pairwise coprime and that for all $x_1, \ldots, x_d \in G$…

Group Theory · Mathematics 2014-09-04 Eloisa Detomi , Andrea Lucchini

We show that the intersection of the rational derived series of a one-relator group is rationally perfect and is normally generated by a single element. As a corollary, we characterise precisely when a one-relator group is residually…

Group Theory · Mathematics 2025-09-22 Marco Linton

A product of cochains in a polyhedral complex is constructed. The multiplication algorithm depends on the choice of a parameter. The parameter is a linear functional on the ambient space. Cocycles form a subring of the ring of cochains,…

Algebraic Topology · Mathematics 2015-08-14 B. Kazarnovskii

We use probabilistic methods to prove that many Coxeter groups are incoherent. In particular, this holds for Coxeter groups of uniform exponent > 2 with sufficiently many generators.

Group Theory · Mathematics 2020-06-09 Kasia Jankiewicz , Daniel T. Wise

Antonenko and Russyev independently have shown that any Mealy automaton with no cycles with exit--that is, where every cycle in the underlying directed graph is a sink component--generates a fi- nite (semi)group, regardless of the choice of…

Formal Languages and Automata Theory · Computer Science 2013-10-29 Ines Klimann , Matthieu Picantin

A set is called recurrent if its minimal automaton is strongly connected and birecurrent if it is recurrent as well as its reversal. We prove a series of results concerning birecurrent sets. It is already known that any birecurrent set is…

Formal Languages and Automata Theory · Computer Science 2018-04-06 Francesco Dolce , Dominique Perrin , Antonio Restivo , Christophe Reutenauer , Giuseppina Rindone

A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…

Group Theory · Mathematics 2019-06-12 Benjamin Blanchette , Christian Choffrut , Christophe Reutenauer

We show that the finitely generated simple left orderable groups $G_{\rho}$ constructed by the first two authors in arXiv:1807.06478 are uniformly perfect - each element in the group can be expressed as a product of three commutators of…

Group Theory · Mathematics 2020-11-25 James Hyde , Yash Lodha , Andrés Navas , Cristóbal Rivas

The stochastic generators of Markov-regular operator cocycles on symmetric Fock space are studied in a variety of cases: positive cocycles, projection cocycles, and partially isometric cocycles. Moreover a class of transformations of…

Mathematical Physics · Physics 2007-05-23 Stephen Wills

Let $A$ be a commutative Noetherian ring, and let $R = A[X]$ be the polynomial ring in an infinite collection $X$ of indeterminates over $A$. Let ${\mathfrak S}_{X}$ be the group of permutations of $X$. The group ${\mathfrak S}_{X}$ acts on…

Commutative Algebra · Mathematics 2007-05-23 Matthias Aschenbrenner , Christopher J. Hillar

In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…

Number Theory · Mathematics 2021-02-22 István Gaál