Related papers: Diophantine approximation and coloring
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
In this paper the metric theory of Diophantine approximation associated with the small linear forms is investigated. Khintchine-Groshev theorems are established along with Hausdorff measure generalization without the monotonic assumption on…
The goal of this paper is twofold. First, we present a unified way of formulating numerical integration problems from both approximation theory and discrepancy theory. Second, we show how techniques, developed in approximation theory, work…
We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…
Proximity graphs are used in several areas in which a neighborliness relationship for input data sets is a useful tool in their analysis, and have also received substantial attention from the graph drawing community, as they are a natural…
We use the theory of arithmetic quotients of the Bruhat-Tits tree developed by Serre and others to obtain Dirichlet-style theorems for Diophantine approximation on global function fields. This approach allows us to find sharp values for the…
E-graphs are a prominent data structure that has been increasing in popularity in recent years due to their expanding range of applications in various formal reasoning tasks. Often, they are used for equality saturation, a process of…
We prove a Diophantine approximation inequality for closed subschemes on surfaces which can be viewed as a joint generalization of recent inequalities of Ru-Vojta and Heier-Levin in this context. As applications, we study various…
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.…
We study a variation of the graph colouring problem on random graphs of finite average connectivity. Given the number of colours, we aim to maximise the number of different colours at neighbouring vertices (i.e. one edge distance) of any…
The inhomogeneous metric theory for the set of simultaneously $\psi$-approximable points lying on a planar curve is developed. Our results naturally incorporate the homogeneous Khintchine-Jarnik type theorems recently established in [Ann.…
Drawings of non-planar graphs always result in edge crossings. When there are many edges crossing at small angles, it is often difficult to follow these edges, because of the multiple visual paths resulted from the crossings that slow down…
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…
We present in this article a general approach (in the form of recommendations and guidelines) for tackling Diophantine equation problems (whether single equations or systems of simultaneous equations). The article should be useful in…
Graph coloring problems are a central topic of study in the theory of algorithms. We study the problem of partially coloring partially colorable graphs. For $\alpha \leq 1$ and $k \in \mathbb{Z}^+$, we say that a graph $G=(V,E)$ is…
Consider a graph whose vertices are colored in one of two colors, say black or white. A white vertex is called integrated if it has at least as many black neighbors as white neighbors, and similarly for a black vertex. The coloring as a…
In this survey article, we explore a central theme in Diophantine approximation inspired by a celebrated result of Besicovitch on the Hausdorff dimension of well approximable real numbers. We outline some of the key developments stemming…
The main objective of this paper is to prove a Khintchine type theorem for divergence for linear Diophantine approximation on non-degenerate manifolds, which completes earlier results for convergence.
The paper applies the theory developed in Part I to the discrete normal approximation in total variation of random vectors in ${\mathbb Z}^d$. We illustrate the use of the method for sums of independent integer valued random vectors, and…
A general novel approach mapping discrete, combinatorial, graph-theoretic problems onto ``physical'' models - namely $n$ simplexes in $n-1$ dimensions - is applied to the graph equivalence problem. It is shown to solve this long standing…