Related papers: Gruff Ultrafilters
We prove that \textsf{P}-points (even strong P-points) and Gruff ultrafilters exist in any forcing extension obtained by adding fewer than $\aleph_{\omega}% $-many random reals to a model of \textsf{CH. }These results improve and correct…
We consider a cardinal invariant closely related to Hindman's theorem. We prove that this cardinal invariant is small in the iterated Sacks perfect set forcing model, and that its corresponding parametrized diamond principle implies the…
A set X which is a subset of the Cantor set has property (s) (Marczewski (Spzilrajn)) iff for every perfect set P there exists a perfect set Q contained in P such that Q is a subset of X or Q is disjoint from X. Suppose U is a nonprincipal…
We show the consistency of ZFC +''there is no NWD-ultrafilter on omega'', which means: for every non principle ultrafilter D on the set of natural numbers, there is a function f from the set of natural numbers to the reals, such that for…
We provide two types of guessing principles for ultrafilter ($\diamondsuit^{-}_{\lambda}(U), \ \diamondsuit^p_\lambda(U)$) on $\omega$ which form subclasses of Tukey-top ultrafilters, and construct such ultrafilters in $ZFC$. These…
We continue the study of the Galvin property from \cite{bgs} and \cite{Benhamou2}. In particular, we deepen the connection between certain diamond-like principles and non-Galvin ultrafilters. We also show that any Dodd sound non p-point…
It is proved to be consistent relative to a measurable cardinal that there is a uniform ultrafilter on the real numbers which is generated by fewer than the maximum possible number of sets. It is also shown to be consistent relative to a…
We present three models concerning Tukey types of ultrafilters on $\omega$. The first model is built via a countable support iteration, and we show there is no basically generated ultrafilter in such model. The second and third models are…
Ultrafilters are very useful and versatile objects with applications throughout mathematics: in topology, analysis, combinarotics, model theory, and even theory of social choice. Proofs based on ultrafilters tend to be shorter and more…
We investigate the combinatorial structure of the set of maximal antichains in a Boolean algebra ordered by almost refinement. We also consider the reaping relation and its associated cardinal invariants, focusing in particular on reduced…
In this paper, we propose the construction of critically sampled perfect reconstruction two-channel filterbanks on arbitrary undirected graphs.Inspired by the design of graphQMF proposed in the literature, we propose a general ``spectral…
We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…
We study ultrafilters from the perspective of the algebra in the \v{C}ech-Stone compactification of the natural numbers, and idempotent elements therein. The first two results that we prove establish that, if $p$ is a Q-point (resp. a…
We point out one of the differences between rapid ultrafilters and Q-points: Rapid ultrafilters may have empty intersection with van der Waerden ideal, whereas every Q-point has a non-empty intersection with van der Waerden ideal. Assuming…
Our results in this paper increase the model-theoretic precision of a widely used method for building ultrafilters, and so advance the general problem of constructing ultrafilters whose ultrapowers have a precise degree of saturation. We…
We continue investigations of reasonable ultrafilters on uncountable cardinals defined in Shelah math.LO/0407498 and studied also in math.LO/0605067. We introduce a general scheme of generating a filter on lambda from filters on smaller…
We improve Galvin's Theorem for ultrafilters which are p-point limits of p-points. This implies that in all the canonical inner models up to a superstrong cardinal, every $\kappa$-complete ultrafilter over a measurable cardinal $\kappa$…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
It is well known that the ring of polynomial invariants of a reductive group is finitely generated. However, it is difficult to give strong upper bounds on the degrees of the generators, especially over fields of positive characteristic. In…
A set of natural numbers will be called \emph{harmonic} if the reciprocals of its elements form a divergent series. An ultrafilter of the natural numbers will he called \emph{harmonic} if all each members are harmonic sets. The harmonic…