Related papers: Algorithms for Garside calculus
A monoid $K$ is the internal Zappa-Sz\'ep product of two submonoids, if every element of $K$ admits a unique factorisation as the product of one element of each of the submonoids in a given order. This definition yields actions of the…
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. We give a necessary and sufficient condition for X to be free of given rank d over A. In the case…
Algorithms have been fundamental to recent global technological advances and, in particular, they have been the cornerstone of technical advances in one field rapidly being applied to another. We argue that algorithms possess fundamentally…
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…
We show that the simple elements of the dual Garside structure of an Artin group of type $D_n$ are Mikado braids, giving a positive answer to a conjecture of Digne and the second author. To this end, we use an embedding of the Artin group…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
We first prove the Grinberg-Kazhdan formal arc theorem without any assumptions on the characteristic. This part of the article is equivalent to arXiv:math-AG/0203263. Then we try to clarify the geometric ideas behind the proof by…
We investigate the average-case complexity of decision problems for finitely generated groups, in particular the word and membership problems. Using our recent results on ``generic-case complexity'' we show that if a finitely generated…
A new type of algebras that represent a generalization of both quantum groups and braided groups is defined. These algebras are given by a pair of solutions of the Yang--Baxter equation that satisfy some additional conditions. Several…
Factorization -- a simple form of standardization -- is concerned with reduction strategies, i.e. how a result is computed. We present a new technique for proving factorization theorems for compound rewriting systems in a modular way, which…
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…
An algorithm, based on numerical description of the terms of many-body perturbation theory (Goldstone diagrams), is presented. The algorithm allows the use of the same piece of computer code to evaluate any particular diagram in any…
Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…
An important piece of information in the theory of the arithmetic Galois action on the geometric fundamental groups of schemes is that divisorial inertia is acted on cyclotomically. We detail in this note the content of this fact in the…
We introduce the notion of a braiding on a skew monoidal category, whose curious feature is that the defining isomorphisms involve three objects rather than two. These braidings are shown to arise from, and classify, cobraidings (also known…
The Grover search algorithm is one of the two key algorithms in the field of quantum computing, and hence it is of significant interest to describe it in the most efficient mathematical formalism. We show firstly, that Clifford's formalism…
MGARD (MultiGrid Adaptive Reduction of Data) is an algorithm for compressing and refactoring scientific data, based on the theory of multigrid methods. The core algorithm is built around stable multilevel decompositions of conforming…
This is the first paper in a series where we generalize the Categorical Quantum Mechanics program (due to Abramsky, Coecke, et al) to braided systems. In our view a uniform description of quantum information for braided systems has not yet…
We define and study the Picard group of a monoid scheme and the class group of a normal monoid scheme. To do so, we develop some ideal theory for (pointed abelian) noetherian monoids, including primary decomposition and discrete valuations.…
Let G be a graph. The (unlabeled) configuration space of n points on G is the space of all n-element subsets of G. The fundamental group of such a configuration space is called a graph braid group. We use a version of discrete Morse theory…