Related papers: Braid relations for involution words in affine Cox…
In any Coxeter group, the conjugates of elements in the standard minimal generating set are called reflections and the minimal number of reflections needed to factor a particular element is called its reflection length. In this article we…
Tree-child networks are an important network class which are used in phylogenetics to model reticulate evolution. In a recent paper, Pons and Batle (2021) conjectured a relation between tree-child networks and certain words. In this short…
We describe a new algorithm for computing braid orbits on Nielsen classes. As an application we classify all families of affine genus zero systems; that is all families of coverings of the Riemann sphere by itself such that the monodromy…
We introduce affine structures on groups and show they form a category equivalent to that of semi-braces. In particular, such a new description of semi-braces includes that presented by Rump for braces. By specific affine structures, we…
We introduce classical and non-deterministic finite automata associated with representations of the braid group. After briefly reviewing basic definitions on finite automata, Coxeter's groups and the associated word problem, we turn to the…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
A model for a finite group is a set of linear characters of subgroups that can be induced to obtain every irreducible character exactly once. A perfect model for a finite Coxeter group is a model in which the relevant subgroups are the…
In this note we first consider a ternary matrix group related to the von Neumann regular semigroups and to the Artin braid group (in an algebraic way). The product of a special kind of ternary matrices (idempotent and of finite order)…
We give a case-by-case description of the centralizers of involutions in finite Coxeter groups.
We investigate inflection structure of a synthetic language using Latin as an example. We construct a bipartite graph in which one group of vertices correspond to dictionary headwords and the other group to inflected forms encountered in a…
The category of matchings between finite sets extends to the category of cobordisms of signed sets. A chain of cobordisms that starts and ends with unsigned sets A and B yields a matching from A to B. This is a convenient way to package the…
In this article we give an algorithm for determining the generators and relations for the rings of semi-invariant functions on irreducible components of representation spaces for gentle string algebras. These rings of semi-invariants turn…
A Coxeter link is a closure of a product of two braids, one being a quasi-Coxeter element and the other being a product of partial full twists. This class of links includes torus knots \(T_{n,k}\) and torus links \(T_{n,nk}\). We identify…
We define an annular concordance invariant and study its properties. When specialized to braids, this invariant gives bounds on band rank. We introduce a modified chain complex to reformulate the invariant. Then, by focusing on a special…
We generalize the "facial weak order" of a finite Coxeter group to a partial order on a set of intervals in a complete lattice. We apply our construction to the lattice of torsion classes of a finite-dimensional algebra and consider its…
A conjecture of Dehornoy claims that, given a presentation of an Artin-Tits group, every word that represents the identity can be transformed into the trivial word using the braid relations, together with certain rules (between pairs of…
We consider the question of determining whether a given group (especially one generated by involutions) is a right-angled Coxeter group. We describe a group invariant, the involution graph, and we characterize the involution graphs of…
We give an algorithm to decide if a given braid is a product of two factors which are conjugates of given powers of standard generators of the braid group. The same problem is solved in a certain class of Garside groups including Artin-Tits…
The W-set of an element of a weak order poset is useful in the cohomological study of the closures of spherical subgroups in generalized flag varieties. We explicitly describe in a purely combinatorial manner the W-sets of the weak order…
After defining reduced minimum braid word and criteria for a braid family representative, different braid family representatives are derived, and a correspondence between them and families of knots and links given in Conway notation is…