Related papers: Solution to a combinatorial puzzle arising from Ma…
Motivated by recent work of Hanser and Mayers, we study two combinatorial puzzles arising from the theory of Kohnert polynomials. Such polynomials are defined as generating polynomials for certain collections of diagrams consisting of unit…
To any nodal curve $C$ is associated the degree class group, a combinatorial invariant which plays an important role in the compactification of the generalised Jacobian of $C$ and in the construction of the N\'eron model of the Picard…
The clustering of a graph coloring is the maximum size of monochromatic components. This paper studies colorings with bounded clustering in graph classes with bounded layered treewidth, which include planar graphs, graphs of bounded Euler…
We give closed form expressions for the numbers of multi-rooted plane trees with specified degrees of root vertices. This results in an infinite number of integer sequences some of which are known to have an alternative interpretation. We…
We first consider the growth of trees by probabilistic attachment of new vertices to leaves. This leads to a growth model based on vertex clusters and probabilities assigned to clusters. This model turns out to be readily applicable to…
In the graph clustering problem with a planted solution, the input is a graph on $n$ vertices partitioned into $k$ clusters, and the task is to infer the clusters from graph structure. A standard assumption is that clusters induce…
This paper explores Iwasawa theory from a graph theoretic perspective, focusing on the algebraic and combinatorial properties of Cayley graphs. Using representation theory, we analyze Iwasawa-theoretic invariants within…
We give a new interpretation of the chromatic polynomial of a simple graph G in terms of the Kac-Moody Lie algebra with Dynkin diagram G. We show that the chromatic polynomial is essentially the q-Kostant partition function of this Lie…
The deep interconnection between linear algebra and graph theory allows one to interpret classical matrix invariants through combinatorial structures. To each square matrix A over a commutative ring K, one can associate a weighted directed…
Bayesian nonparametric mixture models are common for modeling complex data. While these models are well-suited for density estimation, recent results proved posterior inconsistency of the number of clusters when the true number of…
Tanglegrams are a special class of graphs appearing in applications concerning cospeciation and coevolution in biology and computer science. They are formed by identifying the leaves of two rooted binary trees. We give an explicit formula…
Barycentric coordinates provide solutions to the problem of expressing an element of a compact convex set as a convex combination of a finite number of extreme points of the set. They have been studied widely within the geometric…
We propose a new generalization of the Yang-Baxter equation, where the R-matrix depends on cluster $y$-variables in addition to the spectral parameters. We point out that we can construct solutions to this new equation from the…
In this article we replace the semi-heuristic derivation of the Rosenfeld functional of hard convex particles with the systematic calculation of Mayer clusters. It is shown that each cluster integral further decomposes into diagrams of…
An important problem in the theory of cluster algebras is to compute the fundamental group of the exchange graph. A non-trivial closed loop in the exchange graph, for example, generates a non-trivial identity for the classical and quantum…
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…
The matching polynomial of a graph encodes rich combinatorial information through its roots. We determine the maximum multiplicity of a non-zero matching polynomial root and characterize all graphs attaining the bound. We also generalize…
We show that sums over graphs such as appear in the theory of Feynman diagrams can be seen as integrals over discrete groupoids. From this point of view, basic combinatorial formulas of the theory of Feynman diagrams can be interpreted as…
A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq…
Graph-based clustering methods have demonstrated the effectiveness in various applications. Generally, existing graph-based clustering methods first construct a graph to represent the input data and then partition it to generate the…