Related papers: Cohesive avoidance and arithmetical sets
Ramsey Theory deals with avoiding certain patterns. When constructing an instance that avoids one pattern, it is observed that other patterns emerge. For example, repetition emerges when avoiding arithmetic progression (Van der Waerden…
To enable the study of open sets in computational approaches to mathematics, lots of extra data and structure on these sets is assumed. For both foundational and mathematical reasons, it is then a natural question, and the subject of this…
In this series of papers, we advance Ramsey theory of colorings over partitions. In this part, a correspondence between anti-Ramsey properties of partitions and chain conditions of the natural forcing notions that homogenize colorings over…
A well-ordering principle is a principle of the form: If $X$ is well-ordered then $F(X)$ is well-ordered, where $F$ is some natural operator transforming linear orders into linear orders. Many important subsystems of Second-order Arithmetic…
Quantum coherence is the outcome of the superposition principle. Recently, it has been theorized as a quantum resource, and is the premise of quantum correlations in multipartite systems. It is therefore interesting to study the coherence…
The Hales--Jewett theorem is one of the pillars of Ramsey theory, from which many other results follow. A celebrated theorem of Shelah says that Hales--Jewett numbers are primitive recursive. A key tool used in his proof, now known as the…
The recovery of sparsest overcomplete representation has recently attracted intensive research activities owe to its important potential in the many applied fields such as signal processing, medical imaging, communication, and so on. This…
Let $\mathfrak M=(M,\mathcal X)$ be a model of $\mathsf{RCA}_0+\text{$\Sigma^0_2$-bounding}$ in which $\Sigma^0_2(A)$-induction fails for some $A\in\mathcal X$. We show that (i) if $\mathfrak M$ is a model of the combinatorial principle…
It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb\'an,…
For which sets A does there exist a mapping, computed by a total or partial recursive function, such that the mapping, when its domain is restricted to A, is a 1-to-1, onto mapping to $\Sigma^*$? And for which sets A does there exist such a…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…
We address a core partition regularity problem in Ramsey theory by proving that every finite coloring of the positive integers contains monochromatic Pythagorean pairs, i.e., $x,y\in \mathbb{N}$ such that $x^2\pm y^2=z^2$ for some $z\in…
Ramsey theory enables re-shaping of the basic ideas of quantum mechanics. Quantum observables represented by linear Hermitian operators are seen as the vertices of a graph. Relations of commutation define the coloring of edges linking the…
Coherence phenomena appear in two different situations. In the context of category theory the term `coherence constraints' refers to a set of diagrams whose commutativity implies the commutativity of a larger class of diagrams. In the…
We examine the convergence properties of sequences of nonnegative real numbers that satisfy a particular class of recursive inequalities, from the perspective of proof theory and computability theory. We first establish a number of results…
A simplified Heisenberg spin model is studied in order to examine the idea of decoherence in closed quantum systems. For this purpose, we present a quantifiable definition to quantum coherence $\Xi$, and discuss in some detail a general…
The rational homology of unordered configuration spaces of points on any surface was studied by Drummond-Cole and Knudsen. We compute the rational cohomology of configuration spaces on a closed orientable surface, keeping track of the mixed…
The principle $ADS$ asserts that every linear order on $\omega$ has an infinite ascending or descending sequence. This has been studied extensively in the reverse mathematics literature, beginning with the work of Hirschfeldt and Shore. We…
A system of homogeneous linear equations with integer coefficients is partition regular if, whenever the natural numbers are finitely coloured, the system has a monochromatic solution. The Finite Sums theorem provided the first example of…