Related papers: Trees, graphs and aggregates: a categorical perspe…
For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…
We construct and study a class of algebras associated to generalized layered graphs, i.e. directed graphs with a ranking function on their vertices. Each finite directed acyclic graph admits countably many structures of a generalized…
When considering the number of subtrees of trees, the extremal structures which maximize this number among binary trees and trees with a given maximum degree lead to some interesting facts that correlate to other graphical indices in…
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. The distinguishing feature of these diagrams is that edges need not be connected to…
This is a new and short proof of the main theorem of classical structure tree theory. Namely, we show the existence of certain automorphism-invariant tree-decompositions of graphs based on the principle of removing finitely many edges. This…
Every generic linear functional $f$ on a convex polytope $P$ induces an orientation on the graph of $P$. From the resulting directed graph one can define a notion of $f$-arborescence and $f$-monotone path on $P$, as well as a natural graph…
We introduce polytopal cell complexes associated with partial acyclic orientations of a simple graph, which generalize acyclic orientations. Using the theory of cellular resolutions, two of these polytopal cell complexes are observed to…
Kontsevich introduced certain ribbon graphs as cell decompositions for combinatorial models of moduli spaces of complex curves with boundaries in his proof of Witten's conjecture. In this work, we define four types of generalised Kontsevich…
In recent years, the intersection of algebra, geometry, and combinatorics with particle physics and cosmology has led to significant advances. Central to this progress is the twofold formulation of the study of particle interactions and…
We introduce an approach to the categorification of rings, via the notion of distributive categories with negative objects, and use it to lay down categorical foundations for the study of super, quantum and non-commutative combinatorics.…
Tiered trees were introduced as a combinatorial object for counting absolutely indecomposable representation of certain quivers and torus orbit of certain homogeneous variety. In this paper, we define a bijection between the set of…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
There are several good reasons you might want to read about uniform spanning trees, one being that spanning trees are useful combinatorial objects. Not only are they fundamental in algebraic graph theory and combinatorial geometry, but they…
Representations of Spin groups and Clifford algebras derived from the structure of qubit trees are introduced in this work. For ternary trees the construction is more general and reduction to binary trees is formally defined by deletion of…
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…
We apply a theorem of Wick to rewrite certain classes of exponential measures on random graphs as integrals of Feynman-Gibbs type, on the real line. The analytic properties of these measures can then be studied in terms of phase…
This paper, following (Dymetman:1998), presents an approach to grammar description and processing based on the geometry of cancellation diagrams, a concept which plays a central role in combinatorial group theory (Lyndon-Schuppe:1977). The…
Given a graph and a representation of its fundamental group, there is a naturally associated twisted adjacency operator. The main result of this article is the fact that these operators behave in a controlled way under graph covering maps.…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…