Related papers: On badly approximable subspaces

Let $k$ be a perfect field and let $X\subset {\mathbb P}^N$ be a hypersurface of degree $d$ defined over $k$ and containing a linear subspace $L$ defined over an algebraic closure $\overline{k}$ with $\mathrm{codim}_{{\mathbb P}^N}L=r$. We…

We recall the notion of nearest integer continued fractions over the Euclidean imaginary quadratic fields $K$ and characterize the "badly approximable" numbers, ($z$ such that there is a $C(z)>0$ with $|z-p/q|\geq C/|q|^2$ for all $p/q\in…

We give local conditions at the infinite places of a number field K ensuring that the intersection of n quadrics in projective N-space over K, N >> n, satisfies weak approximation.

Let X and Y be two infinite-dimensional Banach spaces. If X is crudely finitely representable in every finite-codimensional subspace of Y, then any proper subset of X almost bi-Lipschitz embeds into Y, in a sense quite close to that of F.…

This article explores anti-coproximinal and strongly anti-coproximinal subspaces in the spaces of vector-valued continuous functions and operator spaces. We provide a complete characterization of strongly anti-coproximinal subspaces in $…

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…

The purpose of this article is to study the anti-coproximinal and strongly anti-coproximinal subspaces of the Banach space of all bounded (continuous) functions. We obtain a tractable necessary condition for a subspace to be stronsgly…

This paper addresses weak approximation for rationally connected varieties defined over the function field of a curve, especially at places of bad reduction. Our approach entails analyzing the rational connectivity of the smooth locus of…

We introduce and study the notion of space of almost universal complemented disposition (a.u.c.d.) as a generalization of Kadec space. We show that every Banach space with separable dual is isometrically contained as a $1$-complemented…

This note is motivated by the article of Bamerni, Kadets and Kili\c{c}man [J. Math. Anal. Appl. 435 (2), 1812--1815 (2016)]. We consider the remaining problem which claims that if $A$ is a dense subset of a finite dimensional space $X$,…

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…

The $c$-approximate Near Neighbor problem in high dimensional spaces has been mainly addressed by Locality Sensitive Hashing (LSH), which offers polynomial dependence on the dimension, query time sublinear in the size of the dataset, and…

We initiate a systematic study of lattices of thick subcategories for arbitrary essentially small triangulated categories. To this end we give several examples illustrating the various properties these lattices may, or may not, have and…

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…

An analysis of high-dimensional data can offer a detailed description of a system but is often challenged by the curse of dimensionality. General dimensionality reduction techniques can alleviate such difficulty by extracting a few…

Solving large-scale optimization on-the-fly is often a difficult task for real-time computer graphics applications. To tackle this challenge, model reduction is a well-adopted technique. Despite its usefulness, model reduction often…

We consider the problems of classification and intrinsic dimension estimation on image data. A new subspace based classifier is proposed for supervised classification or intrinsic dimension estimation. The distribution of the data in each…

In this paper we study the polynomial approximations in Hardy-Sobolev spaces on for convex domains. We use the method of pseudoanalytical continuation to obtain the characterization of these spaces in terms of polynomial approximations.

We prove that each semialgebraic subset of $\R^n$ of positive codimension can be locally approximated of any order by means of an algebraic set of the same dimension. As a consequence of previous results, algebraic approximation preserving…

The goal of subspace learning is to find a $k$-dimensional subspace of $\mathbb{R}^d$, such that the expected squared distance between instance vectors and the subspace is as small as possible. In this paper we study subspace learning in a…