Related papers: Non-unital polygraphs form a presheaf category
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
We define a class of morphisms between strict $\omega$-categories called discrete Conduch{\'e} $\omega$-functors that generalize discrete Conduch{\'e} functors between 1-categories and we study their properties related to polygraphs. The…
This paper is originally designed as a part of revision of the author's preprint math.AG/9908174 "P-adic Schwarzian triangle groups of Mumford type". Recently, Yves Andr'e pointed out a flaw in that preprint; more precisely, Proposition II…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
The idea of applying isoperimetric functions to group theory is due to M.Gromov. We introduce the concept of a ``bicombing of narrow shape'' which generalizes the usual notion of bicombing. Our bicombing is related to but different from the…
Given a surface with boundary and some points on its boundary, a polygon diagram is a way to connect those points as vertices of non-overlapping polygons on the surface. Such polygon diagrams represent non-crossing permutations on a surface…
To directed graphs with unique sink and source we associate a noncommutative associative alsgebra and a polynomial over this algebra. Edges of the graph correspond to pseudo-roots of the polynomial. We give a sufficient condition when…
Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels…
We obtain the scaling limits of random graphs drawn uniformly in three families of intersection graphs: permutation graphs, circle graphs, and unit interval graphs. The two first families typically generate dense graphs, in these cases we…
We show that the fundamental groups of any two closed irreducible non-geometric graph-manifolds are quasi-isometric. This answers a question of Kapovich and Leeb. We also classify the quasi-isometry types of fundamental groups of…
We describe a category of Feynman graphs and show how it relates to compact symmetric multicategories (coloured modular operads) just as linear orders relate to categories and rooted trees relate to multicategories. More specifically we…
The implicit graph conjecture states that every sufficiently small, hereditary graph class has a labeling scheme with a polynomial-time computable label decoder. We approach this conjecture by investigating classes of label decoders defined…
Gross, Mansour and Tucker introduced the partial-dual orientable genus polynomial and the partial-dual Euler genus polynomial. They showed that the partial-dual genus polynomial for an orientable ribbon graph is interpolating and gave an…
From the polynomial approach to the definition of opetopes of Kock et al., we derive a category of opetopes, and show that its set-valued presheaves, or opetopic sets, are equivalent to many-to-one polygraphs. As an immediate corollary, we…
Let $(\mathcal C,\otimes,\mathbb 1)$ be an abelian symmetric monoidal category satisfying certain exactness conditions. In this paper we define a presheaf $\mathbb P^{n}_{\mathcal C}$ on the category of commutative algebras in $\mathcal C$…
We use the machinery of arXiv:2009.07539 to give an alternative proof of one of the main results of arXiv:2101.09775. This result states that the category of noncommutative CW-spectra can be modelled as the category of spectral presheaves…
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
We introduce the notion of a positive opetope and positive opetopic cardinals as certain finite combinatorial structures. The positive opetopic cardinals to positive-to-one polygraphs are like simple graphs to free omega-categories over…
We prove that the arrow category of a monoidal model category, equipped with the pushout product monoidal structure and the projective model structure, is a monoidal model category. This answers a question posed by Mark Hovey, and has the…