Related papers: Garside and quadratic normalisation: a survey
Many natural counting problems arise in connection with the normal form of braids--and seem to have never been considered so far. Here we solve some of them by analysing the normality condition in terms of the associated permutations, their…
The homology of a Garside monoid, thus of a Garside group, can be computed efficiently through the use of the order complex defined by Dehornoy and Lafont. We construct a categorical generalization of this complex and we give some…
A greedoid is a generalization of a matroid allowing for more flexible analyses and modeling of combinatorial optimization problems. However, these structures decimate many matroid properties contributing to their pervasive nature. A…
We show the intimate connection between various mathematical notions that are currently under active investigation: a class of Garside monoids, with a "nice" Garside element, certain monoids $S$ with quadratic relations, whose monoidal…
Garside groups are combinatorial generalizations of braid groups which enjoy many nice algebraic, geometric, and algorithmic properties. In this article we propose a method for turning the direct product of a group $G$ by $\mathbb{Z}$ into…
We introduce methods to study the combinatorics of the normal form of large random elements in Artin-Tits monoids. These methods also apply in an axiomatic framework that encompasses other monoids such as dual braid monoids.
We develop an effective and natural approach to interpret any semigroup admitting a special language of greedy normal forms as an automaton semigroup,namely the semigroup generated by a Mealy automaton encoding the behaviour of such a…
This paper investigates a new learning formulation called structured sparsity, which is a natural extension of the standard sparsity concept in statistical learning and compressive sensing. By allowing arbitrary structures on the feature…
We empirically analyze a simple heuristic for large sparse set cover problems. It uses the weighted greedy algorithm as a basic building block. By multiplicative updates of the weights attached to the elements, the greedy solution is…
In his seminal paper on complex reflection arrangements, Bessis introduces a Garside structure for the braid group of a well-generated irreducible complex reflection group. Using this Garside structure, he establishes a strong connection…
We clarify some aspects of quantum group gauge theory and its recent generalisations (by T. Brzezinski and the author) to braided group gauge theory and coalgebra gauge theory. We outline the diagrammatic version of the braided case. We…
We study and give examples of braided groupoids, and, a fortiori, non-degenerate solutions of the quiver-theoretical braid equation.
A Garside monoid is a cancellative monoid with a finite lattice generating set; a Garside group is the group of fractions of a Garside monoid. The family of Garside groups contains the Artin-Tits groups of spherical type. We generalise the…
The Poisson structure arising in the Hamiltonian approach to the rational Gaudin model looks very similar to the so-called modified Reflection Equation Algebra. Motivated by this analogy, we realize a braiding of the mentioned Poisson…
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…
Let $X$ be a finite set such that $|X|=n$. Let $\trans$ and $\sym$ denote respectively the transformation monoid and the symmetric group on $n$ points. Given $a\in \trans\setminus \sym$, we say that a group $G\leq \sym$ is $a$-normalizing…
We give a computational algorithm which decides if a braid is quasipositive or not. A braid is quasipositive if it's a product of conjuguates of generators. For this, we use the theory of Garside and the combinatorials properties of the…
This article is about Artin's braid group and its role in knot theory. We set ourselves two goals: (i) to provide enough of the essential background so that our review would be accessible to graduate students, and (ii) to focus on those…
A hidden generalized gauge symmetry of a cutoff QED is used to show the renormalizability of QED. In particular, it is shown that corresponding Ward identities are valid all along the renormalization group flow. The exact Renormalization…
We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks:…