Related papers: Countable Ordered Groups and Weihrauch Reducibilit…
We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints…
This paper studies high-order evaluation complexity for partially separable convexly-constrained optimization involving non-Lipschitzian group sparsity terms in a nonconvex objective function. We propose a partially separable adaptive…
We characterize Weihrauch reducibility in E-PA$^{\omega}$ + QF-AC$^{0,0}$ and all systems containing it by the provability in a linear variant of the same calculus using modifications of G\"odel's Dialectica interpretation that incorporate…
We indicate a way of distinguishing between structures, for which, we call two structures distinguishable. Roughly, being distinguishable means that they differ in the number of realizations each gives for some formula. Being…
A quasi-order $Q$ induces two natural quasi-orders on $P(Q)$, but if $Q$ is a well-quasi-order, then these quasi-orders need not necessarily be well-quasi-orders. Nevertheless, Goubault-Larrecq showed that moving from a well-quasi-order $Q$…
An adaptive regularization algorithm using high-order models is proposed for partially separable convexly constrained nonlinear optimization problems whose objective function contains non-Lipschitzian $\ell_q$-norm regularization terms for…
The non-commutative version of the euclidean $g^2\phi^4$ theory is considered. By using Wilsonian flow equations the ultraviolet renormalizability can be proved to all orders in perturbation theory. On the other hand, the infrared sector…
A set of integers $A$ is computably encodable if every infinite set of integers has an infinite subset computing $A$. By a result of Solovay, the computably encodable sets are exactly the hyperarithmetic ones. In this paper, we extend this…
Countable tightness may be destroyed by countably closed forcing. We characterize the indestructibility of countable tightness under countably closed forcing by combinatorial statements similar to the ones Tall used to characterize…
We study a conjecture by Deaconescu on the solubility of finite groups with claims that if more than half of the elements in a finite group has the same order $k$, then the group is soluble. We show that the original conjecture fails by…
In his book, John Stillwell wrote "finding the exact strength of the Brouwer invariance theorems seems to me one of the most interesting open problems in reverse mathematics." In this article, we solve Stillwell's problem by showing that…
The paper is devoted to a reverse-mathematical study of some well-known consequences of Ramsey's theorem for pairs, focused on the chain-antichain principle $\mathsf{CAC}$, the ascending-descending sequence principle $\mathsf{ADS}$, and the…
It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this…
We introduce the first provably efficient algorithm to check if a finitely generated subgroup of an almost simple semi-simple group over the rationals is Zariski-dense. We reduce this question to one of computing Galois groups, and to this…
The notion of $n$th order convexity in the sense of Hopf and Popoviciu is defined via the nonnegativity of the $(n+1)$st order divided differences of a given real-valued function. In view of the well-known recursive formula for divided…
We consider the reverse math strength of the statement $\mathsf{C\text-DM}$:"Every completely determined Borel set is measurable." Over $\mathsf{WWKL}_0$, we obtain the following results analogous to the previously studied category case.…
We determine, up to the equivalence of first-order interdefinability, all structures which are first-order definable in the random partial order. It turns out that these structures fall into precisely five equivalence classes. We achieve…
We give a combinatorial description for the weak order on the hyperoctahedral group. This characterization is then used to analyze the order-theoretic properties of the shifted products of hyperoctahedral groups. It is shown that each…
We study the renormalizability in theories of a self-interacting Lifshitz scalar field. We show that although the statement of power-counting is true at one-loop order, in generic cases where the scalar field is dimensionless, an infinite…
We show that Hopf invariants, defined by evaluation in Harrison cohomology of the commutative cochains of a space, calculate the logarithm map from a fundamental group to its Malcev Lie algebra. They thus present the zeroth Harrison…