Related papers: Polygraphs of finite derivation type
The criteria for determining graph isomorphism are crucial for solving graph isomorphism problems. The necessary condition is that two isomorphic graphs possess invariants, but their function can only be used to filtrate and subdivide…
The main theorem shows that if M is an irreducible compact connected orientable 3-manifold with non-empty boundary, then the classifying space BDiff(M rel dM) of the space of diffeomorphisms of M which restrict to the identity map on…
We will study the presentations of fundamental groups of the complement of complexified real affine line arrangements that do not contain two parallel lines. By Yoshinaga's minimal presentation, we can give positive homogeneous…
Graph pattern matching is a routine process for a wide variety of applications such as social network analysis. It is typically defined in terms of subgraph isomorphism which is NP-Complete. To lower its complexity, many extensions of graph…
Testing isomorphism of infinite groups is a classical topic, but from the complexity theory viewpoint, few results are known. S{\'e}nizergues and the fifth author (ICALP2018) proved that the isomorphism problem for virtually free groups is…
Providing an abstract representation of natural and human complex structures is a challenging problem. Accounting for the system heterogenous components while allowing for analytical tractability is a difficult balance. Here I introduce…
We use Polyak's skein relation to give a new proof that Milnor's string link homotopy invariants are finite type invariants, and to develop a recursive relation for their associated weight systems. We show that the obstruction to the…
Inspired by the reconstruction program of conformal field theories of Vaughan Jones we recently introduced a vast class of so called forest-skein groups. They are built from a skein presentation: a set of colours and a set of pairs of…
A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected…
Finite monoids that generate monoid varieties with uncountably many subvarieties seem rare, and surprisingly, no finite monoid is known to generate a monoid variety with countably infinitely many subvarieties. In the present article, it is…
It is well-known that characters classify linear representations of finite groups, that is if characters of two representations of a finite group are the same, these representations are equivalent. It is also well-known that, in general,…
For any acyclic quiver $Q$ without multiple edges, we construct a monoidal category $\mathcal{R}_Q$ whose indecomposable objects are tensor products (over the base field) of finite-dimensional modules over the path algebra of $Q$. We show…
We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…
A monoid structure on families of representations of a quiver is introduced by taking extensions of representations in families, i.e. subvarieties of the varieties of representations. The study of this monoid leads to interesting…
We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In…
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…
Milner's bigraphs are a general framework for reasoning about distributed and concurrent programming languages. Notably, it has been designed to encompass both the pi-calculus and the Ambient calculus. This paper is only concerned with…
We introduce group actions on polyfolds and polyfold bundles. We prove quotient theorems for polyfolds, when the group action has finite isotropy. We prove that the sc-Fredholm property is preserved under quotient if the base polyfold is…
Cubic complexes appear in the theory of finite type invariants so often that one can ascribe them to basic notions of the theory. In this paper we begin the exposition of finite type invariants from the `cubic' point of view. Finite type…
An intense activity is nowadays devoted to the definition of models capturing the properties of complex networks. Among the most promising approaches, it has been proposed to model these graphs via their clique incidence bipartite graphs.…