Related papers: Filters and Ideal Independence

A family $\mathcal L$ of subsets of a set $X$ is called linked if $A\cap B\ne\emptyset$ for any $A,B\in\mathcal L$. A linked family $\mathcal M$ of subsets of $X$ is maximal linked if $\mathcal M$ coincides with each linked family $\mathcal…

A line packing is optimal if its coherence is as small as possible. Most interesting examples of optimal line packings are achieving equality in some of the known lower bounds for coherence. In this paper two infinite families of real and…

Let G be a simple graph with vertex set V(G). A subset S of V(G) is independent if no two vertices from S are adjacent. The graph G is known to be a Konig-Egervary if alpha(G) + mu(G)= |V(G)|, where alpha(G) denotes the size of a maximum…

We study ideals $\mathcal{I}$ on $\mathbb{N}$ satisfying the following Baire-type property: if $X$ is a complete metric space and $\{X_{A} \colon A \in \mathcal{I} \}$ is a family of nowhere dense subsets of $X$ with $X_{A} \subset X_{B}$…

For a family $\mathcal{F}$ of subsets of a finite set, define $\mathcal{D}(\mathcal{F})=\{F\setminus F': F, F'\in\mathcal{F}\}$. A family $\mathcal{F}$ is called intersecting if $F\cap F'\not=\emptyset$ for all $F, F'\in\mathcal{F}$. Frankl…

Let $G=(V,E)$ be a simple graph. A set $S\subseteq V$ is independent set of $G$, if no two vertices of $S$ are adjacent. The independence number $\alpha(G)$ is the size of a maximum independent set in the graph. %An independent set with…

A dominating set in a graph $G$ is a set $S$ of vertices such that every vertex that does not belong to $S$ is adjacent to a vertex in $S$. The domination number $\gamma(G)$ of $G$ is the minimum cardinality of a dominating set of $G$. The…

Given a function $f \in \omega^\omega$, a set $A \in [\omega]^\omega$ is free for $f$ if $f[A] \cap A$ is finite. For a class of functions $\Gamma \subseteq \omega^{\omega}$, we define $\mathfrak{ros}_\Gamma$ as the smallest size of a…

In a classical paper by Ben-David and Magidor, a model of set theory was exhibited in which $\aleph_{\omega+1}$ carries a uniform ultrafilter that is $\theta$-indecomposable for every uncountable cardinal $\theta<\aleph_\omega$. In this…

We survey results regarding the definability and size of maximal discrete sets in analytic hypergraphs. Our main examples include maximal almost disjoint (or mad) families, $\mathcal I$-mad families, maximal eventually different families,…

Let M be the ideal of first category subsets of R and non(M)=min{card X: X \subseteq R, X \not\in M}. We consider families \Phi of sequences converging to \infty, with the property that for every open set U \subseteq R that is unbounded…

In extremal set theory our usual goal is to find the maximal size of a family of subsets of an $n$-element set satisfying a condition. A condition is called chain-dependent, if it is satisfied for a family if and only if it is satisfied for…

We show that Dependent Choice is a sufficient choice principle for developing the basic theory of proper forcing, and for deriving generic absoluteness for the Chang model in the presence of large cardinals, even with respect to…

An independent $[1,k]$-set $S$ in a graph $G$ is a dominating set which is independent and such that every vertex not in $S$ has at most $k$ neighbors in it. The existence of such sets is not guaranteed in every graph and trees having an…

A graph $G$ is {\em well-covered} if every maximal independent set has the same cardinality $q$. Let $i_k(G)$ denote the number of independent sets of cardinality $k$ in $G$. Brown, Dilcher, and Nowakowski conjectured that the independence…

Given a family $F$ of subsets of a group $G$ we describe the structure of its thin-completion $\tau^*(F)$, which is the smallest thin-complete family that contains $I$. A family $F$ of subsets of $G$ is called thin-complete if each $F$-thin…

Let $\ee>0$ and $\fff$ be a family of finite subsets of the Cantor set $\ccc$. Following D. H. Fremlin, we say that $\fff$ is $\ee$-filling over $\ccc$ if $\fff$ is hereditary and for every $F\subseteq\ccc$ finite there exists $G\subseteq…

We study the behavior of multidegrees in families and the existence of numerical criteria to detect integral dependence. We show that mixed multiplicities of modules are upper semicontinuous functions when taking fibers and that projective…

A {\em maximal inequality} seeks to estimate $\mathbb{E}\max_i X_i$ in terms of properties of the $X_i$. When the latter are independent, the union bound (in its various guises) can yield tight upper bounds. If, however, the $X_i$ are…

Let $I$ be a square-free monomial ideal in a polynomial ring $R=K[x_1,\ldots, x_n]$ over a field $K$, $\mathfrak{m}=(x_1, \ldots, x_n)$ be the graded maximal ideal of $R$, and $\{u_1, \ldots, u_{\beta_1(I)}\}$ be a maximal independent set…