Related papers: Descartes-Newton-Young rainbow
This note is the written version of conversations with young colleagues on unofficial history, general ideas, unexpected facts and open problems concerning tilting theory.
Various approaches to quantum gravity such as string theory, loop quantum gravity and Horava-Lifshitz gravity predict modifications of the energy-momentum dispersion relation. Magueijo and Smolin incorporated the modified dispersion…
In Euclidean Ramsey Theory usually we are looking for monochromatic configurations in the Euclidean space, whose points are colored with a fixed number of colors. In the canonical version, the number of colors is arbitrary, and we are…
For a graph $G$, Chartrand et al. defined the rainbow connection number $rc(G)$ and the strong rainbow connection number $src(G)$ in "G. Charand, G.L. John, K.A. Mckeon, P. Zhang, Rainbow connection in graphs, Mathematica Bohemica,…
Let $\mathbf{G}:=(G_1, G_2, G_3)$ be a triple of graphs on the same vertex set $V$ of size $n$. A rainbow triangle in $\mathbf{G}$ is a triple of edges $(e_1, e_2, e_3)$ with $e_i\in G_i$ for each $i$ and $\{e_1, e_2, e_3\}$ forming a…
We introduce a notion of rainbow saturation and the corresponding rainbow saturation number. This is the saturation version of the rainbow Tur\'an numbers whose systematic study was initiated by Keevash, Mubayi, Sudakov, and Verstra\"ete.…
We study an anti-Ramsey extension of the classical Corr\'{a}di--Hajnal Theorem: how many colors are needed to color the complete graph on $n$ vertices in order to guarantee a rainbow copy of $t K_{3}$, that is, $t$ vertex-disjoint…
In this paper we study the randomly edge colored graph that is obtained by adding randomly colored random edges to an arbitrary randomly edge colored dense graph. In particular we ask how many colors and how many random edges are needed so…
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back to the work of Euler on Latin squares and has been the focus of extensive research ever since. Many…
Let $G$ be a quadrangulation on an orientable surface and let $g$ be a proper vertex-$4$-coloring of $G$. A face $F$ of $G$ is said to be a rainbow-face if all four distinct colors appear on its boundary. A $(c_1,c_2,c_3,c_4)$-face in $G$…
A theoretical model describing neutron-proton scattering developed by Majorana as early as in 1932, is discussed in detail with the experiments that motivated it. Majorana using collisions' theory, obtained the explicit expression of…
We study a quantitative Ramsey-type problem on 3-term arithmetic progressions: how should the set of integers $[n] = \{1, 2, \dots, n\}$ be colored using 3 colors in order to maximize the number of rainbow 3-term arithmetic progressions? By…
The use of algebraic techniques to solve combinatorial problems is studied in this paper. We formulate the rainbow connectivity problem as a system of polynomial equations. We first consider the case of two colors for which the problem is…
Three small lectures are devoted to three Newton's laws, lying in the foundation of classical mechanics. These laws are analyzed from the viewpoint of our contemporary knowledge about space, time and physical interactions. The lectures were…
We discuss two realizations of the colored Jones polynomials of a knot, one from an unnoticed work of the second author in 1994 on quantum R-matrices at roots of unity obtained from solutions of the pentagon identity, and another one from…
There is a possibility that spacetime itself is ultimately an emergent phenomenon, a near-universal "low-energy long-distance approximation", similar to the way in which fluid mechanics is the near-universal low-energy long-distance…
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. The study of rainbow subgraphs goes back more than two hundred years to the work of Euler on Latin squares and has been the focus of extensive…
In this paper, we investigate the configuration theorems of Desargues and Pappus in a synthetic geometric way. We provide a bridge between the two configurations with a third one that can be considered a specification for both. We do not…
We formulate and prove the generalizations of Friedman's free set and thin set theorems and of the rainbow Ramsey theorem to colorings of barriers. We analyze the strength of these theorems from the point of view of computability theory…
Let $G$ be an edge-colored graph on $n$ vertices. For a vertex $v$, the \emph{color degree} of $v$ in $G$, denoted by $d^c(v)$, is the number of colors appearing on the edges incident with $v$. Denote by $\delta^c(G)=\min\{d^c(v):v\in…