Related papers: On badly approximable numbers

In this work, some counterexamples are given to refute some results reported in the paper by Guo and Li [8] (J Optim Theory Appl 162,(2014), 821-844). We correct the faulty in some of their theorems and we present alternative proofs.…

A complete p-adic Khintchine type theorem for approximation by p-adic algebraic numbers is established.

In this short note we prove that, if (C[a,b],{A_n}) is an approximation scheme and (A_n) satisfies de La Vall\'ee-Poussin Theorem, there are instances of continuous functions on [a,b], real analytic on (a,b], which are poorly approximable…

We introduce a new nearest-prototype classifier, the prototype vector machine (PVM). It arises from a combinatorial optimization problem which we cast as a variant of the set cover problem. We propose two algorithms for approximating its…

Polynomial approximations of functions are widely used in scientific computing. In certain applications, it is often desired to require the polynomial approximation to be non-negative (resp. non-positive), or bounded within a given range,…

For an m by n real matrix A, we investigate the set of badly approximable targets for A as a subset of the m-torus. It is well known that this set is large in the sense that it is dense and has full Hausdorff dimension. We investigate the…

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

In this article we introduce the notion of badly approximable matrices of higher order using higher sucessive minima in $\mathbb R^d$. We prove that for order less than $d$, they have Lebesgue measure zero and the gaps between them still…

We improve recently published results about resources of Restricted Boltzmann Machines (RBM) and Deep Belief Networks (DBN) required to make them Universal Approximators. We show that any distribution p on the set of binary vectors of…

We prove that for any norm |*| in the d-dimensional real vector space V and for any odd n>0 there is a non-negative polynomial p(x), x in V of degree 2n such that p^{1/2n}(x) < |x| < c(n,d) p^{1/2n}(x), where c(n,d)={n+d-1 choose n}^{1/2n}.…

In this paper we prove inequalities for multiplicative analogues of Diophantine exponents, similar to the ones known in the classical case. Particularly, we show that a matrix is badly approximable if and only if its transpose is badly…

In the following article we consider approximate Bayesian computation (ABC) for certain classes of time series models. In particular, we focus upon scenarios where the likelihoods of the observations and parameter are intractable, by which…

We consider elections where both voters and candidates can be associated with points in a metric space and voters prefer candidates that are closer to those that are farther away. It is often assumed that the optimal candidate is the one…

In this paper we investigate the problem of how well points in finite dimensional p-adic solenoids can be approximated by rationals. The setting we work in was previously studied by Palmer, who proved analogues of Dirichlet's theorem and…

We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…

Using full images of accessible functors, we prove some results about combinatorial and accessible model categories. In particular, we give an example of a weak factorization system on a locally presentable category which is not accessible.

Our interest is whether two binomial parameters differ, which parameter is larger, and by how much. This apparently simple problem was addressed by Fisher in the 1930's, and has been the subject of many review papers since then. Yet there…

We establish that the set of pairs $(\alpha, \beta)$ of real numbers such that $$ \liminf_{q \to + \infty} q \cdot (\log q)^2 \cdot \Vert q \alpha \Vert \cdot \Vert q \beta \Vert > 0, $$ where $\Vert \cdot \Vert$ denotes the distance to the…

We prove that if $J$ is the limit set of an irreducible conformal iterated function system (with either finite or countably infinite alphabet), then the badly approximable vectors form a set of full Hausdorff dimension in $J$. The same is…

The weak value approximation has been in use for thirty-five years, but it has not as of yet received a truly complete derivation, leaving its mathematical validity in a state of limbo. Herein, I fill this gap, deriving the weak value…