English
Related papers

Related papers: Filters and Ideal Independence

200 papers

Let $n$ be any positive integer and $\mathcal{F}$ be a family of subsets of $[n]$. A family $\mathcal{F}'$ is said to be $D$-\emph{secting} for $\mathcal{F}$ if for every $A \in \mathcal{F}$, there exists a subset $A' \in \mathcal{F}'$ such…

Combinatorics · Mathematics 2019-02-21 Niranjan Balachandran , Rogers Mathew , Tapas Kumar Mishra , Sudebkumar Prasant Pal

An old problem of Moser asks: how large of a union-free subfamily does every family of m sets have? A family of sets is called union-free if there are no three distinct sets in the family such that the union of two of the sets is equal to…

Combinatorics · Mathematics 2011-03-17 Jacob Fox , Choongbum Lee , Benny Sudakov

Structural independence is the (conditional) independence that arises from the structure rather than the precise numerical values of a distribution. We develop this concept and relate it to $d$-separation and structural causal models.…

Probability · Mathematics 2025-06-24 Matthias Georg Mayer

We further develop a forcing notion known as Coding with Perfect Trees and show that this poset preserves, in a strong sense, definable $P$-points, definable tight MAD families and definable selective independent families. As a result, we…

Logic · Mathematics 2022-02-25 Jeffrey Bergfalk , Vera Fischer , Corey Bacal Switzer

Frankl's conjecture, also known as the union-closed sets conjecture, can be equivalently expressed in terms of intersection-closed set families by considering the complements of sets. It posits that any family of sets closed under…

Combinatorics · Mathematics 2025-04-21 Masahiro Hachimori , Kenji Kashiwabara

A clutter is \emph{$k$-wise intersecting} if every $k$ members have a common element, yet no element belongs to all members. We conjecture that, for some integer $k\geq 4$, every $k$-wise intersecting clutter is non-ideal. As evidence for…

Combinatorics · Mathematics 2020-10-06 Ahmad Abdi , Gérard Cornuéjols , Tony Huynh , Dabeen Lee

Let K be a set of infinite cardinals such that the cardinality of K is the first strong limit cardinal greater than uncountably many strong limit cardinals. We construct a family of pairwise non-embeddable groups which contains 2^k groups…

Group Theory · Mathematics 2026-01-08 Gerald Kuba

Let ${\mathfrak F}$ be a category of subanalytic subsets of real analytic manifolds that is closed under basic set-theoretical and basic topological operations. Let $M$ be a real analytic manifold and denote ${\mathfrak F}(M)$ the family of…

Algebraic Geometry · Mathematics 2018-03-19 José F. Fernando

Let $G$ be an abelian group, and $F$ a downward directed family of subsets of $G$. The finest topology $\mathcal{T}$ on $G$ under which $F$ converges to $0$ has been described by I.Protasov and E.Zelenyuk. In particular, their description…

Group Theory · Mathematics 2013-11-13 George M. Bergman

Let $S$ be a semigroup, let $n\in\mathbb{N}$ be a positive natural number, let $A,B\subseteq S$, let $\mathcal{U},\mathcal{V}\in\beta S$ and let let $\mathcal{F}\subseteq\{f:S^{n}\rightarrow S\}$. We say that $A$ is $\mathcal{F}$-finitely…

Combinatorics · Mathematics 2015-04-01 Lorenzo Luperi Baglini

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

Logic · Mathematics 2018-10-26 John Krueger

A classic theorem in combinatorial design theory is Fisher's inequality, which states that a family $\mathcal F$ of subsets of $[n]$ with all pairwise intersections of size $\lambda$ can have at most $n$ non-empty sets. One may weaken the…

Combinatorics · Mathematics 2015-11-04 Shagnik Das , Benny Sudakov , Pedro Vieira

We consider families of $k$-subsets of $\{1, \dots, n\}$, where $n$ is a multiple of $k$, which have no perfect matching. An equivalent condition for a family $\mathcal{F}$ to have no perfect matching is for there to be a blocking set,…

Combinatorics · Mathematics 2020-08-24 Mihir Singhal

We study maximal independent families (m.i.f.) in the projective hierarchy. We show that (a) the existence of a $\boldsymbol{\Sigma}^1_2$ m.i.f. is equivalent to the existence of a $\boldsymbol{\Pi}^1_1$ m.i.f., (b) in the Cohen model,…

Logic · Mathematics 2019-05-14 Jörg Brendle , Vera Fischer , Yurii Khomskii

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

Logic · Mathematics 2018-02-15 Gunter Fuchs

We give the first (ZFC) dividing line in Keisler's order among the unstable theories, specifically among the simple unstable theories. That is, for any infinite cardinal $\lambda$ for which there is $\mu < \lambda \leq 2^\mu$, we construct…

Logic · Mathematics 2012-08-13 M. Malliaris , S. Shelah

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other…

Logic · Mathematics 2023-12-18 Vera Fischer , Lukas Schembecker

Motivated by recent results and questions of D. Raghavan and S. Shelah, we present ZFC theorems on the bounding and various almost disjointness numbers, as well as on reaping and dominating families on uncountable, regular cardinals. We…

Logic · Mathematics 2018-03-09 Vera Fischer , Daniel T. Soukup

Our original aim was, in Abelian group theory to prove the consistency of: lambda is strong limit singular and for some properties of abelian groups which are relatives of being free, the compactness in singular fails. In fact this should…

Logic · Mathematics 2013-06-25 Saharon Shelah

Let ${\mathfrak C}$ be a monster model of an arbitrary theory $T$, $\bar \alpha$ any tuple of bounded length of elements of ${\mathfrak C}$, and $\bar c$ an enumeration of all elements of ${\mathfrak C}$. By $S_{\bar \alpha}({\mathfrak C})$…

Logic · Mathematics 2019-05-07 Krzysztof Krupinski , Ludomir Newelski , Pierre Simon