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

We show how to generate coupled KdV hierarchies from Staeckel separable systems of Benenti type. We further show that solutions of these Staeckel systems generate a large class of finite-gap and rational solutions of cKdV hierarchies. Most…

We survey several notions of Mackey functors and biset functors found in the literature and prove some old and new theorems comparing them. While little here will surprise the experts, we draw a conceptual and unified picture by making…

We prove a number of results about profinite completions of Coxeter groups. For example we prove Coxeter groups are good in the sense of Serre and that various splittings of Coxeter groups arising from actions on trees are detected by the…

Let $(W,S)$ be an arbitrary Coxeter system. For each word $\omega$ in the generators we define a partial order--called the {\sf $\omega$-sorting order}--on the set of group elements $W_\omega\subseteq W$ that occur as subwords of $\omega$.…

Folding subgroups give a way to realize non-simply-laced Coxeter groups as subgroups of simply-laced Coxeter groups. In this paper, we study how folding subgroups of finite and affine type are distributed length-wise by calculating the…

We prove that the centralizer of a Coxeter element in an irreducible Coxeter group is the cyclic group generated by that Coxeter element.

We prove that the lower central series of the cactus group associated with a non commutative Coxeter group never stabilizes. We also compute a minimal presentation in terms of generators for the cactus group associated with a finite Coxeter…

The finite orbits of the braid group action on Stokes matrices are studied and are shown to be the orbits on ordered sets of reflections, generating finite groups. All invariants of a reflection arrangement are determined. Determination of…

We describe generators and defining relations for the commutator subgroup of topological full groups of minimal subshifts. We show that the word problem in a topological full group is solvable if and only if the language of the underlying…

In this paper, we inspect a relatively unexplored notion of finite generation in semirings, namely semirings in which all congruences are finitely generated. Such semirings are dubbed Congruence Noetherian. After developing sufficient…

We address the question: for which collections of finite simple groups does there exist an algorithm that determines the images of an arbitrary finitely presented group that lie in the collection? We prove both positive and negative…

Imagine we want to split a group of agents into teams in the most \emph{efficient} way, considering that each agent has their own preferences about their teammates. This scenario is modeled by the extensively studied \textsc{Coalition…

We prove that any non-cocompact irreducible lattice in a higher rank semi-simple Lie group contains a subgroup of finite index, which has three generators.

Although the alternating group is an index 2 subgroup of the symmetric group, there is no generating set that gives a Coxeter structure on it. Various generating sets were suggested and studied by Bourbaki, Mitsuhashi, Regev-Roichman,…

We introduce a new combinatorial structure: the superselector. We show that superselectors subsume several important combinatorial structures used in the past few years to solve problems in group testing, compressed sensing, multi-channel…

We define a type B analogue of the category of finite sets with surjections, and we study the representation theory of this category. We show that the opposite category is quasi-Grobner, which implies that submodules of finitely generated…

We construct a group K_n with properties similar to infinite Coxeter groups. In particular, it has a geometric representation featuring hyperplanes and simplicial chambers. The generators of K_n are given by 2-element subsets of {0, .., n}.…

For each family of finite classical groups, and their associated simple quotients, we provide an explicit presentation on a specific generating set of size at most 8. Since there exist efficient algorithms to construct this generating set…

Self-similar groups provide a rich source of groups with interesting properties; e.g., infinite torsion groups (Burnside groups) and groups with an intermediate word growth. Various self-similar groups can be described by a recursive…

We provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…