Related papers: Almost-Sharp Quantitative Duffin-Schaeffer without…
The Duffin-Schaeffer theorem is a well-known result from metric number theory, which generalises Khinchin's theorem from monotonic functions to a wider class of approximating functions. In recent years, there has been some interest in…
The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…
The purpose of this article is twofold: to prove a pointwise equidistribution theorem with an error rate for almost smooth functions, which strengthens the main result of Kleinbock, Shi and Weiss (2017); and to obtain a L\'evy-Khintchin…
For every pair of vertices u and v with d(u; v) = n, Wun G v denotes the set of all vertices of G that are closer to u than to v. In this paper, we introduce quasi-({\lambda}; n)-distance-balanced graphs and then study some properties of…
We expand upon the notion of bottlenecking introduced in our earlier work, characterizing a spectrum of graphs and showing that this naturally extends to a concept of coarse bottlenecking. We show how the notion of bottlenecking provides a…
We introduce the notion of coarse bottlenecking in graphs and coarse skeletons of graphs and show how bottlenecking guarantees that a skeleton resembles (up to quasi-isometry) the original graph. We show how these tools can be used to…
In a ground-breaking work \cite{BY}, Beresnevich and Yang recently proved Khintchine's theorem in simultaneous Diophantine approximation for nondegenerate manifolds resolving a long-standing problem in the theory of Diophantine…
In this paper we prove, in a purely combinatorial way, a structural quasi-polynomiality property for the Bousquet-M\'elou-Schaeffer numbers. Conjecturally, this property should follow from the Chekhov-Eynard-Orantin topological recursion…
This paper is about almost reducibility of quasi-periodic cocycles with a diophantine frequency which are sufficiently close to a constant. Generalizing previous works by L.H.Eliasson, we show a strong version of almost reducibility for…
In this paper we initiate a new approach to studying approximations by rational points to points on smooth submanifolds of $\mathbb{R}^n$. Our main result is a convergence Khintchine type theorem for arbitrary nondegenerate submanifolds of…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
In this paper we study almost Cohen-Macaulay bipartite graphs. Furthermore, we prove that if $G$ is almost Cohen-Macaulay bipartite graph with at least one vertex of positive degree, then there is a vertex of $\deg(v) \leq 2$. In…
This paper is a study of almost contact statistical manifolds. Especially this study is focused on almost cosymplectic statistical manifolds. We obtained basic properties of such manifolds. It is proved a characterization theorem and a…
In his 1960 paper, Schmidt studied a quantitative type of Khintchine-Groshev theorem for general (higher) dimensions. Recently, a new proof of the theorem was found, which made it possible to relax the dimensional constraint and more…
In this paper, we complete the long-standing challenge to establish a Khintchine-type theorem for arbitrary nondegenerate manifolds in $\mathbb{R}^n$. In particular, our main result finally removes the analyticity assumption from the…
We study discrete Schroedinger operators with analytic potentials. In particular, we are interested in the connection between the absolutely continuous spectrum in the almost periodic case and the spectra in the periodic case. We prove a…
Goemans and Williamson designed a 0.878-approximation algorithm for Max-Cut in undirected graphs [JACM'95]. Khot, Kindler, Mosel, and O'Donnel showed that the approximation ratio of the Goemans-Williamson algorithm is optimal assuming…
Duffin and Schaeffer have generalized the classical theorem of Khintchine in metric Diophantine approximation in the case of any error function under the assumption that all the rational approximants are irreducible. This result is extended…
We prove Haynes' version of the Duffin--Schaeffer conjecture for the $p$-adic numbers. In addition, we prove several results about an associated related but false conjecture, related to $p$-adic approximation in the spirit of Jarn\'ik and…
We study (inhomogeneous) approximation for systems of linear forms using integer points which satisfy additional primitivity constraints. The first family of primitivity constraints we consider were introduced in 2015 by Dani, Laurent, and…