Related papers: The combinatorics of tau-covers
Motivated by the minimal tower problem, an earlier work studied diagonalizations of covers where the covers are related to linear quasiorders (tau-covers). We deal with two types of combinatorial questions which arise from this study. 1.…
We study diagonalizations of covers using various selection principles, where the covers are related to linear quasiorderings (tau-covers). This includes: equivalences and nonequivalences, combinatorial characterizations, critical…
In a previous work with Mildenberger and Shelah, we showed that the combinatorics of the selection hypotheses involving tau-covers is sensitive to the selection operator used. We introduce a natural generalization of Scheepers' selection…
We solve a problem posed by Cardinali and Sastry [2] about factorization of $2$-covers of finite classical generalized quadrangles. To that end, we develop a general theory of cover factorization for generalized quadrangles, and in…
We continue to investigate various diagonalization properties for sequences of open covers of separable metrizable spaces introduced in Part I. These properties generalize classical ones of Rothberger, Menger, Hurewicz, and Gerlits-Nagy. In…
We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…
We discuss counting problems linked to finite versions of Cantor's diagonal of infinite tableaux. We extend previous results of [2] by refining an equivalence relation that reduces significantly the exhaustive generation. New enumerative…
Let $\kappa$ be any regular cardinal. Assuming the existence of a huge cardinal above $\kappa$, we prove the consistency of $\binom{\kappa^{++}}{\kappa^+}\rightarrow\binom{\tau}{\kappa^+}$ for every ordinal $\tau<\kappa^{++}$. Likewise, we…
We list some open problems, concerning the polarized partition relation. We solve a couple of them by showing that for every singular cardinal $\mu$ one can force the strong polarized relation with respect to the pair $\mu^+,\mu$.
We answer a question of Just, Miller, Scheepers and Szeptycki whether certain diagonalization properties for sequences of open covers are provably closed under taking finite or countable unions. This is a very concise paper. For a…
We provide comprehensive, level-by-level characterizations of large cardinals, in the range from weakly compact to strongly compact, by closure properties of powerful images of accessible functors. In the process, we show that these…
We prove combinatorial theorems concerning the stick principle and cardinal characteristics.
We prove that a certain sequence of tau functions of the Garnier system satisfies Toda equation. We construct a class of algebraic solutions of the system by the use of Toda equation; then show that the associated tau functions are…
We prove combinatorially that the parity of the number of domino tilings of a region is equal to the parity of the number of domino tilings of a particular subregion. Using this result we can resolve the holey square conjecture. We…
We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…
We survey some of the major open problems involving selection principles, diagonalizations, and covering properties in topology and infinite combinatorics. Background details, definitions and motivations are also provided.
Boykin and Jackson recently introduced a property of countable Borel equivalence relations called Borel boundedness, which they showed is closely related to the union problem for hyperfinite equivalence relations. In this paper, we…
In this paper we settle all questions whether (it is consistent that) the properties P and Q [do not] coincide, where P and Q run over selection principles of the type U_fin(O,A).
We provide a model theoretical and tree property like characterization of $\lambda$-$\Pi^1_1$-subcompactness and supercompactness. We explore the behaviour of those combinatorial principles at accessible cardinals.
An equivalence relation in the set of all square binary matrices is described in this work. It is discussed a combinatoric problem about finding the cardinal number and the elements of the factor set according to this relation. We examine…