Related papers: Polygraphs of finite derivation type
In this paper, we give a characterization of digraphs $Q, |Q|\leq 4$ such that the associated Hecke-Kiselman monoid $H_Q$ is finite. In general, a necessary condition for $H_Q$ to be a finite monoid is that $Q$ is acyclic and its Coxeter…
Graph products of monoids provide a common framework for free products and direct products. Trace monoids are graph products of finitely generated free monoids. We investigate the interaction of certain finitary conditions with graph…
A hypergraph can be obtained from a simplicial complex by deleting some non-maximal simplices. By [11], a hypergraph gives an associated simplicial complex. By [4], the embedded homology of a hypergraph is the homology of the infimum chain…
We prove a finiteness property of the values of the skein polynomial of homogeneous knots which allows to establish large classes of such knots to have arbitrarily unsharp Bennequin inequality (for the Thurston-Bennequin invariant of any of…
Clifford theory establishes a relation between the representation theory of a finite group and its normal subgroups. In this paper, we establish the Clifford theory for the modular representations of finite groups. The proofs are based on…
A special inverse monoid is one defined by a presentation where all the defining relations have the form $r = 1$. By a result of Ivanov Margolis and Meakin the word problem for such an inverse monoid can often be reduced to the word problem…
Given a presentation of a monoid $M$, combined work of Pride and of Guba and Sapir provides an exact sequence connecting the relation bimodule of the presentation (in the sense of Ivanov) with the first homology of the Squier complex of the…
Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…
We show that groups presented by inverse-closed finite convergent length-reducing rewriting systems are characterised by a striking geometric property: their Cayley graphs are geodetic and side-lengths of non-degenerate triangles are…
Larrauri and \v{Z}ivn\'y [ICALP'25/ACM ToCL'24] recently established a complete complexity classification of the problem of solving a system of equations over a monoid $N$ assuming that a solution exists over a monoid $M$, where both…
It is shown that a finitely generated branch group has Serre's property (FA) if and only if it does not surject onto the infinite cyclic group or the infinite dihedral group. An example of a finitely generated self-similar branch group…
Let R be a locally finitely generated algebra over a discrete valuation ring V of mixed characteristic. For any of the homological properties, the Direct Summand Theorem, the Monomial Theorem, the Improved New Intersection Theorem, the…
Rewriting methods have been developed for the study of coherence for algebraic objects. This consists in starting with a convergent presentation, and expliciting a family of generating confluences to obtain a coherent presentation -- one…
Let G be a connected reductive group defined over a finite field F_q. We give a parametrization of the irreducible representations of G(F_q) in terms of (twisted) categorical centres of various monoidal categories associated to G. (Results…
The aim of this paper is sketch a theory of divisibility and factorisation in topological monoids, where finite products are replaced by convergent products. The algebraic case can then be viewed as the special case of discretely…
Given a finite group G, let cd(G) denote the set of degrees of the irreducible complex characters of G. The character degree graph of G is defined as the simple undirected graph whose vertices are the prime divisors of the numbers in cd(G),…
It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
Let $\MP_d$ denote the space of polynomials $f: \C \to \C$ of degree $d\geq 2$, modulo conjugation by $\Aut(\C)$. Using properties of polynomial trees (as introduced in [DM, math.DS/0608759]), we show that if $f_n$ is a divergent sequence…
We prove that a group is presented by finite convergent length-reducing rewriting systems where each rule has left-hand side of length 3 if and only if the group is plain. Our proof goes via a new result concerning properties of embedded…
We prove Carlos Simpson's "semi-strictification" (or "weak unit") conjecture in the case of infinity-groupoids. More precisely, we introduce two precise versions of the conjecture, the "general" and the "regular" conjecture, involving two…