相关论文: Canonization of analytic equivalences on the Carls…
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…
In this series of papers we advance Ramsey theory of colorings over partitions. In this part, we concentrate on anti-Ramsey relations, or, as they are better known, strong colorings, and in particular solve two problems from [CKS21]. It is…
We analyze the Dual Ramsey Theorem for $k$ partitions and $\ell$ colors ($\mathsf{DRT}^k_\ell$) in the context of reverse math, effective analysis, and strong reductions. Over $\mathsf{RCA}_0$, the Dual Ramsey Theorem stated for Baire…
Let $E$ be a countable Borel equivalence relation on the space $\mathcal{E}_{\infty}$ of all infinite partitions of the natural numbers. We show that $E$ coincides with equality below a Carlson-Simpson generic element of…
At the beginning of 1950's Erd\H os and Rado suggested the investigation of the Ramsey-type results where the number of colors is not finite. This marked the birth of the so-called canonizing Ramsey theory. In 1985 Pr\"omel and Voigt made…
Given a finite coloring (or finite partition) of the free semigroup $A^+$ over a set $A$, we consider various types of monochromatic factorizations of right sided infinite words $x\in A^\omega$. Some stronger versions of the usual notion of…
We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…
We introduce a generalization of stationary set reflection which we call "filter reflection", and show it is compatible with the axiom of constructibility as well as with strong forcing axioms. We prove the independence of filter reflection…
We introduce a family of forcing notions that are helpful in showing that certain graphs do not have countable colourings of (additive) Borel class alpha. We construct graphs that are ''weakly minimal'' for such colourings.
We study generating functions of ordinary and plane partitions coloured by the action of a finite subgroup of the corresponding special linear group. After reviewing known results for the case of ordinary partitions, we formulate a…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
Recently we showed that the postulated diffeomorphic equivalence of states implies quantum mechanics. This approach takes the canonical variables to be dependent by the relation p=\partial_q S_0 and exploits a basic GL(2,C)-symmetry which…
Ramsey's theorem states that each coloring has an infinite homogeneous set, but these sets can be arbitrarily spread out. Paul Erdos and Fred Galvin proved that for each coloring f, there is an infinite set that is "packed together" which…
Given an analytic equivalence relation, we tend to wonder whether it is Borel. When it is non Borel, there is always the hope it will be Borel on a "large" set -- nonmeager or of positive measure. That has led Kanovei, Sabok and Zapletal to…
We give a new proof of a partition theorem popularly known as Elder's theorem, but which is also credited to Stanley and Fine. We extend the theorem to the context of colored partitions (or prefabs). More specifically, we give analogous…
The enterprise of comparing mathematical theorems according to their logical strength is an active area in mathematical logic. In this setting, called reverse mathematics, one investigates which theorems provably imply which others in a…
The Carlson-Simpson lemma is a combinatorial statement occurring in the proof of the Dual Ramsey theorem. Formulated in terms of variable words, it informally asserts that given any finite coloring of the strings, there is an infinite…
This work provides some general theorems about unconditional and conditional weak convergence of empirical processes in the case of Poisson sampling designs. The theorems presented in this work are stronger than previously published…
Plant differently colored points in the plane, then let random points ("Poisson rain") fall, and give each new point the color of the nearest existing point. Previous investigation and simulations strongly suggest that the colored regions…
We prove that for every equivalence relation on a barrier on the space $\langle FIN^{[\infty]}_k,\leq,r\rangle$, for any $k$, there exists $Y\in FIN_k^{[\infty]}$ so that the restriction of the coloring on $\langle Y\rangle$ is canonical.