Related papers: Polygraphs of finite derivation type
Graphons $W$ can be used as stochastic models to sample graphs $G_n$ on $n$ nodes for $n$ arbitrarily large. A graphon $W$ is said to have the $H$-property if $G_n$ admits a decomposition into disjoint cycles with probability one as $n$…
String diagrams are pictorial representations for morphisms of symmetric monoidal categories. They constitute an intuitive and expressive graphical syntax, which has found application in a very diverse range of fields including concurrency…
Semidefinite programming (SDP) provides a fundamental framework for studying properties of sum-of-squares (sos) representations of nonnegative polynomials. In this paper we study the quartic forms GF = (|x|^4 + F(x))/2 associated with…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
We prove that irreducible complex representations of finitely generated nilpotent groups are monomial if and only if they have finite weight, which was conjectured by Parshin. Note that we consider (possibly, infinite-dimensional)…
We prove a refinement of the tree packing theorem by Tutte/Nash-Williams for finite graphs. This result is used to obtain a similar result for end faithful spanning tree packings in certain infinite graphs and consequently to establish a…
We show that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time. We show that this class of hypergraphs is incomparable to…
We show that a finite coloring of an amenable group contains `many' monochromatic sets of the form $\{x,y,xy,yx\},$ and natural extensions with more variables. This gives the first combinatorial proof and extensions of Bergelson and…
In this survey we show how well known results about the Word Problem for finite group presentations can be generalized to the Word Problem and other decision problems for non-necessarily finite monoid and group presentations. This is done…
We prove that the inclusion from oriented graph complex into graph complex with at least one source is a quasi-isomorphism, showing that homology of the "sourced" graph complex is also equal to the homology of standard Kontsevich's graph…
We build on the recent characterisation of congruences on the infinite twisted partition monoids $\mathcal{P}_{n}^\Phi$ and their finite $d$-twisted homomorphic images $\mathcal{P}_{n,d}^\Phi$, and investigate their algebraic and…
We introduce homotopical methods based on rewriting on higher-dimensional categories to prove coherence results in categories with an algebraic structure. We express the coherence problem for (symmetric) monoidal categories as an…
We investigate Cayley graphs of finite semigroups and monoids. First, we look at semigroup digraphs, i.e., directed Cayley graphs of semigroups, and give a Sabidussi-type characterization in the case of monoids. We then correct a proof of…
We provide a finite equational presentation of graphs of treewidth at most three, solving an instanceof an open problem by Courcelle and Engelfriet. We use a syntax generalising series-parallel expressions, denoting graphs with a small…
Kontsevich conjectured that the number f(G,q) of zeros over the finite field with q elements of a certain polynomial connected with the spanning trees of a graph G is polynomial function of q. We have been unable to settle Kontsevich's…
Let X be a normal variety such that $K_X$ is Q-Cartier, and let $f: X \rightarrow X$ be a finite surjective morphism of degree at least two. We establish a close relation between the irreducible components of the locus of singularities that…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…
Traditionally, graph algorithms get a single graph as input, and then they should decide if this graph satisfies a certain property $\Phi$. What happens if this question is modified in a way that we get a possibly infinite family of graphs…
We introduce a sound and complete coinductive proof system for reachability properties in transition systems generated by logically constrained term rewriting rules over an order-sorted signature modulo builtins. A key feature of the…
Given a satisfiable instance of 1-in-3 SAT, it is NP-hard to find a satisfying assignment for it, but it may be possible to efficiently find a solution subject to a weaker (not necessarily Boolean) predicate than `1-in-3'. There is a…