Related papers: Coloring complexes and arrangements
We generalize the notion of a coloring complex of a graph to linearized combinatorial Hopf monoids. We determine when a linearized combinatorial Hopf monoid has such a construction, and discover some inequalities that are satisfied by the…
The aim of this paper is to generalize the notion of the coloring complex of a graph to hypergraphs. We present three different interpretations of those complexes -- a purely combinatorial one and two geometric ones. It is shown, that most…
In recent work of Braden, Huh, Matherne, Proudfoot and Wang, a class of simplicial complexes associated to matroids, called augmented Bergman complexes, was introduced. The present article concerns the face enumeration of these complexes.…
Given a simplicial hyperplane arrangement H and a subspace arrangement A embedded in H, we define a simplicial complex Delta_{A,H} as the subdivision of the link of A induced by H. In particular, this generalizes Steingrimsson's coloring…
We study structural and topological properties of nested set complexes of matroids with arbitrary building sets, proving that these complexes are vertex decomposable and admit convex ear decompositions. These results unify and generalize…
J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…
A subspace arrangement defined by intersections of hyperplanes of the braid arrangement can be encoded by an edge colored hypergraph. It turns out that the characteristic polynomial of this type of subspace arrangement is given by a…
A colouring of a hypergraph's vertices is polychromatic if every hyperedge contains at least one vertex of each colour; the polychromatic number is the maximum number of colours in such a colouring. Its dual, the cover-decomposition number,…
The purpose of this paper is twofold. Firstly, we generalize the notion of characteristic polynomials of hyperplane and toric arrangements to those of certain abelian Lie group arrangements. Secondly, we give two interpretations for the…
This paper discusses ways to categorify chromatic, dichromatic and Penrose polynomials, including categorifications of integer evaluations of chromatic polynomials. We show that with an appropriate choice of variables the coefficients of…
The representation is essentially the same as that given by J.P.Nagle in J. Comb. Theory (B), 1971, 10:1, 42--59. The distinction is in the definition of the weighting function via the number of flows. This new definition allows one to…
We generalize the recently discovered planar decomposition (Kauffman bracket) for the HOMFLY polynomials of bipartite knot/link diagrams to (anti)symmetrically colored HOMFLY polynomials. Cabling destroys planarity, but it is restored after…
We first observe a mysterious similarity between the braid arrangement and the arrangement of all hyperplanes in a vector space over the finite field $\mathbb{F}_q$. These two arrangements are defined by the determinants of the Vandermonde…
We introduce ideas that complement the many known connections between polymatroids and graph coloring. Given a hypergraph that satisfies certain conditions, we construct polymatroids, given as rank functions, that can be written as sums of…
In this paper, we study the homology of the coloring complex and the cyclic coloring complex of a complete $k$-uniform hypergraph. We show that the coloring complex of a complete $k$-uniform hypergraph is shellable, and we determine the…
Let $G$ be a simple graph with $n$ vertices. The coloring complex $\Delta(G)$ was defined by Steingr\'{\i}msson, and the homology of $\Delta(G)$ was shown to be nonzero only in dimension $n-3$ by Jonsson. Hanlon recently showed that the…
A natural class of coloring complexes $X$ on closed manifold $M^n$ is investigated that gives a holonomy map $\mbox{Hol}_X: \pi_1(M) \to S_{n+1}$. By a $k$-multilayer complex construction the holonomy map may be defined to any finite…
A ring is a graph $R$ whose vertex set can be partitioned into $k \geq 4$ nonempty sets, $X_1, \dots, X_k$, such that for all $i \in \{1,\dots,k\}$, the set $X_i$ can be ordered as $X_i = \{u_i^1, \dots, u_i^{|X_i|}\}$ so that $X_i…
We primarily investigate the properties of characteristic polynomials of semimatroids. In particular, we provide a combinatorial interpretation of their coefficients, generalizing the Whitney's Broken Circuit Theorem. We also prove that the…
We give a complete combinatorial characterization of weakly $d$-Tverberg complexes. These complexes record which intersection combinatorics of convex hulls necessarily arise in any sufficiently large general position point set in $\mathbb…