Related papers: The reverse mathematics of non-decreasing subseque…
We prove a variant of the multidimensional polynomial Szemer\'edi theorem of Bergelson and Leibman where one replaces polynomial sequences with other sparse sequences defined by functions that belong to some Hardy field and satisfy certain…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…
Let the metric space $\mathbb R^n \setminus \sim$ be the metric space of $n$-sized unordered tuples of real numbers. In the following, it will be shown that if a function $\varphi: \mathbb R^m \to \mathbb R^n \setminus \sim$ is continuous,…
A symmetric subset of the reals is one that remains invariant under some reflection z --> c-z. We consider, for any 0 < x <= 1, the largest real number D(x) such that every subset of $[0,1]$ with measure greater than x contains a symmetric…
We study systems of functional equations whose solutions can be parameterized in function of one variable; our main result proves that the partition regularity (PR) of such systems can be completely characterized by the existence of…
Disjunctive finitary programs are a class of logic programs admitting function symbols and hence infinite domains. They have very good computational properties, for example ground queries are decidable while in the general case the stable…
Given a finite set of roots of unity, we show that all power sums are non-negative integers iff the set forms a group under multiplication. The main argument is purely combinatorial and states that for an arbitrary finite set system the…
This paper is devoted to the proof Gauss' divergence theorem in the framework of "ultrafunctions". They are a new kind of generalized functions, which have been introduced recently [2] and developed in [4], [5] and [6]. Their peculiarity is…
We show a short proof of Higman's lemma using Friedman's adjacent Ramsey theorem for pairs. This provides an alternative proof of the known upper bound for the reverse mathematical status of Higman's lemma and that of its miniaturised…
We show that for any uniformly parabolic fully nonlinear second-order equation with bounded measurable "coefficients" and bounded "free" term in the whole space or in any cylindrical smooth domain with smooth boundary data one can find an…
Boyer and Moore have discussed a recursive function that puts conditional expressions into normal form [1]. It is difficult to prove that this function terminates on all inputs. Three termination proofs are compared: (1) using a measure…
This paper is the fourth and the last part of the series "Spherical higher order Fourier analysis over finite fields", aiming to develop the higher order Fourier analysis method along spheres over finite fields, and to solve the Geometric…
We present a new proof of the classical divergence theorem in bounded domains. Our proof is based on a nonlocal analog of the divergence theorem and a rescaling argument. Main ingredients in the proof are nonlocal versions of the divergence…
We prove that double exponentiation is an upper bound to Ramsey theorem for colouring of pairs when we want to predetermine the order of the differences of successive members of the homogeneous set.
Let's fix a reasonable subsystem $T$ of arithmetic; why are natural extensions of $T$ pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. The goal of this work was to classify the recursive…
We discuss two variations of Edwards' duality theorem. More precisely, we prove one version of the theorem for cones not necessarily containing all constant functions. In particular, we allow the functions in the cone to have a non-empty…
A function is boundedly finite-to-one if there is a natural number $k$ such that each point has at most $k$ inverse images. In this paper, we prove in $\mathsf{ZF}$ (i.e., the Zermelo--Fraenkel set theory without the axiom of choice)…
Most rational systems can be described in terms of orthonormal basis functions. This paper considers the reconstruction of a sparse coefficient vector for a rational transfer function under a pair of orthonormal rational function bases and…
We study the logical and computational properties of basic theorems of uncountable mathematics, in particular Pincherle's theorem, published in 1882. This theorem states that a locally bounded function is bounded on certain domains, i.e.…