相关论文: Some explicit badly approximable pairs

For K \subseteq C, let B_n(K)={(x_1,...,x_n) \in K^n: for each y_1,...,y_n \in K the conjunction (\forall i \in {1,...,n} (x_i=1 => y_i=1)) AND (\forall i,j,k \in {1,...,n} (x_i+x_j=x_k => y_i+y_j=y_k)) AND (\forall i,j,k \in {1,...,n}…

In the literature, we have various ways of proving irrationality of a real number. In this survey article, we shall emphasize on a particular criterion to prove irrationality. This is called nice approximation of a number by a sequence of…

We study the inapproximability of the induced disjoint paths problem on an arbitrary $n$-node $m$-edge undirected graph, which is to connect the maximum number of the $k$ source-sink pairs given in the graph via induced disjoint paths. It…

Fix $d\in\mathbb N$, and let $S\subseteq\mathbb R^d$ be either a real-analytic manifold or the limit set of an iterated function system (for example, $S$ could be the Cantor set or the von Koch snowflake). An $extrinsic$ Diophantine…

We show that on most of the hyperbolic simply connected domains the weighted bounded rational approximation in a natural sup norm is possible only for a very sparse set of holomorphic functions (in contrast to integral approximation). The…

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…

It is a classical result from Diophantine approximation that the set of badly approximable numbers has Lebesgue measure zero. In this paper we generalise this result to more general sequences of balls. Given a countable set of closed…

Maximum bipartite matching is a fundamental algorithmic problem which can be solved in polynomial time. We consider a natural variant in which there is a separation constraint: the vertices on one side lie on a path or a grid, and two…

We discuss the notion of optimal polynomial approximants in multivariable reproducing kernel Hilbert spaces. In particular, we analyze difficulties that arise in the multivariable case which are not present in one variable, for example, a…

We construct explicit easily implementable polynomial approximations of sufficiently high accuracy for locally constant functions on the union of disjoint segments. This problem has important applications in several areas of numerical…

An infinite dimensional algebra, which is useful for deriving exact solutions of the generalized pairing problem, is introduced. A formalism for diagonalizing the corresponding Hamiltonian is also proposed. The theory is illustrated with…

Let $1<k<14/5$, $\lambda_1,\lambda_2,\lambda_3$ and $\lambda_4$ be non-zero real numbers, not all of the same sign such that $\lambda_1/\lambda_2$ is irrational and let $\omega$ be a real number. We prove that the inequality…

Unitary best approximation to the exponential function on an interval on the imaginary axis has been introduced recently. In the present work two algorithms are considered to compute this best approximant: an algorithm based on rational…

We demonstrate how connections between graph theory and Diophantine approximation can be used in conjunction to give simple and accessible proofs of seemingly difficult results in both subjects.

We show that points on $C^{1}$ curves which are badly approximable by rationals in a number field form a winning set in the sense of W. M. Schmidt. As a consequence, we obtain a number field version of Schmidt's conjecture.

In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…

We prove a new lower bound for the exponent of growth of the best two-dimensional Diophantine approximations with respect to Euclidean norm.

We develop the theory of Diophantine approximation for systems of simultaneously small linear forms, which coefficients are drawn from any given analytic non-degenerate manifolds. This setup originates from a problem of Sprind\v{z}uk from…

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

The degree of a CSP instance is the maximum number of times that any variable appears in the scopes of constraints. We consider the approximate counting problem for Boolean CSP with bounded-degree instances, for constraint languages…