Related papers: Club-guessing, stationary reflection, and coloring…
We introduce a combinatorial notion of measures called Rudin-Keisler capturing and use it to give a new construction of elementary substructures around singular cardinals. The new construction is used to establish mutual stationary results…
Club guessing principles were introduced by Shelah as a weakening of Jensen's diamond. Most spectacularly, they were used to prove Shelah's ZFC bound on the power of the first singular cardinal. These principles have found many other…
We give two results on guessing unbounded subsets of lambda^+. The first is a positive result and applies to the situation of lambda regular and at least equal to aleph_3, while the second is a negative consistency result which applies to…
The main result provide a common generalization for Ramsey-type theorems concerning finite colorings of edge sets of complete graphs with vertices in infinite semigroups. We capture the essence of theorems proved in different fields: for…
We study consequences of stationary and semi-stationary set reflection. We show that the semi stationary reflection principle implies the Singular Cardinal Hypothesis, the failure of weak square principle, etc. We also consider two cardinal…
The road colouring theorem characterizes the class of strongly connected directed graphs with constant out-degree that admit a synchronizing road colouring. The subject of this paper is a pair of related conjectures that generalize the road…
We isolate several classes of stationary sets of kappa^omega and investigate implications among them. Under a large cardinal assumption, we prove a structure theorem for stationary sets.
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
We prove that if there is an elementary embedding from the universe to itself, then there is a proper class of measurable successor cardinals.
The concepts of closed unbounded (club) and stationary sets are generalised to $\gamma$-club and $\gamma$-stationary sets, which are closely related to stationary reflection. We use these notions to define generalisations of Jensen's…
We prove that for regular $\lambda$ above a strong limit singular $\mu$ certain guessing principles follow just from cardinal arithmetic assumptions. The main result is that for such $\lambda$ and $\mu$ there are coboundedly many regular…
We revisit several results concerning club principles and nonsaturation of the nonstationary ideal, attempting to improve them in various ways. So we typically deal with a (non necessarily normal) ideal $J$ extending the nonstationary ideal…
We prove that it is consistent that Club Stationary Reflection and the Special Aronszajn Tree Property simultaneously hold on $\omega_2$, thereby contributing to the study of the tension between compactness and incompactness in set theory.…
Suppose that lambda is the successor of a singular cardinal mu whose cofinality is an uncountable cardinal kappa. We give a sufficient condition that the club filter of lambda concentrating on the points of cofinality kappa is not…
We prove that if the set of unordered pairs of real numbers is colored by finitely many colors, there is a set of reals homeomorphic to the rationals whose pairs have at most two colors. Our proof uses large cardinals and it verifies a…
While many inner model theoretic combinatorial principles are incompatible with large cardinal axioms, on some rare occasions, large cardinals actually imply that the structure of the universe of sets is analogous to the canonical inner…
We study several ideal-based constructions in the context of singular stationarity. By combining methods of strong ideals, supercompact embeddings, and Prikry-type posets, we obtain three consistency results concerning mutually stationary…
We obtain results on the condensation principle called local club condensation. We prove that in extender models an equivalence between the failure of local club condensation and subcompact cardinals holds. This gives a characterization of…
A $t$-tone coloring of a graph $G$ assigns to each vertex a set of $t$ colors such that any pair of vertices $u, v$ with distance $d$ can share at most $d-1$ colors. In this note, we prove several new results on $t$-tone coloring. For…
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…