相关论文: Van der Waerden's Colouring Theorem and Weak-Stron…
We find a non-invertible matrix representation for Van der Waerden's colouring theorem for two distinct colours in a one dimensional periodic lattice. Using this,an infinite one dimensional antiferromagnetic Ising system is mapped to a…
Recall that van der Waerden's theorem states that any finite coloring of the naturals has arbitrarily long monochromatic arithmetic sequences. We explore questions about the set of differences of those sequences.
A multi-component electron model on a lattice is constructed whose ground state exhibits a spontaneous ordering which follows the rule of map-coloring used in the solution of the four color problem. The number of components is determined by…
Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…
We prove the existence of a finitely dependent proper colouring of the integer lattice Z^d that is fully isometry-invariant in law, for all dimensions d. Previously this was known only for d=1, while only translation-invariant examples were…
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.…
Defective coloring is a variant of traditional vertex-coloring, according to which adjacent vertices are allowed to have the same color, as long as the monochromatic components induced by the corresponding edges have a certain structure.…
In this article, we investigate polynomial generalizations of the van der Waerden theorem with a focus on largeness properties of recurrence patterns. We prove an $IP_r^\star$-strengthened version of the polynomial van der Waerden theorem,…
We introduce a variant of the vertex-distinguishing edge coloring problem, where each edge is assigned a subset of colors. The label of a vertex is the union of the sets of colors on edges incident to it. In this paper we investigate the…
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…
The inclusion relation between simple objects in the plane may be used to define geometric set systems, or hypergraphs. Properties of various types of colorings of these hypergraphs have been the subject of recent investigations, with…
Two-dimensional (2D) graphene-like layered semiconductors provide a new platform for materials research because of their unique mechanical, electronic and optical attributes. Their in-plane covalent bonding and dangling-bond-free surface…
We give a near-linear time 4-coloring algorithm for planar graphs, improving on the previous quadratic time algorithm by Robertson et al. from 1996. Such an algorithm cannot be achieved by the known proofs of the Four Color Theorem (4CT).…
A $\textit{ladder}$ is a set $S \subseteq \mathbb Z^+$ such that any finite coloring of $\mathbb Z$ contains arbitrarily long monochromatic progressions with common difference in $S$. Van der Waerden's theorem famously asserts that $\mathbb…
Ultracold multicomponent fermions (atoms/molecules) loaded in optical lattices provide an ideal platform for simulating SU($N$) Hubbard models that host unconventional many-body quantum states beyond SU(2). A prime example is the attractive…
Twisted vdW quantum materials have emerged as a rapidly developing field of 2D semiconductors. These materials establish a new central research area and provide a promising platform for studying quantum phenomena and investigating the…
We present a self-contained proof of a strong version of van der Waerden's Theorem. By using translation invariant filters that are maximal with respect to inclusion, a simple inductive argument shows the existence of "piecewise…
Four-Color Theorem has secret in its logical proof and actual operating. In this paper we will give a proof of Four-Color Theorem based on Kuratowski's Theorem using some induction argument and give a description of the most complicated…
Van der Waals (vdW) heterostructures ---formed by stacking or growing two-dimensional (2D) crystals on top of each other--- have emerged as a new promising route to tailor and engineer the properties of 2D materials. Twisted bilayer…
The emergence of superconductivity in slightly-misaligned graphene bilayer [1] and moir\'e excitons in MoSe$_2$-WSe$_2$ van der Waals (vdW) heterostructures [2] is intimately related to the formation of a 2D superlattice in those systems.…