Related papers: Coloring complexes and arrangements
We generalize some previous results on random polynomials in several complex variables. A standard setting is to consider random polynomials $H_n(z):=\sum_{j=1}^{m_n} a_jp_j(z)$ that are linear combinations of basis polynomials $\{p_j\}$…
Link/knot invariants are series with integer coefficients, and it is a long-standing problem to get them positive and possessing cohomological interpretation. Constructing positive "superpolynomials" is not straightforward, especially for…
Color-ordered amplitudes for the scattering of n particles in the adjoint representation of SU(N) gauge theory satisfy constraints that arise from group theory alone. These constraints break into subsets associated with irreducible…
We introduce deformations of the space of (multi-diagonal) harmonic polynomials for any finite complex reflection group of the form W=G(m,p,n), and give supporting evidence that this space seems to always be isomorphic, as a graded…
The local magnetic moments of atoms in a molecule or solid can be designated by different colors. Magnetic groups, or 2-color groups, or black-and-white groups have been applied in crystallography to classify different magnets. Despite its…
In this short note we observe that recent results of Abert and Hubai and of Csikvari and Frenkel about Benjamini--Schramm continuity of the holomorphic moments of the roots of the chromatic polynomial extend to the theory of dense graph…
Gy\'arf\'as conjectured in 2011 that every $r$-edge-colored $K_n$ contains a monochromatic component of bounded ("perhaps three") diameter on at least $n/(r-1)$ vertices. Letzter proved this conjecture with diameter four. In this note we…
Radchenko and Villegas characterized the chordal graphs by the inverse of their independence polynomials being Horn hypergeometric series in Radchenko et al. in 2021. In this paper, we reprove their result using some elementary…
For each graph we construct graded cohomology groups whose graded Euler characteristic is the chromatic polynomial of the graph. We show the cohomology groups satisfy a long exact sequence which corresponds to the well-known…
Steingrimsson (2001) showed that the chromatic polynomial of a graph is the Hilbert function of a relative Stanley-Reisner ideal. We approach this result from the point of view of Ehrhart theory and give a sufficient criterion for when the…
At levels of laser intensity below threshold for multiphoton ionization, the parametric generation of optical harmonics in gases and other isotropic media is subject to selection rules with origins in angular momentum conservation. The…
In the present paper, we derive several conditions of linear combinations and convolutions of harmonic mappings to be univalent and convex in one direction, one of them gives a partial answer to an open problem proposed by Dorff. The…
We investigate color Lie rings over finite group algebras and their universal enveloping algebras. We exhibit these universal enveloping algebras as PBW deformations of skew group algebras: Every color Lie ring over a finite group algebra…
This is the first in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a finite graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…
Complex braid groups are the natural generalizations of braid groups associated to arbitrary (finite) complex reflection groups. We investigate several methods for computing the homology of these groups. In particular, we get the Poincar\'e…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
The irreducible decomposition of a unitary representation often contains continuous spectrum when restricted to a non-compact subgroup. The author singles out a nice class of branching problems where each irreducible summand occurs…
We define an (r,s)-coloring of an abstract simplicial complex to be a coloring using r colors of the vertices so that in any simplex at most s vertices have the same color. We translate the problem of finding an (r,s)-coloring of a given…
A decomposition of a non-empty simple graph $G$ is a pair $[G,P]$, such that $P$ is a set of non-empty induced subgraphs of $G$, and every edge of $G$ belongs to exactly one subgraph in $P$. The chromatic index $\chi'([G,P])$ of a…
A result of Gy\'arf\'as says that for every $3$-coloring of the edges of the complete graph $K_n$, there is a monochromatic component of order at least $\frac{n}{2}$, and this is best possible when $4$ divides $n$. Furthermore, for all…