相关论文: Some explicit badly approximable pairs

We classify and enumerate all rational numbers with approximation constant at least $\frac{1}{3}$ using hyperbolic geometry. Rational numbers correspond to geodesics in the modular torus with both ends in the cusp, and the approximation…

Let $\alpha$ be a fixed quadratic irrational. Consider the Diophantine equation \[ y^a\ =\ q_{N_1} + \cdots + q_{N_K},\quad N_1 \geq \cdots \geq N_{K} \geq 0,\quad a, y \geq 2 \] where $(q_N)_{N\,\geq\,0}$ is the sequence of convergent…

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].

The classical stable marriage problem asks for a matching between a set of men and a set of women with no blocking pairs, which are pairs formed by a man and a woman who would both prefer switching from their current status to be paired up…

We highlight a connection between Diophantine approximation and the lower Assouad dimension by using information about the latter to show that the Hausdorff dimension of the set of badly approximable points that lie in certain non-conformal…

In approximation theory, logarithmic derivatives of complex polynomials are called simple partial fractions (SPF) as suggested by Eu.P. Dolzhenko. Many solved and unsolved extremal problems related to SPF are traced back to works of G.…

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…

In this paper we consider the coupled task scheduling problem with exact delay times on a single machine with the objective of minimizing the total completion time of the jobs. We provide constant-factor approximation algorithms for several…

We study metrical properties of various subsequences associated to the sequence of rational approximants coming from the continued fraction of an irrational number. Our methods build upon Bosma, Jager and Wiedijk's proof of the…

We use the Brauer-Manin obstruction to strong approximation on a punctured affine cone to explain a curious property of coprime integer solutions to a homogeneous Diophantine equation.

We study the problem of Diophantine approximation on lines in $\mathbb{C}^2$ with numerators and denominators restricted to Gaussian primes. To this end, we develop analogs of well-known results on small fractional parts of $p\gamma$, $p$…

In a previous paper, we studied certain sequences of simultaneous rational approximations in ${\bf R}^2$ which present some analogy with the continued fractions. We got results around the Littlewood conjecture by using such approximations.…

We elaborate on a problem raised by Schmidt in 1967 which generalizes the theory of classical Diophantine approximation to subspaces of $\R^n$. We consider Diophantine exponents for linear subspaces of $\R^n$ which generalize the…

Let $\alpha$ and $\beta$ be irrational real numbers and $0<\F<1/30$. We prove a precise estimate for the number of positive integers $q\leq Q$ that satisfy $\|q\alpha\|\cdot\|q\beta\|<\F$. If we choose $\F$ as a function of $Q$ we get…

For any pair of real numbers $(i,j)$ with $0<i,j<1$ and $i+j=1$, we prove that the set of $p$-adic mixed $(i,j)$-badly approximable numbers $\bad_p(i, j)$ is 1/2-winning in the sense of Schmidt's game. This improves a recent result of…

A triangle with rational sides and rational area is called a rational triangle. In this paper we consider three problems of finding pairs of rational triangles which have a common circumradius as well as either a common perimeter or a…

We consider the problem of jointly minimizing forms of two Boolean functions $f, g \colon \{0,1\}^J \to \{0,1\}$ such that $f + g \leq 1$ and so as to separate disjoint sets $A \cup B \subseteq \{0,1\}^J$ such that $f(A) = \{1\}$ and $g(B)…

We show that for any irrational $\alpha$ and any $\tau<8/23$ there are infinitely many $n$ which are the product of two primes for which $$\|n\alpha\|\leq n^{-\tau}.$$ We also show that for all sufficiently large $b$ there exist 3-digit…

The concept of nearest integer is used to derive theorems and algorithms for the best approximations of an irrational by rational numbers, which are improved with the pigeonhole principle and used to offer an informed presentation of the…

A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…