Related papers: Ken's colorful questions
We say that a vertex or edge colouring of a graph is distinguishing if the only automorphism that preserves this colouring is the identity. A (proper) distinguishing colouring is irreducible if there is no possibility of merging two…
Quantum information is about the entanglement of states. To this starting point we add parameters whereby a single state becomes a non-vanishing section of a bundle. We consider through examples the possible entanglement patterns of…
For complete graphs and n-cubes bounds are found for the possible number of colours in an interval edge colourings.
Sudoku grids can be thought of as graphs where the vertices are the squares of the grid, and edges join vertices in the same row, column, or sub-grid. A Sudoku puzzle corresponds to a partial proper coloring of the Sudoku graph. We provide…
Since many real-world concepts are associated with colour, for example danger with red, linguistic information is often complimented with the use of appropriate colours in information visualization and product marketing. Yet, there is no…
In this paper, we study the properties of the colored HOMFLY polynomials via HOMFLY skein theory. We prove some limit behaviors and symmetries of the colored HOMFLY polynomial predicted in some physicists' recent works.
This paper is devoted to the description of the evolution of states of quantum many-particle systems within the framework of a one-particle density operator, which enables to construct the kinetic equations in scaling limits in the presence…
We completely revised the paper after the referee's comments. In the new version, we replaced two erroneous examples, studied a link with earlier work of Koh and Stilmann, and strengthened the main theorem.
The status of the theory of color confinemnt is discussed.
The prop formalism allows representation of processes withstring diagrams and has been successfully applied in various areas such as quantum computing, electric circuits and control flow graphs. However, these graphical approaches suffer…
We define a $P$-compelling coloring as a proper coloring of the vertices of a graph such that every subset consisting of one vertex of each color has property $P$. The $P$-compelling chromatic number is the minimum number of colors in such…
Topics in the description of the properties of charmonium states are reviewed with an emphasis on specific theoretical ideas and methods of relating those properties to the underlying theory of Quantum Chromodynamics.
In this paper, we prove lower and upper bounds on the achromatic and the pseudoachromatic indices of the $n$-dimensional finite projective space of order $q$.
Colour is a key component in the successful dissemination of information. Since many real-world concepts are associated with colour, for example danger with red, linguistic information is often complemented with the use of appropriate…
A theory about the implication structure in graph coloring is presented. Discovering hidden relations is a crucial activity in every scientific discipline. The development of mathematical models to study and discover such hidden relations…
I discuss recent developments in our understanding of the color-superconducting phases of cold, dense quark matter. I describe the phase diagram as a function of density and the strange quark mass, and outline some ideas about possible…
The properties of coherence and polarization of light has been the subject of intense investigations and form the basis of many technological applications. These concepts which historically have been treated independently can now be…
I give a summary of Section E of the sixth edition of the Conference "Quark confinement and the hadron spectrum". Papers were presented on different subjects, from spectroscopy, including pentaquarks and hadron structure, to new physics…
A collection of short expository essays by the author on various topics in quantum mechanics, quantum cosmology, and physics in general.
We seek conditions under which colorings of various vector spaces are guaranteed to have a copy of a unit equilateral triangle, having each vertex in a different color class. In particular, we explore the analogous question in the setting…