English
Related papers

Related papers: Colored Line Ensembles for Stochastic Vertex Model…

200 papers

We present a class of models in which the top quark, by mixing with new physics at a higher energy scale, is naturally heavier than the other standard model particles. We take this new physics to be extended color. Our models contain new…

High Energy Physics - Phenomenology · Physics 2007-05-23 Oscar F. Hernandez

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…

Metric Geometry · Mathematics 2012-04-24 Pablo Soberón

We study the connection between the three-color model and the polynomials $q_n(z)$ of Bazhanov and Mangazeev, which appear in the eigenvectors of the Hamiltonian of the XYZ spin chain. By specializing the parameters in the partition…

Mathematical Physics · Physics 2020-10-08 Linnea Hietala

We consider the problem of coloring Erdos-Renyi and regular random graphs of finite connectivity using q colors. It has been studied so far using the cavity approach within the so-called one-step replica symmetry breaking (1RSB) ansatz. We…

Disordered Systems and Neural Networks · Physics 2007-05-23 Florent Krzakala , Andrea Pagnani , Martin Weigt

Suppose that $nk$ points in general position in the plane are colored red and blue, with at least $n$ points of each color. We show that then there exist $n$ pairwise disjoint convex sets, each of them containing $k$ of the points, and each…

Combinatorics · Mathematics 2017-06-08 Andreas F. Holmsen , Jan Kynčl , Claudiu Valculescu

A line packing is optimal if its coherence is as small as possible. Most interesting examples of optimal line packings are achieving equality in some of the known lower bounds for coherence. In this paper two infinite families of real and…

Functional Analysis · Mathematics 2022-07-19 Ganzhinov Mikhail

In combinatorial problems it is sometimes possible to define a $G$-equivariant mapping from a space $X$ of configurations of a system to a Euclidean space $\mathbb{R}^m$ for which a coincidence of the image of this mapping with an…

Algebraic Topology · Mathematics 2008-07-10 Pavle V. M. Blagojevic , Aleksandra S. Dimitrijevic Blagojevic , John McCleary

This is the second in a sequence of three papers in which we prove the following generalization of Thomassen's 5-choosability theorem: Let $G$ be a graph embedded on a surface of genus $g$. Then $G$ can be $L$-colored, where $L$ is a…

Combinatorics · Mathematics 2024-03-22 Joshua Nevin

We examine maximum vertex coloring of random geometric graphs, in an arbitrary but fixed dimension, with a constant number of colors. Since this problem is neither scale-invariant nor smooth, the usual methodology to obtain limit laws…

Probability · Mathematics 2016-11-17 Sem Borst , Milan Bradonjić

At most how many (proper) q-colorings does a regular graph admit? Galvin and Tetali conjectured that among all n-vertex, d-regular graphs with 2d|n, none admits more q-colorings than the disjoint union of n/2d copies of the complete…

Combinatorics · Mathematics 2012-05-15 David Galvin

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

Combinatorics · Mathematics 2024-08-15 Irene Heinrich , Eda Kaja , Pascal Schweitzer

For a simple graph G = (V, E), a coloring of vertices of G using two colors, say red and blue, is called a quasi neighborhood balanced coloring if, for every vertex of the graph, the number of red neighbors and the number of blue neighbors…

Combinatorics · Mathematics 2026-05-18 Maurice Genevieva Almeida

For graph classes $P_1,...,P_k$, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph $G$ can be partitioned into subsets $V_1,...,V_k$ so that $V_j$ induces a graph in the class $P_j$…

Combinatorics · Mathematics 2007-05-23 Vladimir E. Alekseev , Alastair Farrugia , Vadim V. Lozin

We construct a set of Wigner 6j symbols with gluon lines (adjoint representations) in closed form, expressed in terms of similar 6j symbols with quark lines (fundamental representations). Together with Wigner 6j symbols with quark lines,…

High Energy Physics - Phenomenology · Physics 2024-09-24 Stefan Keppeler , Simon Plätzer , Malin Sjodahl

The goal of this paper is to show the existence (using probabilistic tools) of configurations of lines, boxes, and points with certain interesting combinatorial properties. (i) First, we construct a family of $n$ lines in $\mathbb{R}^3$…

Combinatorics · Mathematics 2023-10-27 István Tomon

Bowlin and Brin defined the class of color graphs, whose vertices are triangulated polygons compatible with a fixed four-coloring of the polygon vertices. In this article it is proven that each color graph has a vertex-induced embedding in…

Combinatorics · Mathematics 2018-07-03 Rui Pedro Carpentier , Roger Picken

A new two-parameter integrable model with quantum superalgebra $U_q[gl(3|1)]$ symmetry is proposed, which is an eight-state electron model with correlated single-particle and pair hoppings as well as uncorrelated triple-particle hopping.…

Strongly Correlated Electrons · Physics 2009-10-30 Xiang-Yu Ge , Mark D. Gould , Yao-Zhong Zhang , Huan-Qiang Zhou

We consider the implications of an extended color group, $SU\left( 3\right) _I\times SU\left( 3\right) _{II}$, spontaneously broken to $SU\left( 3\right) _c$ at a TeV or lower scale, for the hadronic colliders. The associated massive color…

High Energy Physics - Phenomenology · Physics 2009-10-28 D. A. Dicus , B. Dutta , S. Nandi

We construct representations of the quantum algebras ~$U_{q{\bf q}}(gl(n))$ and ~$U_{q{\bf q}}(sl(n))$~ which are in duality with the multiparameter quantum groups ~$GL_{q{\bf q}}(n)$, ~$SL_{q{\bf q}}(n)$,~ respectively. These objects…

Mathematical Physics · Physics 2024-04-16 V. K. Dobrev

We classify the trees on $n$ vertices with the maximum and the minimum number of certain generalized colorings, including conflict-free, odd, non-monochromatic, star, and star rainbow vertex colorings. We also extend a result of Cutler and…

Combinatorics · Mathematics 2018-12-19 John Engbers , Christopher Stocker