Related papers: Non-unital polygraphs form a presheaf category
Given a fibration in groupoids d : D -> I, we define a fibered multicategory as a particular functor p : M -> I, where M has the same objects as D, and its arrows a : X -> Y should be thought of as families of arrows in the multicategory,…
We give a sufficient condition for an Ext-finite triangulated category to be saturated. Saturatedness means that every contravariant cohomological functor of finite type to vector spaces is representable. The condition consists in existence…
We propose a categorical framework to reason about scientific explanations: descriptions of a phenomenon meant to translate it into simpler terms, or into a context that has been already understood. Our motivating examples come from systems…
Adhesive categories provide an abstract framework for the algebraic approach to rewriting theory, where many general results can be recast and uniformly proved. However, checking that a model satisfies the adhesivity properties is sometimes…
In this paper, we first characterize which generalized lexicographic products are divisor graphs. As applications, we show that power graphs, reduced power graphs and order graphs are all divisor graphs, which also implies the main result…
We consider the possibility of semisimple tensor categories whose fusion rule includes exactly one noninvertible simple object. Conditions are given for the existence or nonexistence of coherent associative structures for such fusion rules,…
To every Poisson algebraic variety X over an algebraically closed field of characteristic zero, we canonically attach a right D-module M(X) on X. If X is affine, solutions of M(X) in the space of algebraic distributions on X are Poisson…
We find a set of generators for the automorphism group of a graph product of finitely generated abelian groups entirely from a certain labeled graph. In addition, we find generators for the important subgroup of star-automorphisms defined…
We study presheaves on semicategories enriched in a quantaloid: this gives rise to the notion of regular presheaf. A semicategory is regular when its representable presheaves are regular, and its regular presheaves then constitute an…
For a braided finite tensor category $\mathcal{C}$ with unit object $1 \in \mathcal{C}$, Lyubashenko considered a certain Hopf algebra $\mathbb{F} \in \mathcal{C}$ endowed with a Hopf pairing $\omega: \mathbb{F} \otimes \mathbb{F} \to 1$ to…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Semialgebraic graphs are graphs whose vertices are points in $\mathbb{R}^d$, and adjacency between two vertices is determined by the truth value of a semialgebraic predicate of constant complexity. We show how to harness polynomial…
We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…
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 simple criterion for an element of the mapping class group of a closed surface to have normal closure equal to the whole mapping class group. We apply this to show that every nontrivial periodic mapping class that is not a…
We consider large uniform labeled random graphs in different classes with few induced $P_4$ ($P_4$ is the graph consisting of a single line of $4$ vertices) which generalize the case of cographs. Our main result is the convergence to a…
We give a criterion for the existence of a non-degenerate quasihomogeneous polynomial in a configuration, i.e. in the space of polynomials with a fixed set of weights, and clarify the relation of this criterion to the necessary condition…
We prove a conjecture of Postnikov, Reiner and Williams by defining a partial order on the set of tree graphs with $n$ vertices that induces inequalities between the $\gamma$-polynomials of their associated graph-associahedra. The partial…
The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…