We prove several colorful generalizations of classical theorems in discrete geometry. Moreover, the colorful generalization of Kirchberger’s theorem gives a generalization of the theorem of Tverberg on non-separated partitions.

Field theory on a fuzzy noncommutative sphere can be considered as a particular matrix approximation of field theory on the standard commutative sphere. We investigate from this point of view the scalar φ theory. We demonstrate that the UV/IR mixing problems of this theory are localized to the tadpole diagrams and can be removed by an appropiate (fuzzy) normal ordering of the φ vertex. The pert...

The local chromatic number of a graph G is the number of colors appearing in the most colorful closed neighborhood of a vertex minimized over all proper colorings of G. We show that two specific topological obstructions that have the same implications for the chromatic number have different implications for the local chromatic number. These two obstructions can be formulated in terms of the hom...

Plumage coloration in birds plays a critical role in communication and can be under selection throughout the annual cycle as a sexual and social signal. However, for migratory birds, little is known about the acquisition and maintenance of colorful plumage during the nonbreeding period. Winter habitat could influence the quality of colorful plumage, ultimately carrying over to influence sexual ...

To contribute to young children's development, sensory enrichment is often provided via colorful play areas. However, little is known about the effects of colorful environments on children while they engage in age-appropriate tasks and games. Studies in adults suggest that aspects of color can distract attention and impair performance, and children are known to have less developed attentional a...

Kierstead, H.A. and W.T. Trotter. Colorful induced subgraphs, Discrete Mathematics 101 (1992) 165-169. A colored graph is a graph whose vertices have been properly, though not necessarily optimally colored, with integers. Colored graphs have a natural orientation in which edges are directed from the end point with smaller color to the end point with larger color. A subgraph of a colored graph i...

We present a new methodology to create colorful textile antennas that can be embroidered within logos or other aesthetic shapes. Conductive threads (e-threads) have already been used in former embroidery unicolor approaches as attributed to the corresponding conductive material, viz. silver or copper. But so far, they have not been adapted to ‘print’ colorful textile antennas. For the first tim...