arXiv (All)
open access
$\mathbf{Bad}(\mathbf{r};\mathbf{s})$ is Hyperplane Absolute Winning
Given an $m$-dimensional weight $\mathbf{r}$ and an $n$-dimensional weight $\mathbf{s}$, we prove that the set of $(\mathbf{r};\mathbf{s})$-badly approximable $m\times n$ matrices is hyperplane absolute winning on $\mathbb{R}^{m\times n}$. This fully answers a question \cite[Question 8.2 (iii)]{Kl}
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the effective sharp stability of the Faber-Krahn inequality#984670
- Stability of maximal relative projection constants#925561
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
- Sharp margin-based generalization bounds for realizable SVM#1011560
- KKTCode: Asymptotically Optimal Linear Codes for Noisy Feedback AWGN Channels#1116449
Record · ID 1036402
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive