Related papers: Simultaneous two-dimensional best Diophantine appr…
We fill a gap in the study of the Hausdorff dimension of the set of exact approximation order considered by Fregoli [Proc. Amer. Math. Soc. 152 (2024), no. 8, 3177--3182].
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
In this paper we present a new approach to prove effective results in Diophantine approximation. We then use it to prove an effective theorem on the simultaneous approximation of two algebraic numbers satisfying an algebraic equation with…
We demonstrate a simple analytic argument that may be used to bound the Levy concentration function of a sum of independent random variables. The main application is a version of a recent inequality due to Rudelson and Vershynin, and its…
In this paper, we study Diophantine exponents $w_n$ and $w_n ^{*}$ for Laurent series over a finite field. Especially, we deal with the case $n=2$, that is, quadratic approximation. We first show that the range of the function $w_2-w_2…
We show that for almost all points on any analytic curve on R^{k} which is not contained in a proper affine subspace, the Dirichlet's theorem on simultaneous approximation, as well as its dual result for simultaneous approximation of linear…
We introduce a method for translating any upper bound on the percolation threshold of a lattice $G$ into a lower bound on the exponential growth rate $a(G)$ of lattice animals and vice-versa. We exploit this in both directions. We improve…
We prove an estimate on the Hausdorff-dimension of the set of two-sided boundary points of general Sobolev-extension domains on Euclidean spaces. We also present examples showing lower bounds on possible dimension estimates of this type.
In this paper we present a new perspective on error analysis of Legendre approximations for differentiable functions. We start by introducing a sequence of Legendre-Gauss-Lobatto polynomials and prove their theoretical properties, such as…
We study the complexity of geometric problems on spaces of low fractal dimension. It was recently shown by [Sidiropoulos & Sridhar, SoCG 2017] that several problems admit improved solutions when the input is a pointset in Euclidean space…
We compute the sequence of best Diophantine approximations for some pairs of cubic Pisot numbers which do not satisfy the Property (F).
We study multiplicative Diophantine approximation property of vectors and compute Diophantine exponents of hyperplanes via dynamics.
We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…
This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…
For an $n$-dimensional polytope $\Omega$ in $\mathbb{R}^{n}$, we study lower bounds for eigenvalues of the Dirichlet eigenvalue problem of the Laplacian. In the asymptotic formula on the average of the first $k$ eigenvalues, Li and Yau…
We compute the Hausdorff dimension of the set of simultaneously $q^{-\lambda}$-well approximable points on the Veronese curve in $\mathbb{R}^n$ for $\lambda$ between $\frac{1}{n}$ and $\frac{2}{2n-1}$. For $n=3$, the same result is given…
We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…
We present and study approximate notions of dimensional and margin complexity, which correspond to the minimal dimension or norm of an embedding required to approximate, rather then exactly represent, a given hypothesis class. We show that…
We improve the best lower bounds on the chromatic number of Euclidean space in small dimensions. The new results depend on extensive computations in Sage.