Tag Archives: Minimal Walks

Square with built-in diamond-plus

Joint work with Ralf Schindler. Abstract. We formulate combinatorial principles that combine the square principle with various strong forms of diamond, and prove that the strongest amongst them holds in $L$ for every infinite cardinal. As an application, we prove that … Continue reading

Posted in Publications, Squares and Diamonds | Tagged , , , , , , , | 1 Comment

Chain conditions of products, and weakly compact cardinals

Abstract.  The history of productivity of the $\kappa$-chain condition in partial orders, topological spaces, or Boolean algebras is surveyed, and its connection to the set-theoretic notion of a weakly compact cardinal is highlighted. Then, it is proved that for every … Continue reading

Posted in Partition Relations, Publications | Tagged , , , , , | 2 Comments

Complicated Colorings

Abstract. If $\lambda,\kappa$ are regular cardinals, $\lambda>\kappa^+$, and $E^\lambda_{\ge\kappa}$ admits a nonreflecting stationary set, then $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ holds. (Recall that  $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ asserts the existence of  a coloring $d:[\lambda]^2\rightarrow\lambda$ such that for any family $\mathcal A\subseteq[\lambda]^{<\kappa}$ of size $\lambda$, consisting of pairwise … Continue reading

Posted in Partition Relations, Publications | Tagged , | 2 Comments

2014 Workshop in Set Theory, Oberwolfach

I gave an invited talk at the Set Theory workshop in Obwerwolfach, January 2014. Talk Title: Complicated Colorings. Abstract: If $\lambda,\kappa$ are regular cardinals, $\lambda>\kappa^+$, and $E^{\lambda}_{\ge\kappa}$ admits a nonreflecting stationary set, then $\text{Pr}_1(\lambda,\lambda,\lambda,\kappa)$ holds. Downloads:

Posted in Invited Talks | Tagged , | 5 Comments

Walk on countable ordinals: the characteristics

In this post, we shall present a few aspects of the method of walk on ordinals (focusing on countable ordinals), record its characteristics, and verify some of their properties. All definitions and results in this post are due to Todorcevic. … Continue reading

Posted in Blog, Expository | Tagged | 2 Comments

Rectangular square-bracket operation for successor of regular cardinals

Joint work with Stevo Todorcevic. Extended Abstract: Consider the coloring statement $\lambda^+\nrightarrow[\lambda^+;\lambda^+]^2_{\lambda^+}$ for a given regular cardinal $\lambda$: In 1990, Shelah proved the above for $\lambda>2^{\aleph_0}$; In 1991, Shelah proved the above for $\lambda>\aleph_1$; In 1997, Shelah proved the above … Continue reading

Posted in Partition Relations, Publications | Tagged , , , | 2 Comments

Young Researchers in Set Theory 2011

These are the slides of a talk I gave at the Young Researchers in Set Theory 2011 meeting (Königswinter, 21–25 March 2011). Talk Title: Around Jensen’s square principle Abstract: Jensen‘s square principle for a cardinal $\lambda$ asserts the existence of a particular ladder … Continue reading

Posted in Invited Talks | Tagged , , , , , | Leave a comment

Transforming rectangles into squares, with applications to strong colorings

Abstract: It is proved that every singular cardinal  $\lambda$ admits a function $\textbf{rts}:[\lambda^+]^2\rightarrow[\lambda^+]^2$ that transforms rectangles into squares. That is, whenever $A,B$ are cofinal subsets of $\lambda^+$, we have $\textbf{rts}[A\circledast B]\supseteq C\circledast C$, for some cofinal subset $C\subseteq\lambda^+$. As a … Continue reading

Posted in Partition Relations, Publications | Tagged , , , , | 1 Comment