Related papers: Polygraphs of finite derivation type

Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not incident with the outer face) have degrees larger than three. The planar…

There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$,…

We study the confluence property of abstract rewriting systems internal to cubical categories. We introduce cubical contractions, a higher-dimensional generalisation of reductions to normal forms, and employ them to construct cubical…

This paper is concerned with the final state problem for the homogeneous type nonlinear Schr\"odinger equation with time-decaying harmonic potential. The nonlinearity has the critical order and is not necessarily the form of a polynomial.…

We demonstrate how category theory provides specifications that can efficiently be implemented via imperative algorithms and apply this to the field of graph rewriting. By examples, we show how this paradigm of software development makes it…

We introduce a new one-variable polynomial invariant of graphs, which we call the skew characteristic polynomial. For an oriented simple graph, this is just the characteristic polynomial of its anti-symmetric adjacency matrix. For…

We prove results concerning the representation of a given distribution by means of a given random quantity. The existence of a solution to this problem is related to the notion of conglomerability, originally introduced by Dubins to study…

We consider a filtration on the cohomology of the structure sheaf indexed by (not necessarily reduced) divisors ``at infinity''. We show that the filtered pieces have transfers morphisms, fpqc descent, and are so called cube invariant. In…

Given a finite set of $2$-edge-coloured graphs $\mathcal F$ and a hereditary property of graphs $\mathcal{P}$, we say that $\mathcal F$ expresses $\mathcal{P}$ if a graph $G$ has the property $\mathcal{P}$ if and only if it admits a…

Let X(F,G) be the G-character variety of F where G is a rank 1 complex affine algebraic group and F is a finitely presentable discrete group. We describe an algorithm, which we implement in Mathematica, SageMath, and in Python, that takes a…

Many natural combinatorial problems can be expressed as constraint satisfaction problems. This class of problems is known to be NP-complete in general, but certain restrictions on the form of the constraints can ensure tractability. The…

In this paper we propose a new treatment about infinite dimensional manifolds, using the language of category and functor. Our definition of infinite dimensional manifolds is a natural generalization of finite dimensional manifolds in the…

We extend Campion's pasting theorem for $(\infty, n)$-categories to a larger class of polygraphs, called the directed complexes with frame-acyclic molecules. It follows, for instance, that this pasting theorem applies to any polygraph…

With the aim of derive a quasi-monomiality formulation in the context of discrete hypercomplex variables, one will amalgamate through a Clifford-algebraic structure of signature $(0,n)$ the umbral calculus framework with Lie-algebraic…

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

We prove that the cohomology ring of a finite-dimensional restricted Lie superalgebra over a field of characteristic $p > 2$ is a finitely-generated algebra. Our proof makes essential use of the explicit projective resolution of the trivial…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

This paper aims to use topological methods to compute $\mathrm{Ext}$ between an irreducible representation of a finite monoid inflated from its group completion and one inflated from its group of units, or more generally coinduced from a…

We define a subclass of separated graphs, the class of adaptable separated graphs, and study their associated monoids. We show that these monoids are primely generated conical refinement monoids, and we explicitly determine their associated…

A clover is a framed trivalent graph with some additional structure, embedded in a 3-manifold. We define surgery on clovers, generalizing surgery on Y-graphs used earlier by the second author to define a new theory of finite-type invariants…