Related papers: Non-unital polygraphs form a presheaf category

A simple undirected graph is said to be {\em semisymmetric} if it is regular and edge-transitive but not vertex-transitive. Every semisymmetric graph is a bipartite graph with two parts of equal size. It was proved in [{\em J. Combin.…

The main result of this paper utilizes the representation graph of a group $G$, $R(V,G)$, and gives a general construction of a diagrammatic category $\mathbf{Dgrams}_{R(V,G)}$. The proof of the main theorem shows that, given explicit…

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…

In the mid-1990s, two groups of authors independently obtained classifications of vertex-transitive graphs whose order is a product of two distinct primes. In the intervening years it has become clear that there is additional information…

A classic result in graph theory, due to Batson, Spielman, and Srivastava (STOC 2009) shows that every graph admits a $(1 \pm \varepsilon)$ cut (or spectral) sparsifier which preserves only $O(n / \varepsilon^2)$ reweighted edges. However,…

We define the graph minor category and prove that the category of contravariant representations of the graph minor category over a Noetherian ring is locally Noetherian. This can be regarded as a categorification of the Robertson--Seymour…

A new proof of the classification for tensor ideal thick subcategories of the bounded derived category, and the stable category, of modular representations of a finite group is obtained. The arguments apply more generally to yield a…

To a smooth and proper morphism $\mathcal{X}\to U$ with quasicompact semiseparated target we associate a sheaf in the \'etale topology, which takes an affine $U$-scheme $V$ to the set of $V$-linear semiorthogonal decompositions (of fixed…

In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…

We present a homotopy theory for a weak version of modular operads whose compositions and contractions are only defined up to homotopy. This homotopy theory takes the form of a Quillen model structure on the collection of simplicial…

A numerical semigroup $S$ is an additively-closed set of non-negative integers, and a factorization of an element $n$ of $S$ is an expression of $n$ as a sum of generators of $S$. It is known that for a given numerical semigroup $S$, the…

It is well known that not every finite group arises as the full automorphism group of some group. Here we show that the situation is dramatically different when considering the category of partial groups, ${{\mathcal P}art}$, as defined by…

A new approach to the construction of general persistent polyhierarchical classifications is proposed. It is based on implicit description of category polyhierarchy by a generating polyhierarchy of classification criteria. Similarly to…

We consider groups defined by non-empty balanced presentations with the property that each relator is of the form R(x,y), where x and y are distinct generators and R(.,.) is determined by some fixed cyclically reduced word R(a,b) that…

We consider large uniform labeled random graphs in different classes with prescribed decorations in their modular decomposition. Our main result is the estimation of the number of copies of every graph as an induced subgraph. As a…

We give a direct proof that the category of strict $\omega$-categories is monadic over the category of polygraphs.

We give a short topological proof of coherence for categorified non-symmetric operads by using the fact that the diagrams involved form the 1-skeleton of simply connected CW complexes. We also obtain a "one-step" topological proof of Mac…

A unicellular map is the embedding of a connected graph in a surface in such a way that the complement of the graph is a topological disk. In this paper we present a bijective link between unicellular maps on a non-orientable surface and…

For each infinite word over a given finite alphabet, we define an increasing sequence of rooted finite graphs, that can be thought as approximations of the famous Sierpinski carpet. These sequences naturally converge to an infinite rooted…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…