Related papers: Ken's colorful questions
Teaching color science to Electrical Engineering and Computer Science (EECS) students is critical to preparing them for advanced topics such as graphics, visualization, imaging, Augmented/Virtual Reality. Color historically receive little…
Let $K_n$ be the complete graph with $n$ vertices and $c_1, c_2, ..., c_r$ be $r$ different colors. Suppose we randomly and uniformly color the edges of $K_n$ in $c_1, c_2, ..., c_r$. Then we get a random graph, denoted by…
In this paper we consider a colouring version of the general position problem. The \emph{$\gp $-chromatic number} is the smallest number of colours needed to colour the vertices of the graph such that each colour class has the…
The emergence of Boris Struminsky's January, 1965 paper with a footnote that introduced a new quark quantum number now known as color caused a response [arXiv:0908.2772] that is seen, perhaps contrary to what it was intended to convey, to…
An urn contains balls of d colors. At each time, a ball is drawn and then replaced together with a random number of balls of the same color. Assuming that some colors are dominated by others, we prove central limit theorems. Some…
The problem of vertex coloring in random graphs is studied using methods of statistical physics and probability. Our analytical results are compared to those obtained by exact enumeration and Monte-Carlo simulations. We critically discuss…
One of the essential issues in decision problems and preference modeling is the number of comparisons and their pattern to ask from the decision maker. We focus on the optimal patterns of pairwise comparisons and the sequence including the…
In this paper, we introduce the notion of F-manifold color algebras and study their properties which extend some results for F-manifold algebras.
In this talk I discuss a recently proposed color superconducting phase of asymmetric quark matter where the up and down quark have different chemical potential, being in chemical equilibrium with electrons. Using Schwinger-Dyson equations…
In the first part, we introduce a notion a degree of edge-colorings of bicubic plane graphs and proves some local formula of the graded number of colorings. In the second part, we give a new proof of a result of Fisk saying that any two…
We introduce a new notion of resilience for constraint satisfaction problems, with the goal of more precisely determining the boundary between NP-hardness and the existence of efficient algorithms for resilient instances. In particular, we…
Let G be a combinatorial graph with vertices V and edges E. A proper coloring of G is an assignment of colors to the vertices such that no edge connects two vertices of the same color. These are the colorings considered in the famous Four…
A colored graph is a directed graph in which nodes or edges have been assigned colors that are not necessarily unique. Observability problems in such graphs consider whether an agent observing the colors of edges or nodes traversed on a…
This is an informal introduction to the ideas of decoherence and emergent classicality, including a simple account of the decoherent histories approach to quantum theory. It is aimed at undergraduates with a basic appreciation of quantum…
This is a review of the paper "Anomalies in Quantum Field Theory and Cohomologies of Configuration Spaces" (arXiv:0903.0187).
We briefly describe the structure and phenomenology of a flavor-universal extension of the strong interactions, focusing on the color-octet of massive gauge bosons (`colorons') present in the low-energy spectrum. We discuss current limits…
The first lecture provides an introduction to the physics of color superconductivity in cold dense quark matter. The main color superconducting phases are briefly described and their properties are listed. The second lecture covers recent…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
A brief overview of the status of color transparency experiments is presented. We report on the first complete calculations of color transparency within a perturbative QCD framework. We also comment on the underlying factorization method…
A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a…