Solutions of Word Equations over Partially Commutative Structures

We give NSPACE(n log n) algorithms solving the following decision problems. Satisfiability: Is the given equation over a free partially commutative monoid with involution (resp. a free partially commutative group) solvable? Finiteness: Are there only finitely many solutions of such an equation? PSPACE algorithms with worse complexities for the first problem are known, but so far, a PSPACE algorithm for the second problem was out of reach. Our results are much stronger: Given such an equation, its solutions form an EDT0L language effectively representable in NSPACE(n log n). In particular, we give an effective description of the set of all solutions for equations with constraints in free partially commutative monoids and groups

From Monomials to Words to graphs

Given a finite alphabet X and an ordering on the letters, the map \sigma sends each monomial on X to the word that is the ordered product of the letter powers in the monomial. Motivated by a question on Groebner bases, we characterize ideals I in the free commutative monoid (in terms of a generating set) such that the ideal generated by \sigma(I) in the free monoid is finitely generated. Whether there exists an ordering such that is finitely generated turns out to be NP-complete. The latter problem is closely related to the recognition problem for comparability graphs.Comment: 27 pages, 2 postscript figures, uses gastex.st

Cohomology of idempotent braidings, with applications to factorizable monoids

We develop new methods for computing the Hochschild (co)homology of monoids which can be presented as the structure monoids of idempotent set-theoretic solutions to the Yang--Baxter equation. These include free and symmetric monoids; factorizable monoids, for which we find a generalization of the K{\"u}nneth formula for direct products; and plactic monoids. Our key result is an identification of the (co)homologies in question with those of the underlying YBE solutions, via the explicit quantum symmetrizer map. This partially answers questions of Farinati--Garc{\'i}a-Galofre and Dilian Yang. We also obtain new structural results on the (co)homology of general YBE solutions

Algebras for weighted search

Weighted search is an essential component of many fundamental and useful algorithms. Despite this, it is relatively under explored as a computational effect, receiving not nearly as much attention as either depth- or breadth-first search. This paper explores the algebraic underpinning of weighted search, and demonstrates how to implement it as a monad transformer. The development first explores breadth-first search, which can be expressed as a polynomial over semirings. These polynomials are generalised to the free semi module monad to capture a wide range of applications, including probability monads, polynomial monads, and monads for weighted search. Finally, a monad trans-former based on the free semi module monad is introduced. Applying optimisations to this type yields an implementation of pairing heaps, which is then used to implement Dijkstra’s algorithm and efficient probabilistic sampling. The construction is formalised in Cubical Agda and implemented in Haskell

On structure groups of set-theoretic solutions to the Yang-Baxter equation

This paper explores the structure groups $G_{(X,r)}$ of finite non-degenerate set-theoretic solutions $(X,r)$ to the Yang-Baxter equation. Namely, we construct a finite quotient $\overline{G}_{(X,r)}$ of $G_{(X,r)}$, generalizing the Coxeter-like groups introduced by Dehornoy for involutive solutions. This yields a finitary setting for testing injectivity: if $X$ injects into $G_{(X,r)}$, then it also injects into $\overline{G}_{(X,r)}$. We shrink every solution to an injective one with the same structure group, and compute the rank of the abelianization of $G_{(X,r)}$. We show that multipermutation solutions are the only involutive solutions with diffuse structure group; that only free abelian structure groups are biorderable; and that for the structure group of a self-distributive solution, the following conditions are equivalent: biorderable, left-orderable, abelian, free abelian, torsion free.Comment: 32 pages. Final version. Accepted for publication in Proc. Edinburgh Math. So