Related papers: Coloured stochastic vertex models and their spectr…
Colored lattice models can be used to describe many different types of special functions of interest in both algebraic combinatorics and representation theory, for example Schur polynomials, nonsymmetric Macdonald polynomials, and…
In this paper, we extend the chromatic symmetric function $X$ to a chromatic $k$-multisymmetric function $X_k$, defined for graphs equipped with a partition of their vertex set into $k$ parts. We demonstrate that this new function retains…
By designating vertices with variables, a simple undirected graph can be augmented to have an associated representing rational function in two variables taking the complex bi-upper halfplane to itself. We give relations between representing…
We study a generalization of the classical Hajnal-Szemer\'edi theorem to vertex-weighted graphs. Given a graph with nonnegative vertex weights, a coloring is called $\alpha$-approximately equitable up to one vertex ($\alpha$-EQ1) if, for…
We investigate Fair and Tolerant (FAT) graph colorings, a coloring framework in which each vertex is allowed to share its color with a prescribed fraction of its neighbors, while the remaining neighbors are required to be distributed evenly…
We introduce a four-parameter family of interacting particle systems on the line which can be diagonalized explicitly via a complete set of Bethe ansatz eigenfunctions, and which enjoy certain Markov dualities. Using this, for the systems…
The coloured Tverberg theorem was conjectured by B\'ar\'any, Lov\'{a}sz and F\"uredi and asks whether for any d+1 sets (considered as colour classes) of k points each in R^d there is a partition of them into k colourful sets whose convex…
Many variations of the classical graph coloring model have been intensively studied due to their multiple applications; scheduling problems and aircraft assignments, for instance, motivate the robust coloring problem. This model gets to…
A new set of exact scattering matrices in 1+1 dimensions is proposed by solving the bootstrap equations. Extending earlier constructions of colour valued scattering matrices this new set has its colour structure associated to non…
In the bond percolation model on a lattice, we colour vertices with $n_c$ colours independently at random according to Bernoulli distributions. A vertex can receive multiple colours and each of these colours is individually observable. The…
In this note, a novel BCS-type formalism is constructed in the framework of a schematic QCD inspired quark model, having in mind the description of color symmetrical superconducting states. The physical properties of the BCS vacuum (average…
We define the independence ratio and the chromatic number for bounded, self-adjoint operators on an L^2-space by extending the definitions for the adjacency matrix of finite graphs. In analogy to the Hoffman bounds for finite graphs, we…
We establish new algorithmic guarantees with matching hardness results for coloring and independent set problems in one-sided expanders and related classes of graphs. For example, given a $3$-colorable regular one-sided expander, we compute…
Chromatic symmetric functions are well-studied symmetric functions in algebraic combinatorics that generalize the chromatic polynomial and are related to Hessenberg varieties and diagonal harmonics. Motivated by the Stanley--Stembridge…
The authors study the spectral theory of self-adjoint operators that are subject to certain types of perturbations. An iterative introduction of infinitely many randomly coupled rank-one perturbations is one of our settings. Spectral…
We present formulas for the Clebsch-Gordan coefficients and the Racah coefficients for the root of unity representations ($N$-dimensional representations with $q^{2N}=1$) of $U_q(sl(2))$. We discuss colored vertex models and colored IRF…
Several authors modelled networks ad hoc by oriented or disoriented graphs, whereby the problem of allowance (allocation) of the frequencies at the level of the network was transformed into coloring problem of nodes in the graph. Graph…
For a fixed positive integer $t$, we consider the graph colouring problem in which edges at distance at most $t$ are given distinct colours. We obtain sharp lower bounds for the distance-$t$ chromatic index, the least number of colours…
Sample correlation matrices are employed ubiquitously in statistics. However, quite surprisingly, little is known about their asymptotic spectral properties for high-dimensional data, particularly beyond the case of "null models" for which…
We prove a "multiple colored Tverberg theorem" and a "balanced colored Tverberg theorem", by applying different methods, tools and ideas. The proof of the first theorem uses multiple chessboard complexes (as configuration spaces) and…