Related papers: Carlson-Simpson's lemma and applications in revers…
We analyze the strength of the existence of idempotent ultrafilters in higher-order reverse mathematics. Let (Uidem) be the statement that an idempotent ultrafilter on the natural numbers exists. We show that over ACA_0^w, the higher-order…
Using the tools of reverse mathematics in second-order arithmetic, as developed by Friedman, Simpson, and others, we determine the axioms necessary to develop various topics in commutative ring theory. Our main contributions to the field…
We study the uniform computational content of Ramsey's theorem in the Weihrauch lattice. Our central results provide information on how Ramsey's theorem behaves under product, parallelization and jumps. From these results we can derive a…
A rigorous connection between large deviations theory and Gamma-convergence is established. Applications include representations formulas for rate functions, a contraction principle for measurable maps, a large deviations principle for…
In this article, we study questions pertaining to ramified $\mathbb{Z}_p^d$-extensions of a finite connected graph $X$. We also study the Iwasawa theory of dual graphs.
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.
We extend the closed graph theorem and the open mapping theorem to a context in which a natural duality interchanges their extensions.
We extend Krasnoselskii's fixed point result to non-self-real functions. We find a new and simple proof for Hillam's result. In our approach, we don't assume the image of the related mapping to be compact or bounded. In this way, we extend…
We prove an implicit function theorem and an inverse function theorem for free noncommutative functions over operator spaces and on the set of nilpotent matrices. We apply these results to study dependence of the solution of the initial…
We study graphs with the property that every edge-colouring admits a monochromatic cycle (the length of which may depend freely on the colouring) and describe those graphs that are minimal with this property. We show that every member in…
Much recent progress in hypergraph Ramsey theory has focused on constructions that lead to lower bounds for the corresponding Ramsey numbers. In this paper, we consider applications of these results to Gallai colorings. That is, we focus on…
We study a generalisation of Simpson reversal (also known as Simpson's paradox or the Yule-Simpson effect) to $2 \times 2 \times 2$ contingency tables and characterise the cases for which it can and cannot occur with two…
Ramsey Theorem [6] for pairs is intuitionistically but not classically provable: it is equivalent to a subclassical principle [2]. In this note we show that Ramsey may be restated in an intuitionistically provable form, which is informative…
In this article it is proved that for every special AJW-algebra $A$ there exist central projections $e$, $f$, $g\in A$, $e+f+g=1$ such that (1) $eA$ is reversible and there exists a norm-closed two sided ideal $I$ of $C^*(eA)$ such that…
By recent work of \citet{DobrinenICM} and \citet{Balko7} we know that every finite $G$ in the Henson graph $\mathbb{H}_{n+1}$ (the universal ultrahomogeneous $(n+1)$-clique free graph) has exact finite big Ramsey degree $k({G,n})$. That is,…
In this paper, we will develop a significantly more general notion of classical Ramsey numbers (extending most other graph-theoretic generalizations) and make some preliminary characterizations of these new Ramsey numbers using simple…
The areas of Ramsey theory and random graphs have been closely linked ever since Erd\H{o}s' famous proof in 1947 that the 'diagonal' Ramsey numbers $R(k)$ grow exponentially in $k$. In the early 1990s, the triangle-free process was…
We study the reverse mathematics and computability of countable graph theory, obtaining the following results. The principle that every countable graph has a connected component is equivalent to $\mathsf{ACA}_0$ over $\mathsf{RCA}_0$. The…
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…
In this article we develop counterexamples to the Hasse principle using only techniques from undergraduate number theory and algebra. By keeping the technical prerequisites to a minimum, we hope to provide a path for nonspecialists to this…