Related papers: Non-unital polygraphs form a presheaf category
Following ideas of Lawvere and Linton we prove that classical varieties are precisely the exact categories with a varietal generator. This means a strong generator which is abstractly finite and regularly projective. An analogous…
In this paper, we introduce a family of tetravalent graphs called propeller graphs, denoted by $Pr_{n}(b,c,d)$. We then produce three infinite subfamilies and one finite subfamily of arc-transitive propeller graphs, and show that all such…
We introduce the notion of (co-)filtered sheaves on quotients of moment graphs by a group action. We then introduce a (co-)filtered version of the canonical sheaves of Braden and MacPherson and show that their global sections are the…
Hypergraph categories have been rediscovered at least five times, under various names, including well-supported compact closed categories, dgs-monoidal categories, and dungeon categories. Perhaps the reason they keep being reinvented is…
We consider two families of categories. The first is the family of semisimple quotients of H. Andersen's tilting module categories for quantum groups of Lie type $B$ specialized at odd roots of unity. The second consists of categories…
We classify the countable ultrahomogeneous 2-vertex-colored graphs in which the color classes are imprimitive, i.e., up to complementation they form disjoint unions of cliques. This generalizes work by Jenkinson, Lockett and Truss as well…
The notion of proof-net category defined in this paper is closely related to graphs implicit in proof nets for the multiplicative fragment without constant propositions of linear logic. Analogous graphs occur in Kelly's and Mac Lane's…
An $n$-sesquicategory is an $n$-globular set with strictly associative and unital composition and whiskering operations, which are however not required to satisfy the Godement interchange laws which hold in $n$-categories. In…
In enumerative combinatorics, it is often a goal to enumerate both labeled and unlabeled structures of a given type. The theory of combinatorial species is a novel toolset which provides a rigorous foundation for dealing with the…
Word-representable graphs, characterized by the existence of a semi-transitive orientation, form a well-studied class of graphs. Comparability graphs form another well-studied class and constitute a subclass of word-representable graphs.…
In this paper we introduce primigraph spaces, which are topological spaces together with a sheaf of $C^*$-algebras that can be covered by some Prim A's, that is, by the primitive spectra of some $C^*$-algebras endowed with Jacobson topology…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
The nonvanishing problem asks if a coefficient of a polynomial is nonzero. Many families of polynomials in algebraic combinatorics admit combinatorial counting rules and simultaneously enjoy having saturated Newton polytopes (SNP). Thereby,…
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…
A detailed proof is given of a theorem describing the centraliser of a transitive permutation group, with applications to automorphism groups of objects in various categories of maps, hypermaps, dessins, polytopes and covering spaces, where…
We introduce a new matroid (graph) invariant, the arboricity polynomial. Given a matroid, the arboricity polynomial enumerates the number of covers of the ground set by disjoint independent sets. We establish the polynomiality of the…
Unigraphs are graphs uniquely determined by their own degree sequence up to isomorphism. There are many subclasses of unigraphs such as threshold graphs, split matrogenic graphs, matroidal graphs, and matrogenic graphs. Unigraphs and these…
Gross, Mansour and Tucker introduced the partial-dual orientable genus polynomial and the partial-dual Euler genus polynomial. They computed these two partial-dual genus polynomials of four families of ribbon graphs, posed some research…
We study the representation category of thread quivers and their quotients. A thread quiver is a quiver in which some arrows have been replaced by totally ordered sets. Pointwise finite-dimensional (pwf) representations of such a thread…
Categories, n-categories, double categories, and multicategories (among others) all have similar definitions as collections of cells with composition operations. We give an explicit description of the information required to define any…