English
Related papers

Related papers: Restricted invertibility of continuous matrix func…

200 papers

If E is a locally convex topological vector space, let P(E) be the pre-ordered set of all continuous seminorms on E. We study, on the one hand, for g an infinite cardinal those locally convex spaces E which have the g-neighbourhood property…

Functional Analysis · Mathematics 2012-05-18 Helge Glockner

We study closed choice principles for different spaces. Given information about what does not constitute a solution, closed choice determines a solution. We show that with closed choice one can characterize several models of…

Logic · Mathematics 2012-06-18 Vasco Brattka , Matthew de Brecht , Arno Pauly

We establish a superpolynomial lower bound on the range of the permanent function on the set of $n\times n$ matrices with $\pm1$ entries.

Combinatorics · Mathematics 2025-07-15 DeVon Ingram , Alexander Razborov

We show that in finite-dimensional nonlinear approximations, the best $r$-term approximant of a function $f$ almost always exists over $\mathbb{C}$ but that the same is not true over $\mathbb{R}$, i.e., the infimum $\inf_{f_1,\dots,f_r \in…

Numerical Analysis · Mathematics 2018-09-07 Yang Qi , Mateusz Michałek , Lek-Heng Lim

In this paper, we present a more complete version of the minimax theorem established in [7]. As a consequence, we get, for instance, the following result: Let $X$ be a compact, not singleton subset of a normed space $(E,\|\cdot\|)$ and let…

Functional Analysis · Mathematics 2021-04-13 Biagio Ricceri

We give a proof of the conjecture of Nelson and Nguyen [FOCS 2013] on the optimal dimension and sparsity of oblivious subspace embeddings, up to sub-polylogarithmic factors: For any $n\geq d$ and $\epsilon\geq d^{-O(1)}$, there is a random…

Data Structures and Algorithms · Computer Science 2025-11-18 Shabarish Chenakkod , Michał Dereziński , Xiaoyu Dong

We establish equivalence between the boundedness of specific supremum operators and the optimality of function spaces in Sobolev embeddings acting on domains in ambient Euclidean space with a prescribed isoperimetric behavior. Our approach…

Functional Analysis · Mathematics 2024-07-10 David Kubíček

We consider the space of real-valued continuously differentiable functions on a compact subset of a euclidean space. We characterize the completeness of this space and prove that the space of restrictions of continuously differentiable…

Classical Analysis and ODEs · Mathematics 2020-06-18 Leonhard Frerick , Laurent Loosveldt , Jochen Wengenroth

We consider a non-autonomous evolutionary problem \[ u' (t)+\mathcal A (t)u(t)=f(t), \quad u(0)=u_0, \] where $V, H$ are Hilbert spaces such that $V$ is continuously and densely embedded in $H$ and the operator $\mathcal A (t)\colon V\to…

Analysis of PDEs · Mathematics 2014-06-13 Dominik Dier

DR-submodular continuous functions are important objectives with wide real-world applications spanning MAP inference in determinantal point processes (DPPs), and mean-field inference for probabilistic submodular models, amongst others.…

Machine Learning · Computer Science 2019-05-27 An Bian , Kfir Y. Levy , Andreas Krause , Joachim M. Buhmann

In this short note we prove a lemma about the dimension of certain algebraic sets of matrices. This result is needed in our paper arXiv:1201.1672. The result presented here has also applications in other situations and so it should appear…

Algebraic Geometry · Mathematics 2012-01-12 Jairo Bochi , Nicolas Gourmelon

Let $\mathcal{M}$ be a smooth submanifold of $\mathbb{R}^n$ equipped with the Euclidean (chordal) metric. This note considers the smallest dimension $m$ for which there exists a bi-Lipschitz function $f: \mathcal{M} \mapsto \mathbb{R}^m$…

Numerical Analysis · Mathematics 2021-05-31 Mark Iwen , Arman Tavakoli , Benjamin Schmidt

Continuous submodular functions are a category of generally non-convex/non-concave functions with a wide spectrum of applications. The celebrated property of this class of functions - continuous submodularity - enables both exact…

Machine Learning · Computer Science 2020-06-25 Yatao Bian , Joachim M. Buhmann , Andreas Krause

In this paper we consider unbounded solutions of perturbed convolution Volterra summation equations. The equations studied are asymptotically sublinear, in the sense that the state--dependence in the summation is of smaller than linear…

Dynamical Systems · Mathematics 2016-07-05 John A. D. Appleby , Denis D. Patterson

A common problem in analytic number theory is to bound the sum of an arithmetic function over a set of integers. Nair and Tenenbaum found a very general bound that applies to short sums of a multivariable arithmetic function over polynomial…

Number Theory · Mathematics 2015-05-27 Kevin Henriot

The eigenvalue spacing of a uniformly chosen random finite unipotent matrix in its permutation action on lines is studied. We obtain bounds for the mean number of eigenvalues lying in a fixed arc of the unit circle and offer an approach…

Combinatorics · Mathematics 2007-05-23 Jason Fulman

We bound the number of nearly orthogonal vectors with fixed VC-dimension over $\setpm^n$. Our bounds are of interest in machine learning and empirical process theory and improve previous bounds by Haussler. The bounds are based on a simple…

Combinatorics · Mathematics 2011-02-18 Lee-Ad Gottlieb , Leonid , Kontorovich , Elchanan Mossel

Given a function $f : A \to \mathbb{R}^n$ of a certain regularity defined on some open subset $A \subseteq \mathbb{R}^m$, it is a classical problem of analysis to investigate whether the function can be extended to all of $\mathbb{R}^m$ in…

General Relativity and Quantum Cosmology · Physics 2024-08-22 Jan Sbierski

We analyze modular invariance drawing inspiration from tauberian theorems. Given a modular invariant partition function with a positive spectral density, we derive lower and upper bounds on the number of operators within a given energy…

High Energy Physics - Theory · Physics 2020-01-08 Baur Mukhametzhanov , Alexander Zhiboedov

With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…

Data Structures and Algorithms · Computer Science 2014-11-14 Jincheng Mei , Kang Zhao , Bao-Liang Lu