Related papers: Regressive versions of Hindman's Theorem

The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…

Inspired by Ramsey's theorem for pairs, Rival and Sands proved what we refer to as an inside/outside Ramsey theorem: every infinite graph $G$ contains an infinite subset $H$ such that every vertex of $G$ is adjacent to precisely none, one,…

We prove a central limit theorem for a certain class of functions on sparse rank-one inhomogeneous random graphs endowed with additional i.i.d. edge and vertex weights. Our proof of the central limit theorem uses a perturbative form of…

We present a natural restriction of Hindman's Finite Sums Theorem that admits a simple combinatorial proof (one that does not also prove the full Finite Sums Theorem) and low computability-theoretic and proof-theoretic upper bounds, yet…

Answering a conjecture of A. Sisto, J. Sahasrabudhe proved the exponential version of the Schur theorem: for every finite coloring of the naturals, there exists a monochromatic copy of $\{x,y,x^y:x\neq y\},$ which initiates the study of…

We show that restricting the elimination principle of the natural numbers type in Martin-L\"of Type Theory (MLTT) to a universe of types not containing $\Pi$-types ensures that all definable functions are primitive recursive. This extends…

This note deals with a problem of the probabilistic Ramsey theory in functional analysis. Given a linear operator $T$ on a Hilbert space with an orthogonal basis, we define the isomorphic structure $\Sigma(T)$ as the family of all subsets…

A H\"ormander-type theorem is established for It\^o processes and related backward stochastic partial differential equations (BSPDEs). A short self-contained proof is also provided for the $L^2$-theory of linear, possibly degenerate BSPDEs,…

We present a proof of Hadamard Inverse Function Theorem by the methods of Variational Analysis, adapting an idea of I. Ekeland and E. Sere.

A consistent guiding-center Hamiltonian theory is derived by Lie-transform perturbation method, with terms up to second order in magnetic-field nonuniformity. Consistency is demonstrated by showing that the guiding-center transformation…

We show that the minimization problem of any non-convex and non-lower semi-continuous function on a compact convex subset of a locally convex real topological vector space can be studied via an associated convex and lower semi-continuous…

By the classical Martingale Representation Theorem, replication of random vectors can be achieved via stochastic integrals or solutions of stochastic differential equations. We introduce a new approach to replication of random vectors via…

It is quite well-known from Kurt Godel's (1931) ground-breaking result on the Incompleteness Theorem that rudimentary relations (i.e., those definable by bounded formulae) are primitive recursive, and that primitive recursive functions are…

We study the distributional behavior of additive arithmetic functions evaluated at integers drawn from the harmonic distribution. Our main result shows that a broad family of such functions converges in law to conditioned Dickman-type…

Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…

A canonical system is a kind of first-order system of ordinary differential equations on an interval of the real line parametrized by complex numbers. It is known that any solution of a canonical system generates an entire function of the…

Let $I$ be a homogeneous ideal in the polynomial ring $R = k[z_1, \cdots, z_n]$ , where $k$ is an algebraically closed field of characteristic zero. Macaulay's Theorem provides constraints on the Hilbert function of $I$ or $R/I$ from one…

We deal with the problem of asymptotic distribution of first return times to shrinking balls under iteration generated by a large general class of dynamical systems called weakly Markov. Our ultimate main result is that these distributions…

It is well known that many theorems in recursion theory can be "relativized". This means that they remain true if partial recursive functions are replaced by functions that are partial recursive relative to some fixed oracle set. Uspensky…

This paper presents strong worst-case iteration and operation complexity guarantees for Riemannian adaptive regularized Newton methods, a unified framework encompassing both Riemannian adaptive regularization (RAR) methods and Riemannian…