Related papers: Diophantine approximation and coloring
For two properly intersecting effective cycles in projective space X,Y, and their intersection product Z, the metric Bezout Theorem relates the degrees, heights of X,Y, and Z, as well as their distances and algebraic distances to a given…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
Color coding is an algorithmic technique used in parameterized complexity theory to detect "small" structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable,…
How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to…
We prove that the Littlewood conjecture is satisfied for a restricted class of pairs $(\alpha,\beta)$ of badly approximable numbers. We use the localization of the roots of a cubic equation with coefficients depending on the diophantine…
In this paper we will provide an introductory understanding of random graph models, and matchings in the case of Erdos-Renyi random graphs. We will provide a synthesis of background theory to this end. We will further examine pertinent…
We introduce two novel evolutionary formulations of the problem of coloring the nodes of a graph. The first formulation is based on the relationship that exists between a graph's chromatic number and its acyclic orientations. It views such…
We provide a new general theorem for multivariate normal approximation on convex sets. The theorem is formulated in terms of a multivariate extension of Stein couplings. We apply the results to a homogeneity test in dense random graphs and…
The objective of this paper is to (partially) address the issue of finding an analogue to Khintchine's theorem for IFS Fractals. We study the convergence case for Diophantine approximations, and show an improved result for higher…
We prove a number of results on the metric and non-metric theory of Diophantine approximation for Yu's multidimensional variant of Mahler's classification of transcendental numbers. Our results arise as applications of well known results in…
One method to obtain a proper vertex coloring of graphs using a reasonable number of colors is to start from any arbitrary proper coloring and then repeat some local re-coloring techniques to reduce the number of color classes. The Grundy…
There are two main interrelated goals of this paper. Firstly we investigate the sums \[ S_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{n\|n\alpha-\gamma\|}~~~\text{and}~~~ R_N(\alpha,\gamma):=\sum_{n=1}^N\frac{1}{\|n\alpha-\gamma\|}\,, \] where…
An introductory paper to the graph k-colorability problem.
Chromatic polynomials are important objects in graph theory and statistical physics, but as a result of computational difficulties, their study is limited to graphs that are small, highly structured, or very sparse. We have devised and…
An injective coloring of a given graph G = (V, E) is a vertex coloring of G such that any two vertices with common neighbor receive distinct colors. An e-injective coloring of a graph G is a vertex coloring of G such that any two vertices…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
We give a pictorial proof that transparently illustrates why four colours suffce to chromatically differentiate any set of contiguous, simply connected and bounded, planar spaces; by showing that there is no minimal planar map. We show,…
In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.
We apply Diophantine analysis to classify edge-to-edge tilings of the sphere by congruent almost equilateral quadrilaterals (i.e., edge combination a3b). Parallel to a complete classification by Cheung, Luk and Yan, the method implemented…
We study the general problem of equidistribution of expanding translates of an analytic curve by an algebraic diagonal flow on the homogeneous space $G/\Gamma$ of a semisimple algebraic group $G$. We define two families of algebraic…