Related papers: Diophantine approximation and coloring
We provide a "how-to" guide to the use and application of the Discharging Method. Our aim is not to exhaustively survey results proved by this technique, but rather to demystify the technique and facilitate its wider use, using applications…
The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…
The paper is mostly a survey on recent results in Diophantine approximation, with emphasis on properties of exponents measuring various notions of Diophantine <approximation.
This paper is motivated by recent applications of Diophantine approximation in electronics, in particular, in the rapidly developing area of Interference Alignment. Some remarkable advances in this area give substantial credit to the…
In this chapter we introduce the theory of Diophantine approximation via a series of basic examples from information theory relevant to wireless communications. In particular, we discuss Dirichlet's theorem, badly approximable points,…
This article shines new light on the classical problem of tiling rectangles with squares efficiently with a novel method. With a twist on the traditional approach of resistor networks, we provide new and improved results on the matter using…
The theory of graphons has proven to be a powerful tool in many areas of graph theory. In this paper, we introduce several foundational aspects of the theory of digraphons -- asymmetric two-variable functions that arise as limits of…
A basic question of Diophantine approximation, which is the first issue we discuss, is to investigate the rational approximations to a single real number. Next, we consider the algebraic or polynomial approximations to a single complex…
A theory about the implication structure in graph coloring is presented. Discovering hidden relations is a crucial activity in every scientific discipline. The development of mathematical models to study and discover such hidden relations…
A $t$-tone coloring of a graph $G$ assigns to each vertex a set of $t$ colors such that any pair of vertices $u, v$ with distance $d$ can share at most $d-1$ colors. In this note, we prove several new results on $t$-tone coloring. For…
Let $f$ be a homogeneous polynomial with rational coefficients in $d$ variables. We prove several results concerning uniform simultaneous approximation to points on the graph of $f$, as well as on the hypersurface $\{f(x_1,\dots,x_d) =…
We investigate the large intersection properties of the set of points that are approximated at a certain rate by a family of affine subspaces. We then apply our results to various sets arising in the metric theory of Diophantine…
This is a survey article describing some recent results at the interface of homogeneous dynamics and Diophantine approximation.
We study metric Diophantine approximation in local fields of positive characteristic. Specifically, we study the problem of improving Dirichlet's theorem in Diophantine approximation and prove very general results in this context.
Building on work of Davenport and Schmidt, we mainly prove two results. The first one is a version of Gel'fond's transcendence criterion which provides a sufficient condition for a complex or $p$-adic number $\xi$ to be algebraic in terms…
There are abundant results on Diophantine approximation over fields of positive characteristic (see the survey papers [13, 25]), but there is very little information about simultaneous approximation. In this paper, we develop a technique of…
We develop the theory of Diophantine approximation for systems of simultaneously small linear forms, which coefficients are drawn from any given analytic non-degenerate manifolds. This setup originates from a problem of Sprind\v{z}uk from…
This book collects the lectures about graph theory and its applications which were given to students of mathematical departments of Moscow State University and Peking University. Graph theory is a very wide field with a lot of applications…
We extend the key formula which intertwines multiplicative Markoff-Lagrange spectrum and symbolic dynamics. The proof uses complex analysis and elucidates the strategy of the problem. Moreover, the new method applies to a wide variety of…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…