Related papers: Diophantine approximation and coloring
This paper describes several new problems and ideas concerning algebraic geometry and complexity theory. It first uses the idea of coloring graphs with elements of finite fields. This procedure then shows that graph coloring problems can be…
A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…
We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in…
We study approximations of theories both in general context and with respect to some natural classes of theories. Some kinds of approximations are considered, connections with finitely axiomatizable theories and minimal generating sets of…
We prove a result in the area of twisted Diophantine approximation related to the theory of Schmidt games. In particular, under certain restrictions we give a affirmative answer to the analogue in this setting of a famous conjecture of…
In this paper we develop the convergence theory of simultaneous, inhomogeneous Diophantine approximation on manifolds. A consequence of our main result is that if the manifold $M \subset \mathbb{R}^n$ is of dimension strictly greater than…
Greb\'ik and Rocha [Fractional Isomorphism of Graphons, Combinatorica 42, pp 365-404 (2022)] extended the well studied notion of fractional isomorphism of graphs to graphons. We prove that fractionally isomorphic graphons can be…
The presented work focuses on problems from determinant theory, set theory and topology. The term graph is the binding element that connects these problems. Graphs are distinguished by their geometrical simplicity, which helps in showing…
We give a simple short proof of Brooks' theorem using only induction and greedy coloring, while avoiding issues of graph connectivity. The argument generalizes easily to some extensions of Brooks' theorem, including its variants for list…
In this survey essay, I explore the application of the discharging method in graph theory, including the selection of charging rules and discharging rules, and the general characteristics of the discharging method. As examples, I will prove…
Our goal is to finally settle the persistent problem in Diophantine Approximation of finding best linear approximates. Classical results from the theory of continued fractions provide the solution for the special homogeneous case in the…
We establish a `mixed' version of a fundamental theorem of Khintchine within the field of simultaneous Diophantine approximation. Via the notion of ubiquity we are able to make significant progress towards the completion of the metric…
In recent years, the ergodic theory of group actions on homogeneous spaces has played a significant role in the metric theory of Diophantine approximation. We survey some recent developments with special emphasis on Diophantine properties…
Diophantine approximation explores how well irrational numbers can be approximated by rationals, with foundational results by Dirichlet, Hurwitz, and Liouville culminating in Roth's theorem. Schmidt's subspace theorem extends Roth's results…
We prove a strong analogue of Liouville's Theorem in Diophantine approximation for points on arbitrary algebraic varieties. We use this theorem to prove a conjecture of the first author for cubic surfaces in $\P^3$.
We first propose two conjectural estimates on Diophantine approximation of logarithms of algebraic numbers. Next we discuss the state of the art and we give further partial results on this topic.
Graph colouring is a combinatorial optimisation problem with applications in several important domains, including sports scheduling, cartography, street map navigation, and timetabling. It is also of significant theoretical interest and a…
We prove central limit theorems for Diophantine approximations with congruence conditions and for inhomogeneous Diophantine approximations following the approach of Bj\"{o}rklund and Gorodnik. The main tools are the cumulant method and…
We give some comments on W.M. Schmidt's theorem on Diophantine approximations with positive integers and our recent results on the topic.
Diophantine exponents are ones of the simplest quantitative characteristics responsible for the approximation properties of linear subspaces of a Euclidean space. This survey is aimed at describing the current state of the area of…