Related papers: The categorical graph minor theorem
We follow the same technics we used before in \cite{AZ} of extending knot Floer homology to embedded graphs in a 3-manifold, by using the Kauffman topological invariant of embedded graphs by associating family of links and knots to a such…
In this short paper, we establish the local Noetherian property for the linear categories of Brauer, partition algebras, and other related categories of diagram algebras with no restrictions on their various parameters.
The Graph Minors Structure Theorem of Robertson and Seymour asserts that, for every graph $H,$ every $H$-minor-free graph can be obtained by clique-sums of ``almost embeddable'' graphs. Here a graph is ``almost embeddable'' if it can be…
We introduce cohomology and homology theories for small categories with general coefficient systems from simplex categories first studied by Thomason. These theories generalize at once Baues-Wirsching cohomology and homology and other more…
A graph is nearly embedded in a surface if it consists of graph $G_0$ that is embedded in the surface, together with a bounded number of vortices having no large transactions. It is shown that every large wall (or grid minor) in a nearly…
We develop a structural approach to simultaneous embeddability in temporal sequences of graphs, inspired by graph minor theory. Our main result is a classification theorem for 2-connected temporal sequences: we identify five obstruction…
One of the major results of [N. Robertson and P. D. Seymour. Graph minors. XIII. The disjoint paths problem. J. Combin. Theory Ser. B, 63(1):65--110, 1995], also known as the weak structure theorem, revealed the local structure of graphs…
A cornerstone theorem in the Graph Minors series of Robertson and Seymour is the result that every graph $G$ with no minor isomorphic to a fixed graph $H$ has a certain structure. The structure can then be exploited to deduce far-reaching…
Let $\mathcal{A}$ be a locally noetherian Grothendieck category. In this paper we define and study the section functor on $\mathcal{A}$ with respect to an open subset of ASpec$\mathcal{A}$. Next we define and study local cohomology theory…
Local cohomology functors are constructed for the category of cohomological functors on an essentially small triangulated category T equipped with an action of a commutative noetherian ring. This is used to establish a local-global…
The use of homological and homotopical devices, such as Tor and Andr\'e-Quillen homology, have found substantial use in characterizing commutative algebras. The primary category setting has been differentially graded algebras and modules,…
The goal of this expository article, based on a lecture I gave at the 2016 ICRA, is to explain some recent applications of "categorical symmetries" in topology and algebraic geometry with an eye toward twisted commutative algebras as a…
We extend the theory of combinatorial link Floer homology to a class of oriented spatial graphs called transverse spatial graphs. To do this, we define the notion of a grid diagram representing a transverse spatial graph, which we call a…
We study generalized splines from the perspective of the representation theory of the category of graphs with contractions. Our main theorem proves a kind of finite generation, which in turn implies the existence of a ``universal generating…
We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…
Treewidth is a well-known graph invariant with multiple interesting applications in combinatorics. On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth. On…
The method of constructing of Grothendieck's topology basing on a neighbourhood grammar, defined on the category of syntax diagrams is described in the article. Syntax diagrams of a formal language are the multigraphs with nodes, signed by…
One of the key results in Robertson and Seymour's seminal work on graph minors is the Grid-Minor Theorem (also called the Excluded Grid Theorem). The theorem states that for every grid $H$, every graph whose treewidth is large enough…
A graph is apex if it can be made planar by deleting a vertex, that is, $\exists v$ such that $G-v$ is planar. We define the related notions of edge apex, $\exists e$ such that $G-e$ is planar, and contraction apex, $\exists e$ such that…
We rewrite classical topological definitions using the category-theoretic notation of arrows and are led to concise reformulations in terms of simplicial categories and orthogonality of morphisms, which we hope might be of use in the…