Related papers: Diophantine approximation and coloring
In this paper we prove transference inequalities for regular and uniform Diophantine exponents in the weighted setting. Our results generalize the corresponding inequalities that exist in the `non-weighted' case.
We investigate an algebraic problem related to the determination of the fundamental group of a class of spaces of configurations on surfaces. The configuration spaces are spaces of points grouped into colors. Whether two points are allowed…
A triangulation of a polygon is a subdivision of it into triangles, using diagonals between its vertices. Two different triangulations of a polygon can be related by a sequence of flips: a flip replaces a diagonal by the unique other…
The inhomogeneous Khintchine-Groshev Theorem is a classical generalization of Khintchine's Theorem in Diophantine approximation, by approximating points in $\mathbb{R}^m$ by systems of linear forms in $n$ variables. Analogous to the…
We discuss several open problems in Diophantine approximation. Among them there are famous Littlewood's and Zaremba's conjectures as well as some new and not so famous problems.
We prove the convergence and divergence cases of an inhomogeneous Khintchine-Groshev type theorem for dual approximation restricted to affine subspaces in $\mathbb{R} ^n$. The divergence results are proved in the more general context of…
We consider some diophantine problems suggested by the analogy between multiplicative groups and powers of the modular curve in problems of "unlikely intersections." We prove a special case of the Zilber-Pink conjecture for curves.
Data association, the problem of reasoning over correspondence between targets and measurements, is a fundamental problem in tracking. This paper presents a graphical model formulation of data association and applies an approximate…
This survey paper is not a complete reference guide to number-theoretical applications of ergodic theory. Instead, it considers an approach to a class of problems involving Diophantine properties of $n$-tuples of real numbers, namely,…
Graph theory provides fundamental concepts for many fields of science like statistical physics, network analysis and theoretical computer science. Here we give a pedagogical introduction to graph theory, divided into three sections. In the…
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techniques and generalize previously known results on various…
The paper deals with best one--sided (lower or upper) Diophantine approximations of the $\ell$-th kind ($\ell\in\mathbb{N}$). We use the ordinary continued fraction expansions to formulate explicit criteria for a fraction…
In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to…
We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…
We reduce the principal problem of Additive Number Theory of whether an infinite sequence of integers constitutes a finite basis for the integers to a Diophantine problem involving the difference set of the sequence, by proving a formula…
Two vertex colorings of a graph are Kempe equivalent if they can be transformed into each other by a sequence of switchings of two colors of vertices. It is PSPACE-complete to determine whether two given vertex $k$-colorings of a graph are…
In these notes, we begin by recalling aspects of the classical theory of metric Diophantine approximation; such as theorems of Khintchine, Jarn\'{\i}k, Duffin-Schaeffer and Gallagher. We then describe recent strengthening of various…
Let n>0 be a number. Let Gn be the graph on n-dimensional Euclidean space connecting points of rational distance. It is consistent with the choiceless theory ZF+DC that Gn has countable chromatic number yet Gn+1 does not.
Hindman's Theorem states that in any finite coloring of the integers, there is an infinite set all of whose finite sums belong to the same color. This is much stronger than the corresponding finite form, stating that in any finite coloring…
We study the correspondence between Bayesian Networks and graphical representation of proofs in linear logic. The goal of this paper is threefold: to develop a proof-theoretical account of Bayesian inference (in the spirit of the…