相关论文: Coloured stochastic vertex models and their spectr…

We prove a color-position symmetry for a class of ASEP-like interacting particle systems with discrete time on the one-dimensional lattice. The full space-time inhomogeneity of our systems allows to apply the result to colored (or…

Recent papers in solvable lattice models emphasize models where states can be visualized as colored paths through the lattice. We define a bosonic model in which there are two types of colors, one whose paths move down and to the right, the…

We describe how to construct a spanning set of linearly-independent, automatically orthogonal colour tensors for scattering amplitudes involving coloured particles transforming under arbitrary representations of any gauge theory, sufficient…

The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…

We define vertex-colourings for edge-partitioned digraphs, which unify the theory of P-partitions and proper vertex-colourings of graphs. We use our vertex-colourings to define generalized chromatic functions, which merge the chromatic…

This paper examines vertex colorings of graphs with constraints on the distribution of colors in vertex neighborhoods. We introduce color 2-switches and color degree matrices. The color degree matrix of a $k$-colored graph is an analog of…

We develop the theory of colored bosonic models (initiated by Borodin and Wheeler). We will show how a family of such models can be used to represent the values of Iwahori vectors in the "spherical model" of representations of $GL_r(F)$,…

In this note, we consider the six-vertex model with domain wall boundary conditions, defined on a $M\times M$ lattice, in the inhomogeneous case where the partition function depends on 2M inhomogeneities $\lambda_j$ and $\mu_k$. For a…

In this paper we consider coloring problems on graphs and other combinatorial structures on standard Borel spaces. Our goal is to obtain sufficient conditions under which such colorings can be made well-behaved in the sense of topology or…

Colour vision has long fascinated scientists, who have sought to understand both the physiology of the mechanics of colour vision and the psychophysics of colour perception. We consider representations of colour in anatomically constrained…

Binary relations derived from labeled rooted trees play an import role in mathematical biology as formal models of evolutionary relationships. The (symmetrized) Fitch relation formalizes xenology as the pairs of genes separated by at least…

In this paper we present a new series of 3-dimensional integrable lattice models with $N$ colors. The case $N=2$ generalizes the elliptic model of our previous paper. The weight functions of the models satisfy modified tetrahedron equations…

We consider probability measures arising from the Cauchy summation identity for the LLT (Lascoux--Leclerc--Thibon) symmetric polynomials of rank $n \geq 1$. We study the asymptotic behaviour of these measures as one of the two sets of…

The Four color problem is closely related to other branches of mathematics and practical applications. More than 20 of its reformulations are known, which connect this problem with problems of algebra, statistical mechanics and planning.…

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…

This work is concerned with variational analysis of so-called spectral functions and spectral sets of matrices that only depend on eigenvalues of the matrix. Based on our previous work [H. T. B\`ui, M. N. B\`ui, and C. Clason, Convex…

Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes. To apply lifted inference, a lifted representation has to be obtained, and to do so,…

In this article, we study eigenvalue functions of varying transition probability matrices on finite, vertex transitive graphs. We prove that the eigenvalue function of an eigenvalue of fixed higher multiplicity has a critical point if and…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

We investigate the spectral function of Bloch states in an one-dimensional tight-binding non-interacting chain with two different models of static correlated disorder, at zero temperature. We report numerical calculations of the…