Related papers: Solovay reducibility implies S2a-reducibility
We show that the reduced sl(n) homology defined by Khovanov and Rozansky is invariant under component-preserving positive mutation when n is odd.
We study the reducibility of a Linear Schr\"odinger equation subject to a small unbounded almost-periodic perturbation which is analytic in time and space. Under appropriate assumptions on the smallness, analiticity and on the frequency of…
New lower bounds involving sum, difference, product, and ratio sets for a set $A\subset \C$ are given. The estimates involving the sum set match, up to constants, the one obtained by Solymosi for the reals and are obtained by generalising…
The complexity of equivalence relations has received much attention in the recent literature. The main tool for such endeavour is the following reducibility: given equivalence relations $R$ and $S$ on natural numbers, $R$ is computably…
A succesful method to describe the asymptotic behavior of a discrete time stochastic process governed by some recursive formula is to relate it to the limit sets of a well chosen mean differential equation. Under an attainability condition,…
The purpose of this note is to highlight and address inaccuracies in the convergence guarantees of SCvx, a nonconvex trajectory optimization algorithm proposed by Mao et al. (arXiv:1804.06539), and make connections to relevant prior work.…
We represent preferences that exhibit absolute or relative attitudes towards ambiguity without assuming convexity of preferences. Our analysis is motivated by the recent experimental evidence by Baillon and Placido (2019) indicating that…
We study adaptive data-dependent dimensionality reduction in the context of supervised learning in general metric spaces. Our main statistical contribution is a generalization bound for Lipschitz functions in metric spaces that are…
In 1975, G. P\'olya suggested that if two proofreaders found $a$ and $b$ errors in a text, of which $c$ errors were found by both of them, then a reasonable approximation of the unknown number $e$ of all errors is $e\approx ab/c$. We…
In this paper, we propose a novel association measure for longitudinal studies based on the traditional definition of relative risk. In a Markovian fashion, such a proposal takes into account the information content regarding the previous…
We introduce the notion of a reproducible algorithm in the context of learning. A reproducible learning algorithm is resilient to variations in its samples -- with high probability, it returns the exact same output when run on two samples…
I am going to compare well-known properties of infinite words with those of infinite permutations, a new object studied since middle 2000s. Basically, it was Sergey Avgustinovich who invented this notion, although in an early study by Davis…
This paper introduces the class of selfdecomposable distributions concerning Boolean convolution. A general regularity property of Boolean selfdecomposable distributions is established; in particular the number of atoms is at most two and…
Selberg's central limit theorem states that the values of $\log|\zeta(1/2+i \tau)|$, where $\tau$ is a uniform random variable on $[T,2T]$, is distributed like a Gaussian random variable of mean $0$ and standard deviation…
We study the problem of estimating an unknown vector $\theta$ from an observation $X$ drawn according to the normal distribution with mean $\theta$ and identity covariance matrix under the knowledge that $\theta$ belongs to a known closed…
Recently, Z. W. Sun introduced a new kind of numbers $S_n$ and also posed a conjecture on ratio monotonicity of combinatorial sequences related to $S_n$. In this paper, by investigating some arithmetic properties of $S_n$, we give an…
We introduce some classical complexity-theoretic techniques to Parameterized Complexity. First, we study relativization for the machine models that were used by Chen, Flum, and Grohe (2005) to characterize a number of parameterized…
We introduce and initiate the study of a new model of reductions called the random noise model. In this model, the truth table $T_f$ of the function $f$ is corrupted on a randomly chosen $\delta$-fraction of instances. A randomized…
The Robbins-Siegmund theorem establishes the convergence of stochastic processes that are almost supermartingales and is one of the most commonly used approaches for analyzing stochastic iterative algorithms in stochastic approximation and…
We introduce the notion of reduced relative quantum entropy and prove that it is convex. This result is then used to give a simplified proof of a theorem of Lieb and Seiringer.