English
Related papers

Related papers: Matching theorems for systems of a finitely genera…

200 papers

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…

Group Theory · Mathematics 2013-05-17 Patrick Dehornoy

In a recent paper we claimed that both the group algebra of a finite Coxeter group $W$ as well as the Orlik-Solomon algebra of $W$ can be decomposed into a sum of induced one-dimensional representations of centralizers, one for each…

Representation Theory · Mathematics 2011-06-14 J. Matthew Douglass , Goetz Pfeiffer , Gerhard Roehrle

Matrix generators for the general and special linear groups, the symplectic groups and the general and special unitary groups over finite fields. For the most part the generators have been obtained by translating Steinberg's generators for…

Group Theory · Mathematics 2022-01-25 Donald E. Taylor

We show that the standard generating set of a Coxeter group is of minimal cardinality provided that the non-diagonal entries of the Coxeter matrix are sufficiently large.

Group Theory · Mathematics 2009-10-28 Mathieu Carette , Richard Weidmann

Let G be a unipotent algebraic subgroup of some GL_m(C) defined over Q. We describe an algorithm for finding a finite set of generators of the subgroup G(Z) = G \cap GL_m(Z). This is based on a new proof of the result (in more general form…

Group Theory · Mathematics 2008-07-01 Willem de Graaf , Andrea Pavan

We prove a character sum identity for Coxeter arrangements which is a finite field analogue of Macdonald's conjecture proved by Opdam.

Algebraic Geometry · Mathematics 2007-12-06 J. Denef , F. Loeser

We study Coxeter diagrams of some unitary reflection groups. Using solely the combinatorics of diagrams, we give a new proof of the classification of root lattices defined over $\cE = \ZZ[e^{2 \pi i/3}]$: there are only four such lattices,…

Group Theory · Mathematics 2010-12-07 Tathagata Basak

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Group Theory · Mathematics 2025-12-23 Michał Marcinkowski , Piotr Mizerka

We investigate closure operators and describe their properties for $E$-combinations and $P$-combinations of structures and their theories. We prove, for $E$-combinations, that the existence of a minimal generating set of theories is…

Logic · Mathematics 2016-01-05 Sergey V. Sudoplatov

A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…

Group Theory · Mathematics 2019-05-31 S. P. Glasby

Special matchings are purely combinatorial objects associated with a partially ordered set, which have applications in Coxeter group theory. We provide an explicit characterization and a complete classification of all special matchings of…

Combinatorics · Mathematics 2016-12-13 Fabrizio Caselli , Mario Marietti

In recent work, the second author introduced the concept of Coxeter quivers, generalizing several previous notions of a quiver representation. Finite type Coxeter quivers were classified, and their indecomposable objects were shown to be in…

Representation Theory · Mathematics 2024-04-16 Ben Elias , Edmund Heng

In this short note we discuss the interplay between finite Coxeter groups and construction of wavelet sets, generalized multiresolution analysis and sampling.

Functional Analysis · Mathematics 2007-10-19 M. Dobrescu , G. Olafsson

In a series of previous papers, we studied sortable elements in finite Coxeter groups, and the related Cambrian fans. We applied sortable elements and Cambrian fans to the study of cluster algebras of finite type and the noncrossing…

Combinatorics · Mathematics 2026-05-13 Nathan Reading , David E Speyer

We establish recursions counting various classes of chains in the noncrossing partition lattice of a finite Coxeter group. The recursions specialize a general relation which is proven uniformly (i.e. without appealing to the classification…

Combinatorics · Mathematics 2026-05-13 Nathan Reading

Affine Coxeter groups are fundamental objects in mathematics and in crystallography. If two group elements are conjugate, then they have very similar algebraic and geometric properties. Using recent structural results of Mili\'cevi\'c,…

Group Theory · Mathematics 2026-05-29 Amy Herron , Anne Thomas

We give an elementary proof that there are two topological generators for the full group of every aperiodic hyperfinite probability measure preserving Borel equivalence relation. Our proof explicitly constructs topological generators for…

Dynamical Systems · Mathematics 2016-06-28 Andrew S. Marks

We introduce and study a combinatorially defined notion of root basis of a (real) root system of a possibly infinite Coxeter group. Known results on conjugacy up to sign of root bases of certain irreducible finite rank real root systems are…

Group Theory · Mathematics 2010-11-11 Matthew Dyer

The goal of this paper is to establish fundamental properties of the Hochschild, topological Hochschild, and topological cyclic homologies of commutative, Noetherian rings, which are assumed only to be F-finite in the majority of our…

K-Theory and Homology · Mathematics 2014-03-04 Bjørn Ian Dundas , Matthew Morrow

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