Related papers: Variants of Solovay reducibility
In this work, we develop efficient solvers for linear inverse problems based on randomized singular value decomposition (RSVD). This is achieved by combining RSVD with classical regularization methods, e.g., truncated singular value…
We prove a reducibility result for a linear wave equation with a time quasi-periodic driving on the one dimensional torus. The driving is assumed to be fast oscillating, but not necessarily of small size. Provided that the external…
This work develops some technology for accessing the loop expansion of the Kontsevich integral of a knot. The setting is an application of the LMO invariant to certain surgery presentations of knots by framed links in the solid torus. A…
Algorithmic theories of randomness can be related to theories of probabilistic sequence prediction through the notion of a predictor, defined as a function which supplies lower bounds on initial-segment probabilities of infinite sequences.…
Random matrices like GUE, GOE and GSE have been studied for decades and have been shown that they possess a lot of nice properties. In 2005, a new property of independent GUE random matrices is discovered by Haagerup and Thorbj{\o}rnsen in…
Normal numbers were introduced by Borel and later proven to be a weak notion of algorithmic randomness. We introduce here a natural relativization of normality based on generalized number representation systems. We explore the concepts of…
Following the groundbreaking Moser-Tardos algorithm for the Lovasz Local Lemma (LLL), a series of works have exploited a key ingredient of the original analysis, the witness tree lemma, in order to: derive deterministic, parallel and…
We study topologically invariant means on $L^{\infty}(\mathbb{R})$, the set of all essentially bounded functions on the real line, and prove that invariance with respect to a single convolution operator is sufficient for a mean to be…
We propose center-outward superquantile and expected shortfall functions, with applications to multivariate risk measurements, extending the standard notion of value at risk and conditional value at risk from the real line to…
We develop a theory of regularity for continuum Schr\"odinger operators based on the Martin compactification of the complement of the essential spectrum. This theory is inspired by Stahl--Totik regularity for orthogonal polynomials, but…
We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…
In a previous paper, the second author defined integer-valued functions delta_n on the first cohomology of a 3-manifold, generalizing McMullen's Alexander norm. It was shown that these functions give lower bounds on the Thurston norm. In…
A new set of symmetric correction functions is presented for high-order flux reconstruction, that expands upon, while incorporating, all previous correction function sets and opens the possibility for improved performance. By considering FR…
Unlike Martin-L\"of randomness and Schnorr randomness, computable randomness has not been defined, except for a few ad hoc cases, outside of Cantor space. This paper offers such a definition (actually, several equivalent definitions), and…
In the theory of tractability of multivariate problems one usually studies problems with finite smoothness. Then we want to know which $s$-variate problems can be approximated to within $\varepsilon$ by using, say, polynomially many in $s$…
Let $\mu$ and $\nu$ be two probability measures on $\R^d$, where $\mu(\d x)= \e^{-V(x)}\d x$ for some $V\in C^1(\R^d)$. Explicit sufficient conditions on $V$ and $\nu$ are presented such that $\mu*\nu$ satisfies the log-Sobolev, Poincar\'e…
Employing two models, we show that various counting functions of a random variable defined by restriction or contraction of a ranked set with multiplicity (e.g., classical and arithmetic matroids) have expectations given by the…
A number of mathematical methods have been shown to model the zeroes of $L$-functions with remarkable success, including the Ratios Conjecture and Random Matrix Theory. In order to understand the structure of convolutions of families of…
A real number is called left-computable if there exists a computable increasing sequence of rational numbers converging to it. In this article we investigate the Kolmogorov complexity and the binary expansions of a very specific subset of…
We show that certain monotone functionals on the Hardy spaces and convex functionals on the Bergman spaces are maximized at the normalized reproducing kernels among the functions of norm $1$, thus proving the contractivity conjecture of…