Related papers: {\Gamma}-species, quotients, and graph enumeration
We study the problem of connecting the parts of a multipartite graph using a minimum number of edges under a matching constraint. We introduce interconnection trees, defined as matchings whose projections onto the quotient graph form a…
We investigate exponential families of random graph distributions as a framework for systematic quantification of structure in networks. In this paper we restrict ourselves to undirected unlabeled graphs. For these graphs, the counts of…
The origin of diversification and coexistence of genes and species have been traditionally studied in isolated biological levels. Ecological and evolutionary views have focused on the mechanisms that enable or constrain species coexistence,…
In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these…
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…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
In this paper, we generalize 2-trees by replacing triangles by quadrilaterals, pentagons or $k$-sided polygons ($k$-gons), where $k\geq 3$ is fixed. This generalization, to $k$-gonal 2-trees, is natural and is closely related, in the planar…
We investigate the "stratified Ehrhart ring theory" for periodic graphs, which gives an algorithm for determining the growth sequences of periodic graphs. The growth sequence $(s_{\Gamma, x_0, i})_{i \ge 0}$ is defined for a graph $\Gamma$…
Starting categorically, we give simple and precise models of equivariant classifying spaces. We need these models for work in progress in equivariant infinite loop space theory and equivariant algebraic K-theory, but the models are of…
We describe a generating tree approach to the enumeration and exhaustive generation of k-nonnesting set partitions and permutations. Unlike previous work in the literature using the connections of these objects to Young tableaux and…
This paper summarizes our latest understanding and results about the application of the Mathematics Of Enumeration to Tanner Graphs that have a regular structure called Balanced Tanner Graphs. Some preliminaries of permutation groups have…
A power law degree distribution is established for a graph evolution model based on the graph class of k-trees. This k-tree-based graph process can be viewed as an idealized model that captures some characteristics of the preferential…
An algebraic formalism, developped with V. Glaser and R. Stora for the study of the generalized retarded functions of quantum field theory, is used to prove a factorization theorem which provides a complete description of the generalized…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
This paper focuses on the characterization of $\aleph_0$-categorical theories of trees in the following sense: for any $\aleph_0$-cateorical theory $T$ of trees there is a tree plan $\Gamma$ such that $T=Th(\Gamma(\omega))$ where…
Let $G$ denote a countable inverse semigroup. We construct a kind of a Baum--Connes map $K(\tilde A \rtimes G) \rightarrow K(A \rtimes G)$ by a categorial approach via localization of triangulated categories, developed by R. Meyer and R.…
We develop a generalised gauge theory in which the role of gauge group is played by a coalgebra and the role of principal bundle by an algebra. The theory provides a unifying point of view which includes quantum group gauge theory,…
It is proved that the assembly map in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups $\Gamma$ with finite quotient finite decomposition complexity (a strengthening of finite decomposition…
In this sequel to my previous paper, "Is String Theory in Knots?" I explore ways of constructing symmetries through an algebraic stepping process using knotted graphs. The hope is that this may lead to an algebraic formulation of string…
For an abelian group $\Gamma$, a $\Gamma$-labelled graph is a graph whose vertices are labelled by elements of $\Gamma$. We prove that a certain collection of edge sets of a $\Gamma$-labelled graph forms a delta-matroid, which we call a…