N. Raghavendra
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to transition systems, which arise in the theory of concurrent computing.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
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 theoretical side, treewidth played an essential role in the proof of the celebrated Robertson-Seymour graph minor theorem. While defining treewidth-like invariants on graphs and treewidth analogues on other sorts of combinatorial objects (incl. hypergraphs, digraphs) has been a fruitful avenue of research, a direct, categorial description capturing mult…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we define an abstract analogue of tree-width which provides a uniform definition of various tree-width-like invariants including graph tree-width, hypergraph tree-width, complemented tree-width and even new constructions such as the tree-width of modular quotients. We obtain this generalization by developing a general theory of categories that admit abstract ana…
Measures on Cameron's treelike classes and applications to tensor categories
本文研究了Cameron树状类上的测度分类及其在张量范畴构造中的应用，证明了某些树类上不存在测度，并构造了超指数增长的半单张量范畴。
The incidence category $\C_{\F}$ of a family $\F$ of colored posets closed under disjoint unions and the operation of taking convex sub-posets was introduced by the author in \cite{Sz}, where the Ringel-Hall algebra $\H_{\F}$ of $\C_{\F}$ was also defined. We show that if the Hasse diagrams underlying $\F$ are rooted trees, then the subspace $\n_{\F}$ of primitive elements of $\H_{\F}$ carries a pre-Lie structure, defined over $\mathbb{Z}$, and with positive structure constants. We give several examples of $\n_{\F}$, including the nilpotent subalgebras of $\mathfrak{sl}_n$, $L \mathfrak{gl}_n$…
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for c not equal to c'. If we keep in place the latter axiom but allow for more than one morphism between objects, we can have a sort of generalized poset in which there are multiplicities attached to the covering relations, and possibly nontrivial automorphism groups. We call such a category an "updown category." In this paper we give a precise definition of such categories and develop a theory for them, which incorporates earlier notion…
Noetherian forms of free non-symmetric operads
本文研究带标签有限有根有序树范畴，通过正合性性质刻画其同构类，并证明附加严格初始对象后具有诺特形式。
We consider Hilbert series associated to modules over various categories of trees. Using the technology of Sam and Snowden, we show that these Hilbert series must be algebraic. We then apply these technical theorems to prove facts about certain natural generating functions associated to trees.
A poset can be regarded as a category in which there is at most one morphism between objects, and such that at most one of Hom(c,c') and Hom(c',c) is nonempty for distinct objects c,c'. If we keep in place the latter axiom but allow for more than one morphism between objects, we have a sort of generalized poset in which there are multiplicities attached to covering relations, and possibly nontrivial automorphism groups. We call such a category an "updown category". In this paper we give a precise definition of such categories and develop a theory for them. We also give a detailed account of te…
We study the category whose objects are trees (with or without roots) and whose morphisms are contractions. We show that the corresponding contravariant module categories are Noetherian, and we study two natural families of modules over these categories. The first takes a tree to a graded piece of the homology of its unordered configuration space, or to the homology of the unordered configuration space of its cone. The second takes a tree to a graded piece of the intersection homology of the reciprocal plane of its cone, which is a vector space whose dimension is given by a Kazhdan-Lusztig coe…
A family T of digraphs is a complete set of obstructions for a digraph H if for an arbitrary digraph G the existence of a homomorphism from G to H is equivalent to the non-existence of a homomorphism from any member of T to G. A digraph H is said to have tree duality if there exists a complete set of obstructions T consisting of orientations of trees. We show that if H has tree duality, then its arc graph delta H also has tree duality, and we derive a family of tree obstructions for delta H from the obstructions for H. Furthermore we generalise our result to right adjoint functors on categorie…
Lassos: Pushing Tree Decompositions Forward Along Homomorphisms
本文证明在保持分解形状的前提下，收缩是使树宽单调的唯一满射同态类，并提出 lasso 概念，将结论推广到多种组合数据结构。
There are Quillen equivalent Thomason model structures on the category of small categories, the category of small acyclic categories and the category of posets. These share the property that cofibrant objects are posets. In fact, they share the same class of cofibrant objects. We show that every finite semilattice, every chain, every countable tree, every finite zigzag and every poset with five or less elements is cofibrant in all of those structures.
We show that if a connected, Hom-finite, Krull-Schmidt triangulated category has an Auslander-Reiten quiver component with Dynkin tree class then the category has Auslander-Reiten triangles and that component is the entire quiver. This is an analogue for triangulated categories of a theorem of Auslander, and extends a previous result of Scherotzke. We also show that if there is a quiver component with extended Dynkin tree class, then other components must also have extended Dynkin class or one of a small set of infinite trees, provided there is a non-zero homomorphism between the components. T…
Taking a Feynman categorical perspective, several key aspects of the geometry of surfaces are deduced from combinatorial constructions with graphs. This provides a direct route from combinatorics of graphs to string topology operations via topology, geometry and algebra. In particular, the inclusion of trees into graphs and the dissection of graphs into aggregates yield a concise formalism for cyclic and modular operads as well as their polycyclic and surface type generalizations. The latter occur prominently in two-dimensional topological field theory and in string topology. The categorical v…
The multiplihedra {M_n} form a family of polytopes originating in the study of higher categories and homotopy theory. While the multiplihedra may be unfamiliar to the algebraic combinatorics community, it is nestled between two families of polytopes that certainly are not: the permutahedra {S_n} and associahedra {Y_n}. The maps between these families reveal several new Hopf structures on tree-like objects nestled between the Malvenuto-Reutenauer (MR) Hopf algebra of permutations and the Loday-Ronco (LR) Hopf algebra of planar binary trees. We begin their study here, constructing a module over …
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。