Related papers: Quadratic normalisation in monoids
In this paper we describe the quotients of several plactic-like monoids by the least congruences containing the relations $a^{\sigma(a)} = a$ with $\sigma(a)\ge 2$ for every generator $a$. The starting point for this description is the…
We extend the two-variable logic on data words with guarded regular binary predicates of the form $\widetilde{L}(x,y)$ that is true if positions $x$ and $y$ are in the same class and the factor strictly between $x$ and $y$ is in the regular…
Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…
The worst-case complexity of group-theoretic algorithms has been studied for a long time. Generic-case complexity, or complexity on random inputs, was introduced and studied relatively recently. In this paper, we address the average-case…
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…
We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a…
Numerous models for grounded language understanding have been recently proposed, including (i) generic models that can be easily adapted to any given task and (ii) intuitively appealing modular models that require background knowledge to be…
A natural and established way to restrict the constraint satisfaction problem is to fix the relations that can be used to pose constraints; such a family of relations is called a constraint language. In this article, we study arc…
We establish results with an arithmetic flavor that generalize the polynomial multidimensional Szemeredi theorem and related multiple recurrence and convergence results in ergodic theory. For instance, we show that in all these statements…
Many algorithms for maximizing a monotone submodular function subject to a knapsack constraint rely on the natural greedy heuristic. We present a novel refined analysis of this greedy heuristic which enables us to: $(1)$ reduce the…
We curry the elementary arithmetic operations of addition and multiplication to give monotone injections on N, and describe & study the inverse monoids that arise from also considering their generalised inverses. This leads to well-known…
In this paper we show how string rewriting methods can be applied to give a new method of computing double cosets. Previous methods for double cosets were enumerative and thus restricted to finite examples. Our rewriting methods do not…
We develop layered monoidal theories -- a generalisation of monoidal theories combining formal descriptions of a system at different levels of abstraction. Via their representation as string diagrams, monoidal theories provide a graphical…
For quadratic spaces which represent 1 there is a characterization of hermitian compositions in the language of algebras-with-involutions using the even Clifford algebra. We extend this notion to define a generalized composition based on…
We study a class of inverse monoids of the form M = Inv< X | w=1 >, where the single relator w has a combinatorial property that we call sparse. For a sparse word w, we prove that the word problem for M is decidable. We also show that the…
Combining the techniques of approximation algorithms and parameterized complexity has long been considered a promising research area, but relatively few results are currently known. In this paper we study the parameterized approximability…
We present a simple proof of the all-order exponentiation of soft logarithmic corrections to hard processes in perturbative QCD. Our argument is based on proving that all large logs in the soft limit can be expressed in terms of a single…
This paper introduces and studies a categorical analogue of the familiar monoid semiring construction. By introducing an axiomatisation of summation that unifies notions of summation from algebraic program semantics with various notions of…
In this paper we give a combinatorial description of the renormlization limits of infinitely renormalizable unimodal maps with {\it essentially bounded} combinatorics admitting quadratic-like complex extensions. As an application we…
We study arithmetic properties of factorizations of elements into products of generators, in monoids given with explicit presentations. After relating and comparing this perspective to the more usual approach of factoring into products of…