Related papers: Trees, graphs and aggregates: a categorical perspe…
Counting non-isomorphic tree-like multigraphs that include self-loops and multiple edges is an important problem in combinatorial enumeration, with applications in chemical graph theory, polymer science, and network modeling. Traditional…
In this article, we extend several algebraic graph analysis methods to bipartite networks. In various areas of science, engineering and commerce, many types of information can be represented as networks, and thus the discipline of network…
To a noncompact orientable surface with no closed boundary, we associate the sum of Fukaya categories of (Liouville sectors associated to) its symmetric powers. We construct sectorial covers with the combinatorics of the bar resolution to…
In the CHY-frame for the tree-level amplitudes, the bi-adjoint scalar theory has played a fundamental role because it gives the on-shell Feynman diagrams for all other theories. Recently, an interesting generalization of the bi-adjoint…
There is a construction which lies at the heart of descent theory. The combinatorial aspects of this paper concern the description of the construction in all dimensions. The description is achieved precisely for strict n-categories and…
We use tools from free probability to study the spectra of Hermitian operators on infinite graphs. Special attention is devoted to universal covering trees of finite graphs. For operators on these graphs we derive a new variational formula…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
An impressive effort is being placed in order to develop new strategies that allow an efficient computation of multi-loop multi-leg Feynman integrals and scattering amplitudes, with a particular emphasis on removing spurious singularities…
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…
We develop a notion of a dual of a graph, generalizing the definition of Goulden and Yong (which only applied to trees), and reproving their main result using our new notion. We in fact give three definitions of the dual: a graph-theoretic…
A grove is a spanning forest of a planar graph in which every component tree contains at least one of a special subset of vertices on the outer face called nodes. For the natural probability measure on groves, we compute various connection…
We consider the problem of enumeration of planar maps and revisit its one-matrix model solution in the light of recent combinatorial techniques involving conjugated trees. We adapt and generalize these techniques so as to give an…
The paper is devoted to the mathematical aspects of topological quantum field theory and its applications to enumerative problems of algebraic geometry. In particular, it contains an axiomatic treatment of Gromov-Witten classes, and a…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
From the standard procedure for constructing Feynman vacuum graphs in $\phi^4$ theory from the generating functional $Z$, we find a relation with sets of certain combinatorial matrices, which allows us to generate the set of all Feynman…
We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular…
In 1966, Cummins introduced the "tree graph": the tree graph $\mathbf{T}(G)$ of a graph $G$ (possibly infinite) has all its spanning trees as vertices, and distinct such trees correspond to adjacent vertices if they differ in just one edge,…
To any real rational function with generic ramification points we assign a combinatorial object, called a garden, which consists of a weighted labeled directed planar chord diagram and of a set of weighted rooted trees each corresponding to…
In this short review we introduce group field theory, a particular class of random tensor models, which represents nowadays one of the candidates for a fundamental theory of quantum gravity. We insist on the combinatorial richness of…