Related papers: Generalized independence

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$…

A set-system $X$ is a $(\lambda, \kappa,\mu)$-system iff $|X|=\lambda$, $|x|=\kappa$ for each $x\in X$, and $X$ is $\mu$-almost disjoint. We write $[\lambda, \kappa, \mu] -> \rho$ iff every $(\lambda, \kappa,\mu)$-system has a "conflict…

We argue that we solved Hilbert's first problem positively (after reformulating it just to avoid the known consistency results) and give some applications. Let lambda to the revised power of kappa, denoted lambda^{[kappa]}, be the minimal…

We apply the concept of generic existence to p-point, q, and selective independent families that complements and emulates the ultrafilter generic existence results from Canjar and Ketonen.

We prove that if there are $\mathfrak c$ incomparable selective ultrafilters then, for every infinite cardinal $\kappa$ such that $\kappa^\omega=\kappa$, there exists a group topology on the free Abelian group of cardinality $\kappa$…

We show a new proof for the fact that when $\kappa$ and $\lambda$ are infinite cardinals satisfying $\lambda ^ \kappa = \lambda$, the cofinality of the set of all functions from $\lambda$ to $\kappa$ ordered by everywhere domination is…

We provide a model where u(\kappa) < 2^{\kappa} for a supercompact cardinal \kappa. Garti and Shelah have provided a sketch of how to obtain such a model by modifying the construction in a paper of Dzamonja and Shelah; we provide here a…

We try to understand complete types over a somewhat saturated model of a complete first order theory which is dependent (previously called NIP), by "decomposition theorems for such types". Our thesis is that the picture of dependent theory…

The prime-coprime graph $\Theta(G)$ of a finite group $G$ is the simple graph with vertex set $G$, where two distinct elements are adjacent whenever the greatest common divisor of their orders is either $1$ or a prime. We characterize all…

Our main result is that, given a collection $\mathcal{R}$ of meager relations on a Polish space $X$ such that $|\mathcal{R}|\leq\omega$, there exists a dense Baire subspace $F$ of $X$ (equivalently, a nowhere meager subset $F$ of $X$) such…

We introduce a general method of constructing locally compact scattered spaces from certain families of sets and then, with the help of this method, we prove that if kappa^{<kappa}=kappa then there is such a space of height kappa^+ with…

An ideal $I$ on a cardinal $\kappa$ is called \emph{rigid} if all automorphisms of $P(\kappa)/I$ are trivial. An ideal is called \emph{$\mu$-minimal} if whenever $G\subseteq P(\kappa)/I$ is generic and $X\in P(\mu)^{V[G]}\setminus V$, it…

The paper provides a survey of results related to the "$\kappa$-generalized distribution", a statistical model for the size distribution of income and wealth. Topics include, among others, discussion of basic analytical properties,…

The independence gap of a graph was introduced by Ekim et al. (2018) as a measure of how far a graph is from being well-covered. It is defined as the difference between the maximum and minimum size of a maximal independent set. We…

We study the existence and cardinality of universal families for classes of rayless graphs. It is known, by a result of Diestel, Halin, and Vogler, that the class of countable rayless graphs does not admit a countable universal family,…

Assume $\kappa = \kappa^{< \kappa}$ (usually $\aleph_0$ or an inaccessible). We shall deal with iterated forcings preserving ${}^{\kappa>}{\rm Ord}$ and not collapsing cardinals along a linear order $L$. A sufficient condition for this,…

We give a combinatorial characterization of when a maximal almost disjoint family of a weakly compact cardinal $\kappa$ is indestructible by the higher random forcing $\mathbb Q_\kappa$. We then use this characterisation to show that…

The concept of jointness for guessing principles, specifically $\diamondsuit_\kappa$ and various Laver diamonds, is introduced. A family of guessing sequences is joint if the elements of any given sequence of targets may be simultaneously…

Using Shelah's revised GCH theorem we prove that if mu<beth_omega <= lambda are cardinals, then every mu-almost disjoint subfamily B of [lambda]^{beth_omega} is essentially disjoint, i.e. for each b from B there is a subset f(b) of b of…

The Kalikow problem for a pair (lambda, kappa) of cardinal numbers, lambda > kappa (in particular kappa =2) is whether we can map the family of omega --sequences from lambda to the family of omega --sequences from kappa in a very continuous…