Shannon entropy quantifying bi-colored Ramsey complete graphs is introduced. Complete graphs in which vertices are connected with two types of links, labeled as α-links and β-links are considered. Shannon-entropy is introduced according to the classical Shannon formula considering the fractions of monochromatic convex α-colored polygons with n α-sides or edges, and the fraction of monochromatic β-colored convex polygons with m β-sides in the given complete graph. Introduced Shannon entropy is insensitive to the exact shape of the graph, but it is sensitive to the distribution of monochromatic polygons in a given graph. The introduced Shannon Entropies Sα and Sβ are interpreted as follows: Sα is interpreted as an average uncertainty to find the green α-polygon in the given graph, Sβ is, in turn, an average uncertainty to find the red β-polygon in the same graph. The re-shaping of the Ramsey theorem in terms of the Shannon Entropy is suggested. Various measures quantifying the Shannon Entropy of the entire complete bi-colored graphs are suggested. Physical interpretations of the suggested Shannon Entropies are discussed.

We propose the Ramsey approach for the analysis of behavior of isolated mechanical systems containing interacting particles. The total momentum of the system in the frame of the center of masses is zero. The mechanical system is described by the Ramsey, bi-colored, complete graph. Vectors of momenta of the particles pi serve as the vertices of the graph. We start from the graph representing the system in the frame of the center of masses, the momenta of the particles in this system are pcmi. If (pcmi(t)∙pcmj(t))≥0 is true, vectors of momenta of the particles numbered i and j are connected with the red link; if (pcmi(t)∙pcmj(t))<0 takes place, the vectors of momenta are connected with the green link. Thus, the complete, bi-colored graph emerges. Consider the isolated system built of six interacting particles. According to the Ramsey Theorem, the graph inevitably comprises at least one monochromatic triangle. The coloring procedure is invariant relatively rotations/translations of frames; thus, the graph representing the system contains at least one monochromatic triangle in any of frames emerging by rotation/translation of the original frame. This gives rise to the novel kind of a mechanical invariant. Similar coloring is introduced for the angular momenta of the particles. However, the coloring procedure is sensitive to Galilean/Lorenz transformations. Extensions of the suggested approach are discussed.

Ramsey theory enables re-shaping of the basic ideas of the quantum mechanics. Quantum observables, represented by linear Hermitian operators are seen as the vertices of the graph. Relation of commutation define coloring of the edges linking the vertices: if the operators commute, they are connected with the red link; if they do not commute they are connected with the green link. Thus, a bi-colored, complete, Ramsey graph emerges. According to the Ramsey theorem, complete, bi-colored graph built of six vertices, will inevitably contain at least one monochromatic triangle; in other words, the Ramsey number R(3,3)=6. In our interpretation, this triangle represents the triad of observables, which could or, alternatively, could not be established simultaneously in a given quantum system. The Ramsey approach to the quantum mechanics is illustrated with the numerous examples, including the motion of a particle in a centrally symmetrical field.

Re-interpretation of the Fermat principle governing propagation of light in media within the Ramsey Theory is suggested. Complete bi-colored graphs corresponding to the light propagation in media are considered. The vertices of the graphs correspond to the points of the real physical space, in which light sources or sensors are placed. Red links in the graphs correspond to the actual optical paths, emerging from the Fermat principle. A variety of optical events: refraction, reflection, etc. may be involved in the light propagation. Green links, in turn, denote the trial/virtual optical paths, which actually do not occur. The Ramsey Theorem states that within the graph containing six points, inevitably, actual or virtual optical cycle will be necessarily present. Implementation of the Ramsey Theorem to the light propagation in metamaterials is discussed. The Fermat Principle states that in metamaterials a light ray in going from point S to point P must traverse an optical path length L that is stationary with respect to variations of this path. Thus, bi-colored graphs built of links corresponding to maxima or minima of optical paths become possible. Graphs, comprising six vertices, inevitably will demonstrate optical cycles, built of the mono-colored links corresponding to the maxima or minima of the optical path. The notion of the “inverse graph” is introduced and discussed. The total number of triangles in the “direct” (source) and “inverse” Ramsey optical graphs is the same, Optical interpretation of the infinite Ramsey Theorem is suggested.

In this paper, a study was conducted on the Ramsey interference and spectral line locking techniques based on rubidium-87 cold atoms. Using sequential control technique, the timing design of a three-dimensional magneto-optical trap (MOT), cold atoms’ free fall, Ramsey microwave interference, and two-level fluorescence detection was realized, achieving the state preparation of cold atoms and clock transitions. By designing an automatic peak-finding algorithm, numerical integration was performed on the time-of-flying (TOF) signal, and narrow linewidth cold atom Ramsey interference fringes were obtained. Based on this, a frequency-hopping method was used to lock the frequency of the 10MHz oven-controlled crystal oscillator (OCXO) in a closed loop, achieving a linewidth of 38Hz. This preliminary result verifies the feasibility of the system design.

We apply the Ramsey theory to the analysis of geometrical properties of closed contours. Consider a set of six points placed on a closed contour. The straight lines connecting these points are yikx=αikx+βik i,k=1...6, αik≠0. We color the edges connecting the points for which αik>0 holds with red, and the edges for which αik<0 with green with red. At least one monochromic triangle should necessarily appear within the curve (according to the Ramsey number R3,3=6). This result is immediately applicable for the analysis of dynamical billiards. The second theorem emerges from the combination of the Jordan curve and Ramsey theorem. The closed curve is considered. We connect the points located within the same region with green links and the points placed within the different regions with red links. In this case, transitivity/intransitivity of the relations between the points should be considered. Ramsey constructions arising from the differential geometry of closed contours are discussed.

Re-shaping of thermodynamics with the graph theory and Ramsey theory is suggested. Maps built of thermodynamic states are addressed. Thermodynamic states may be attainable and non-attainable by the thermodynamic process in the system of constant mass. We address the following question how large should be a graph describing connections between discrete thermodynamic states to guarantee the appearance of thermodynamic cycles? The Ramsey theory supplies the answer to this question. Direct graphs emerging from the chains of irreversible thermodynamic processes are considered. In any complete directed graph, representing the thermodynamic states of the system the Hamiltonian path is found. Transitive thermodynamic tournaments are addressed. The entire transitive thermodynamic tournament built of irreversible processes does not contain a cycle of length 3, or in other words, the transitive thermodynamic tournament is acyclic and contains no directed thermodynamic cycles.

Ramsey approach to the vectors fields is introduced. Set of vectors defined on R^3, taken as the generators of the bi-colored complete graph, is introduced. Vectors are considered as the vertices of the graph. Following coloring procedure is suggested: vertices numbered i and j are linked with the red edge if their scalar product is non-negative; and they are linked with the green edge if their scalar product is negative. This procedure gives rise to the complete, bi-color graph. Graph generated by six vectors inevitably contains the monochromatic triangle: the Ramsey number Ring-like systems of generating vectors are addressed. Applications of the graphs emerging from the vector fields are discussed.

Application of the Ramsey Theory to the set of the points placed in the plane is discussed. Consider a set of N points located in the same plane. The straight lines connecting these points are yikx=αikx+βik i,k=1...N. Listed below values of slopes αik are possible: αik>0; αik=0; αik is not defined; αik<0. Following coloring procedure is introduced: we connect the pairs of points for which αik>0, αik=0 or αik is not defined, with the red links, and the pairs of points for which αik<0 place with green links. The suggested coloring procedure enables building of the complete bi-colored graph for any set containing N points located in the same plane. We apply the Ramsey theorem to the complete graph emerging from the suggested coloring. For the set containing N=6 points at least one monochromatic triangle will necessarily appear in the graph. The values of the slopes αik depend on the chosen coordinate system. The rotation of coordinate axes changes the coloring of the graph; however, at least one monochromatic triangle will be present for N=6. The introduced coloring procedure diminishes the order of the symmetry group of the regular hexagon, irrespectively to the orientation of the coordinate axes. We hypothesized that this will be true for arbitrary regular n-polygon, independently on the orientation of coordinate axes. The inverse bi-color Ramsey graphs arise, when we replace red links appearing in the source graph with red ones, and vice versa. The total number of triangles in the “direct” and “inverse” Ramsey graphs is the same. We considered the particular case of the set of points for which αik>0 or αik<0 is true in the given coordinates. In this particular case, the rotation of the Cartesian coordinate axes to the angle θ=π2 yields the inverse complete graph. Generalization of this coloring for an arbitrary number and arbitrary location of the source points is introduced.

Ramsey theory influences the dynamics of mechanical systems, which may be described as abstract complete graphs. We address a mechanical system which is completely interconnected with the two kinds of ideal Hookean springs. The suggested system mechanically corresponds to the cyclic molecules, in which functional groups are interconnected with two kinds of chemical bonds, represented mechanically with two springs k1 and k2. In this paper, we consider a Cyclic system (molecule) built of six equal masses m and two kinds of springs. We pose the following question: what is the minimal number of masses in the such a system in which three masses are constrained to be connected with spring k1 or three masses to be connected with spring k2? The answer to this question is supplied by the Ramsey theory, and it is formally stated as follows: what is the minimal number R3,3? The result emerging from the Ramsey theory is R3,3=6. Thus, in the aforementioned interconnected mechanical system will be necessarily present the triangles (at least one triangle), built of masses and springs. This prediction constitutes the vibrational spectrum of the system. Thus, the Ramsey Theory supplies the selection rules for the vibrational spectra of the cyclic molecules. Symmetrical system built of six vibrating entities is addressed. The Ramsey approach works for 2D and 3D molecules, which may be described as abstract complete graphs. The extension of the proposed Ramsey approach to the systems, partially connected by ideal springs, viscoelastic systems and systems, in which elasticity is of an entropy nature is discussed. “Multi-color systems” built of three kinds of ideal springs are addressed. The notion of the inverse Ramsey network is introduced and analyzed.

Application of the Ramsey graph theory to the analysis of physical systems is reported. Physical interactions may be very generally classified as attractive and repulsive. This classification creates the premises for the application of the Ramsey theory to the analysis of physical systems built of electrical charges, electric and magnetic dipoles. The notions of mathematical logic, such as transitivity and intransitivity relations, become crucial for understanding of the behavior of physical systems. The Ramsey theory explains why nature prefers cubic lattices over hexagonal ones for systems built of electric or magnetic dipoles. The Ramsey approach may be applied to the analysis of mechanical systems when actual and virtual paths between the states in the configurational space are considered. Irreversible mechanical and thermodynamic processes are seen within the reported approach as directed graphs. Chains of irreversible processes appear as transitive tournaments. These tournaments are acyclic; the transitive tournaments necessarily contain the Hamiltonian path. The set of states in the phase space of the physical system, between which irreversible processes are possible, is considered. The Hamiltonian path of the tournament emerging from the graph uniting these states is a relativistic invariant. Applications of the Ramsey theory to the general relativity become possible when the discrete changes in the metric tensor are assumed. Reconsideration of the concept of “simultaneity” within the Ramsey approach is reported.

A mathematical procedure enabling the transformation of an arbitrary tessellation of a surface into a bi-colored complete graph is introduced. Polygons constituting the tessellation are represented by vertices of the graphs. Vertices of the graphs are connected by two kinds of links/edges, namely, by a green link, when polygons have the same number of sides, and by a red link, when the polygons have a different number of sides. This procedure gives rise to a semi-transitive, complete, bi-colored Ramsey graph. The Ramsey number was established as R_trans (3,3)=5. Shannon entropies of the tessellation and graphs are introduced. Ramsey graphs emerging from random Voronoi and Poisson Line tessellations were investigated. The limits ζ=lim┬(N→∞)⁡〖N_g/N_r 〗, where N is the total number of green and red seeds, N_g and N_r, were found ζ=0.272±0.001 (Voronoi) and ζ= 0.47±0.02 (Poisson Line). The Shannon Entropy for the random Voronoi tessellation was calculated as S= 1.690±0.001 and for the Poisson line tessellation as S =1.265±0.015.