Related papers: Strong reductions and combinatorial principles
We dominate non-integral singular operators by adapted sparse operators and derive optimal norm estimates in weighted spaces. Our assumptions on the operators are minimal and our result applies to an array of situations, whose prototype are…
We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…
The restriction of an irreducible unitary representation $\pi$ of a real reductive group $G$ to a reductive subgroup $H$ decomposes into a direct integral of irreducible unitary representations $\tau$ of $H$ with multiplicities…
Dynamic programming (DP) solves a variety of structured combinatorial problems by iteratively breaking them down into smaller subproblems. In spite of their versatility, DP algorithms are usually non-differentiable, which hampers their use…
The theory of uniform approximation of real numbers motivates the study of products of consecutive partial quotients in regular continued fractions. For any non-decreasing positive function $\varphi:\mathbb{N}\to [2,\infty)$, we determine…
A density operator of a bipartite quantum system is called robustly separable if it has a neighborhood of separable operators. Given a bipartite density matrix, its property to be robustly separable is reduced, using the continuous ensemble…
In this paper, we prove explicit reciprocity laws for a class of formal Drinfeld modules having stable reduction of height one, in the spirit of those existing in characteristic zero (cf. the work of Wiles). We begin by defining the Kummer…
The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…
A function is diagonally non-computable (d.n.c.) if it diagonalizes against the universal partial computable function. D.n.c. functions play a central role in algorithmic randomness and reverse mathematics. Flood and Towsner asked for which…
We prove that the existence of finite combinatorial objects such as affine planes, mutually orthogonal Latin squares, and resolvable balanced incomplete block designs can be reformulated as the existence of certain algorithmic reductions…
This paper focuses on systems of nonlinear second-order stochastic differential equations with multi-scales. The motivation for our study stems from mathematical physics and statistical mechanics, for examples, Langevin dynamics and…
We show that the values of entropies of multidimensional shifts of finite type (SFTs) are characterized by a certain computation-theoretic property: a real number $h\geq 0$ is the entropy of such an SFT if and only if it is right…
Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…
Distributionally Robust Optimization (DRO) has enabled to prove the equivalence between robustness and regularization in classification and regression, thus providing an analytical reason why regularization generalizes well in statistical…
In computable analysis testing a real number for being zero is a fundamental example of a non-computable task. This causes problems for division: We cannot ensure that the number we want to divide by is not zero. In many cases, any real…
The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…
The idea of adaptive perturbation theory is to divide a Hamiltonian into a solvable part and a perturbation part. The solvable part contains the non-interacting sector and the diagonal elements of Fock space from the interacting terms. The…
We provide a systematic approach for deducing statistical limit laws via martingale-coboundary decomposition, for nonuniformly hyperbolic systems with slowly contracting and expanding directions. In particular, if the associated return time…
This paper investigates the initial-boundary value problem for weakly coupled systems of time-fractional subdiffusion equations with spatially and temporally varying coupling coefficients. By combining the energy method with the coercivity…
Implementations of known reductions of the Strong Real Jacobian Conjecture (SRJC), to the case of an identity map plus cubic homogeneous or cubic linear terms, and to the case of gradient maps, are shown to preserve significant algebraic…