Related papers: Strong Reductions between Relatives of the Stable …
We study the reverse mathematics and computability-the\-o\-re\-tic strength of (stable) Ramsey's Theorem for pairs and the related principles COH and DNR. We show that SRT$^2_2$ implies DNR over RCA$_0$ but COH does not, and answer a…
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…
The $\mathsf{SRT}^2_2$ vs.\ $\mathsf{COH}$ problem is a central problem in computable combinatorics and reverse mathematics, asking whether every Turing ideal that satisfies the principle $\mathsf{SRT}^2_2$ also satisfies the principle…
We study the positions in the Weihrauch lattice of parallel products of various combinatorial principles related to Ramsey's theorem. Among other results, we obtain an answer to a question of Brattka, by showing that Ramsey's theorem for…
The stable Ramsey's theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a…
No natural principle is currently known to be strictly between the arithmetic comprehension axiom (ACA) and Ramsey's theorem for pairs (RT^2_2) in reverse mathematics. The tree theorem for pairs (TT^2_2) is however a good candidate. The…
Let $n\geq\nu$, let $T$ be an $n$-vertex tree with bipartition class sizes $t_1\geq t_2$, and let $S$ be a $\nu$-vertex tree with bipartition class sizes $\tau_1\geq\tau_2$. Using four natural constructions, we show that the Ramsey number…
We study a restriction of Ramsey's theorem for 2-coloring of triples, in which homogeneous sets for color~1 are of bounded size ($\mathsf{BRT}^3_2$). We prove that the computational content of this statement is very close to Ramsey's…
The statistics of soliton sectors of massive 2D field theories is analysed. In the soliton field algebra, the non-local commutation relations are determined and Weak Locality, Spin-Statistics and CPT theorems are proven. These theorems…
We continue the study of robust reductions initiated by Gavalda and Balcazar. In particular, a 1991 paper of Gavalda and Balcazar claimed an optimal separation between the power of robust and nondeterministic strong reductions.…
Every function over the natural numbers has an infinite subdomain on which the function is non-decreasing. Motivated by a question of Dzhafarov and Schweber, we study the reverse mathematics of variants of this statement. It turns out that…
Strong stability preserving (SSP) Runge-Kutta methods are desirable when evolving in time problems that have discontinuities or sharp gradients and require nonlinear non-inner-product stability properties to be satisfied. Unlike the case…
We study generalizations of Demuth's Theorem, which states that the image of a Martin-L\"of random real under a tt-reduction is either computable or Turing equivalent to a Martin-L\"of random real. We show that Demuth's Theorem holds for…
Informally, a mathematical statement is robust if its strength is left unchanged under variations of the statement. In this paper, we investigate the lack of robustness of Ramsey's theorem and its consequence under the frameworks of reverse…
A partial-active-space (PAS) multi-state (MS) multi-reference second-order perturbation theory (MRPT2) for the electronic structure of strongly correlated systems of electrons, dubbed PASPT2, is formulated by linearizing the intermediate…
Strong Feller property and irreducibility are study for a class of non-linear monotone stochastic partial differential equations with multiplicative noise. H\"older continuity of the associated Markov semigroups are discussed in some…
The least squares of depth trimmed (LST) residuals regression, proposed in Zuo and Zuo (2023) \cite{ZZ23}, serves as a robust alternative to the classic least squares (LS) regression as well as a strong competitor to the famous least…
We give some reductions among problems in (nonnegative) weighted #CSP which restrict the class of functions that needs to be considered in computational complexity studies. Our reductions can be applied to both exact and approximate…
As an approximation to SDSCI [static-dynamic-static (SDS) configuration interaction (CI), a minimal MRCI; Theor. Chem. Acc. 133, 1481 (2014)], SDSPT2 [Mol. Phys. 115, 2696 (2017)] is a CI-like multireference (MR) second-order perturbation…
The consistency relations in large scale structure relate the lower-order correlation functions with their higher-order counterparts. They are direct outcome of the underlying symmetries of a dynamical system and can be tested using data…