Related papers: Descartes-Newton-Young rainbow
A subgraph of an edge-coloured graph is called rainbow if all its edges have distinct colours. Our main result implies that, given any optimal colouring of a sufficiently large complete graph $K_{2n}$, there exists a decomposition of…
Solar neutrinos, generated abundantly by thermonuclear reactions in the solar interior, offer a unique tool for studying astrophysics and particle physics. The observation of solar neutrinos has led to the discovery of neutrino oscillation,…
Modification of three ideas underlying Newton's original world view, with only minor changes in context, might offer two advantages to introductory physics students. First, the students will experience less cognitive dissonance when they…
Here I am proposing a translation and discussion of the De Iride, one of the short scientific treatise written by Robert Grosseteste. In the first part of his Latin text we find reflection and refraction of light, described in a geometrical…
These notes are designed to offer some (perhaps new) codicils to related work, a list of problems and conjectures seeking (preferably) combinatorial proofs. The main items are Eulerian polynomials and hook/contents of Young diagram, mostly…
An edge-coloured graph $G$ is rainbow connected if there exists a rainbow path between any two vertices. A graph $G$ is said to be $k$-rainbow connected if there exists an edge-colouring of $G$ with at most $k$ colours that is rainbow…
In these lectures I first explain, in a rather basic fashion, the construction of effective field theories. I then discuss some recent developments in the application of such theories to two- and three-nucleon systems.
A properly edge-colored graph is a graph with a coloring of its edges such that no vertex is incident to two or more edges of the same color. A subgraph is called rainbow if all its edges have different colors. The problem of finding…
We present a Rainbow Ramsey version of the well-known Ramsey-type theorem of Richard Rado. We use techniques from the Geometry of Numbers. We also disprove two conjectures proposed in the literature.
On November 12, 1802, Thomas Young lays down in front of the Royal Society of London his Theory of Light and Colours. In this text, he defends a vibratory model or light, in which the peculiar attention he gives to the consequence of the…
This paper has two-fold goal: it provides gentle introduction to Knot Theory starting from 3-coloring, the concept introduced by R. Fox to allow undergraduate students to see that the trefoil knot is non-trivial, and ending with statistical…
The formulation of the alternative theory of neutrino oscillations is presented. Also the application of that theory to a system of neutrinos produced by a source is formulated and some basic formulae are derived.
In diffraction catastrophes such as the rainbow the wave nature of light resolves ray singularities and draws delicate interference patterns. In quantum catastrophes such as the black hole the quantum nature of light resolves wave…
An edge-coloured path is rainbow if its edges have distinct colours. For a connected graph $G$, the rainbow connection number (resp. strong rainbow connection number) of $G$ is the minimum number of colours required to colour the edges of…
An edge-coloured cycle is $rainbow$ if all edges of the cycle have distinct colours. For $k\geq 1$, let $\mathcal{F}_{k}$ denote the family of all graphs with the property that any $k$ vertices lie on a cycle. For $G\in \mathcal{F}_{k}$, a…
Descartes' circle theorem relates the curvatures of four mutually externally tangent circles, three "petal" circles around the exterior of a central circle, forming a "$3$-flower" configuration. We generalise this theorem to the case of an…
This is a short introductory course to Set Theory, based on axioms of von Neumann--Bernays--G\"odel (briefly NBG). The text can be used as a base for a lecture course in Foundations of Mathematics, and contains a reasonable minimum which a…
In this short note, we present a purely entropic proof that in a $3$-edge-colored simple graph with $R$ red edges, $G$ green edges, and $B$ blue edges, the number of rainbow triangles is at most $\sqrt{2RGB}$.
A subgraph of an edge-coloured graph is called rainbow if all its edges have different colours. The problem of finding rainbow subgraphs goes back to the work of Euler on transversals in Latin squares and was extensively studied since then.…
Aharoni and Berger conjectured that in every proper edge-colouring of a bipartite multigraph by $n$ colours with at least $n+1$ edges of each colour there is a rainbow matching using every colour. This conjecture generalizes a longstanding…