Related papers: Robert Grosseteste's colours
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 introduce the notion of a coloring of a poset, which consists of a labeling of the edges in its Hasse diagram by elements in a given group $G$. We use $G$-colorings to describe the covering maps of posets and present a new method based…
Two books, the "De Architectura" by Vitruvius and the "Naturalis Historia" by Pliny the Elder, give us a portrait of the Materials Science, that is, the knowledge of materials, in Rome at the beginning of the Empire. Here, I am reporting…
The Dense Hindman's Theorem states that, in any finite coloring of the integers, one may find a single color and a "dense" set $B_1$, for each $b_1\in B_1$ a "dense" set $B_2^{b_1}$ (depending on $b_1$), for each $b_2\in B_2^{b_1}$ a…
Beginning with a decomposition of the Newtonian field of gravity, I show that four classical color fields can be associated with the gravitational field. The meaning of color here is that these fields do not add up to yield the Newtonian…
We study compositions whose parts are colored by subsequences of the Fibonacci numbers. We give explicit bijections between Fibonacci colored compositions and several combinatorial objects, including certain restricted ternary and…
In 1999, at one of his last public lectures, Tutte discussed a question he had considered since the times of the Four Color Conjecture. He asked whether the 4-coloring complex of a planar triangulation could have two components in which all…
Color constancy and color illusion perception are two phenomena occurring in the human visual system, which can help us reveal unknown mechanisms of human perception. For decades computer vision scientists have developed numerous color…
Let $G$ be the unit distance graph in the plane. A well-known problem in combinatorial geometry is that of determining the chromatic number of $G$. It is known that $4\le \chi(G)\le 7$. The upper bound of 7 is obtained using tilings of the…
The investigation of colour symmetries for periodic and aperiodic systems consists of two steps. The first concerns the computation of the possible numbers of colours and is mainly combinatorial in nature. The second is algebraic and…
The problems studied in this article originate from the Graph Motif problem introduced by Lacroix et al. in the context of biological networks. The problem is to decide if a vertex-colored graph has a connected subgraph whose colors equal a…
The first colours photographs were created by a process introduced by Edmond Becquerel in 1848. The nature of these photochromatic images colours motivated a debate between scientists during the 19th century, which is still not settled. We…
Computational aesthetics is an emerging field of research which has attracted different research groups in the last few years. In this field, one of the main approaches to evaluate the aesthetic quality of paintings and photographs is a…
It has been common knowledge since 1950 that seven colours can be assigned to tiles of an infinite honeycomb with cells of unit diameter such that no two tiles of the same colour are closer than $d(7)=\frac{\sqrt{7}}{2}$ apart. Various…
W. T. Gower generalized Hindman's Finite sum theorem over $X_{k}=\left\{ \left(n_{1},n_{2},\ldots,n_{k}\right):n_{1}\neq0\right\} $ by showing that for any finite coloring of $X_{k}$ there exists a sequence such that the Gower subspace…
Color is an important aspect of any graphical user interface (GUI). Color is used to make a GUI attractive and meaningful. But there are difficulties in using colors too. Improper use of color can result in adverse effects. Wrong colors at…
I review the main features of the color charge degree of freedom in particle physics, sketch the paradox in the early quark model that led to color, give a personal perspective on the discovery of color and describe the introduction of the…
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article we did not give proofs, and instead asserted that we have…
Agarwal introduced $n$-color compositions in 2000 and most subsequent research has focused on restricting which parts are allowed. Here we focus instead on restricting allowed colors. After three general results, giving recurrence formulas…
Consider the graph $\mathbb{H}(d)$ whose vertex set is the hyperbolic plane, where two points are connected with an edge when their distance is equal to some $d>0$. Asking for the chromatic number of this graph is the hyperbolic analogue to…