Related papers: Supercritical Space-Width Trade-offs for Resolutio…
Compactness is one of the core notions of analysis: it connects local properties to global ones and makes limits well-behaved. We study the computational properties of the compactness of Cantor space $2^{\mathbb{N}}$ for uncountable covers.…
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolmogorov complexity to query complexity. Our technique…
We describe the set of parameters $(p_1,p_2,q_1,q_2)$ such that the balls $B_{q_1,q_2}^{s,b}$ are rigid in $\ell_{q_1,q_2}^{s,b}$ metric i.e. they are poorly approximated by linear subspaces of dimension $\le (1-\varepsilon)sb$, for large…
We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman and Sikdar, J. Computer and System Sciences, 75(2):137--153, 2009) are…
Bounds on linear codes play a central role in coding theory, as they capture the fundamental trade-off between error-correction capability (minimum distance) and information rate (dimension relative to length). Classical results…
We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…
A recent paper (\cite{BJM}) by Biringer, Johnson, and Minsky prove that any pseudo-Anosov whose stable lamination is the limit of disks in a compression body has a power which extends over some non-trivial minimal compression body. This…
The main observation of this paper is that some sequential weak compactness arguments in Hilbert space theory can be replaced by Heine/Borel compactness arguments (for the strong topology). Even though the latter form of compactness fails…
We prove geometric rigidity inequalities for incompatible fields in dimension higher than 2. We are able to obtain strong scaling-invariant $L^p$ estimates in the supercritical regime, while for critical exponent $1^* = \frac{n}{n-1}$ we…
In this note we show that unsatisfiable systems of linear equations with a constant number of variables per equation over prime finite fields have polynomial-size constant-degree semi-algebraic proofs of unsatisfiability. These are proofs…
Two recent approaches to computation in superposition reach different recursive capacity regimes: H\"anni et al. certify $\tilde{O}(d^{3/2})$ computable features in width $d$ via an approximate-linear recursive template, while Adler and…
The canonical dimension is an invariant attached to admissible representations of p-adic reductive groups, which has only received significant attention in the case of mod-p representations. In the case of complex representations, the…
Given a particular prescription for the Einstein field equations (EFE's), it is important to have general protective theorems that lend support to it. The prescription of data on a timelike hypersurface for the (n + 1)-d EFE's arises in…
Two new applications of a technique for spaceability are given in this paper. For the first time this technique is used in the investigation of the algebraic genericity property of the weak form of Peano's theorem on the existence of…
In this paper, we show a weighted Hardy inequality in a limiting case for functions in weighted Sobolev spaces with respect to an invariant measure. We also prove that the constant in the left-hand side of the inequality is optimal. As…
The nearest-neighbor rule is a well-known classification technique that, given a training set P of labeled points, classifies any unlabeled query point with the label of its closest point in P. The nearest-neighbor condensation problem aims…
The main aim of this paper is to provide cosmological constraints on the Multi Scalar Field Dark Matter model (MSFDM), in which we assume the dark matter is made up of different ultra-light scalar fields. As a first approximation, we…
The braneworld theory appear with the purpose of solving the problem of the hierarchy of the fundamental interactions. The perspectives of the theory emerge as a new physics, for example, deviation of the law of Newton's gravity. One of the…
The stability bounds and error estimates for a compact higher order Numerov-Crank-Nicolson scheme on non-uniform space meshes for the 1D time-dependent Schr\"odinger equation have been recently derived. This analysis has been done in $L^2$…
This paper provides a theoretical justification of the superior classification performance of deep rectifier networks over shallow rectifier networks from the geometrical perspective of piecewise linear (PWL) classifier boundaries. We show…