Related papers: Generalized low solution of $\mathsf{RT}_k^1$ prob…

We study the problem of designing worst-case to average-case reductions for quantum algorithms. For all linear problems, we provide an explicit and efficient transformation of quantum algorithms that are only correct on a small (even…

We are concerned with the three dimensional navier-stokes equations driven by a general multiplicative noise. For every divergence free and mean free initial condition in L2, we establish existence of infinitely many global-in-time…

We investigate the problem of "nonlocal" computation, in which separated parties must compute a function with nonlocally encoded inputs and output, such that each party individually learns nothing, yet together they compute the correct…

Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…

We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…

Let $K$ be a field of characteristic zero. We deal with the algebraic closure of the field of fractions of the ring of formal power series $K[[x_1,\ldots,x_r]]$, $r\geq 2$. More precisely, we view the latter as a subfield of an iterated…

The $3x+1$ Problem asks if whether for every natural number $n$, there exists a finite number of iterations of the piecewise function $$f(2n)=n, \quad f(2n-1)=6n-2, $$ with an iterate equal to the number $1$, or in other words, every…

The Kervaire conjecture asserts that adding a generator and then a relator to a nontrivial group always results in a nontrivial group. We introduce new methods from stable commutator length to study this type of problems about nontriviality…

We study multivariate approximation in the average case setting with the error measured in the weighted $L_2$ norm. We consider algorithms that use standard information $\Lambda^{\rm std}$ consisting of function values or general linear…

The systems of differential equations whose solutions coincide with Bethe ansatz solutions of generalized Gaudin models are constructed. These equations we call the {\it generalized spectral Riccati equations}, because the simplest equation…

Let $\mathfrak{g}$ be a finite-dimensional simple Lie algebra over an algebraically closed field of characteristic 0. In this paper we classify all regular decompositions of $\mathfrak{g}$ and its irreducible root system $\Delta$. A regular…

We investigate the role of continuous reductions and continuous relativisation in the context of higher randomness. We define a higher analogue of Turing reducibility and show that it interacts well with higher randomness, for example with…

A new probabilistic representation is presented for solutions of the incompressible Navier-Stokes equations in 3 dimensions with given forcing and initial velocity. This representation expresses solutions as scaled conditional expectations…

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic…

In a recent work [1, 2] Sjoberg remarked that generalization of the double reduction theory to partial differential equations of higher dimensions is still an open problem. In this note we have attempted to provide this generalization to…

The constraint equations of general relativity can in many cases be solved by the conformal method. We show that a slight modification of the equations of the conformal method admits no solution for a broad range of parameters. This…

For a broad class of input-output maps, arguments based on the coding theorem from algorithmic information theory (AIT) predict that simple (low Kolmogorov complexity) outputs are exponentially more likely to occur upon uniform random…

We use the framework of reverse mathematics to address the question of, given a mathematical problem, whether or not it is easier to find an infinite partial solution than it is to find a complete solution. Following Flood, we say that a…

In the Gaussian sequence model $Y=\mu+\xi$, we study the likelihood ratio test (LRT) for testing $H_0: \mu=\mu_0$ versus $H_1: \mu \in K$, where $\mu_0 \in K$, and $K$ is a closed convex set in $\mathbb{R}^n$. In particular, we show that…

We consider a continuous analogue of Babai et al.'s and Cai et al.'s problem of solving multiplicative matrix equations. Given $k+1$ square matrices $A_{1}, \ldots, A_{k}, C$, all of the same dimension, whose entries are real algebraic, we…