Related papers: The reverse mathematics of non-decreasing subseque…
We prove that every weak solution to a certain class of infinitely degenerate quasilinear equations is continuous. An essential feature of the operators we consider is that their Fefferman-Phong associated metric may be non doubling with…
We introduce natural strengthenings of sequential compactness called the $r$-Ramsey property for each natural number $r\geq 1$. We prove that metrizable compact spaces are $r$-Ramsey for all $r$ and give examples of compact spaces that are…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
A basic result in the elementary theory of continued fractions says that two real numbers share the same tail in their continued fraction expansions iff they belong to the same orbit under the projective action of PGL(2,Z). This result was…
In this paper we examine the reverse mathematical strength of a variation of Hindman's Theorem HT constructed by essentially combining HT with the Thin Set Theorem TS to obtain a principle which we call thin-HT. thin-HT says that every…
We characterize the complexity functions of subshifts up to asymptotic equivalence. The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, every…
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 present a generalization of the inverse mapping theorem, where variations of a weaker non-expansiveness property (referred to as property ${\sf A}$) replace the key $\mathsf{C}^1$ condition. We also obtain inverse mapping theorems that…
Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that satisfy an analogue of Hindman's Theorem. It is an open…
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Ramsey algebras are structures that satisfy an analogue of Hindman's Theorem. This paper introduces Ramsey algebras and…
Reverse Mathematics (RM hereafter) is a program in the foundations of mathematics founded by Friedman and developed extensively by Simpson and others. The aim of RM is to find the minimal axioms needed to prove a theorem of ordinary, i.e.…
Ramsey's theorem, concerning the guarantee of certain monochromatic patterns in large enough edge-coloured complete graphs, is a fundamental result in combinatorial mathematics. In this work, we highlight the connection between this…
Our starting point is Mumford's conjecture, on representations of Chevalley groups over fields, as it is phrased in the preface of "Geometric Invariant Theory". After extending the conjecture appropriately, we show that it holds over an…
We describe a theory of finite sets, and investigate the analogue of Dedekind's theory of natural number systems (simply infinite systems) in this theory. Unlike the infinitary case, in our theory, natural number systems come in differing…
For any set $A$ of natural numbers with positive upper Banach density and any $k\geq 1$, we show the existence of an infinite set $B\subset{\mathbb N}$ and a shift $t\geq0$ such that $A-t$ contains all sums of $m$ distinct elements from $B$…
We deal with germs of diffeomorphisms that are reversible under an involution. We establish that this condition implies that, in general, both the family of reversing symmetries and the group of symmetries are not finite, in contrast with…
We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…
The thin set theorem for $n$-tuples and $k$ colors ($\mathsf{TS}^n_k$) states that every $k$-coloring of $[\mathbb{N}]^n$ admits an infinite set of integers $H$ such that $[H]^n$ avoids at least one color. In this paper, we study the…
We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. Also a beginning of classification theory of finite models in undertaken.
One-parameter natural exponential family (NEF) plays fundamental roles in probability and statistics. This article contains two independent results: (a) A conjecture of Bar-Lev, Bshouty and Enis states that a polynomial with a simple root…