English
Related papers

Related papers: Selective independence

200 papers

We show that the Schreier sets $\mathcal{S}_{\alpha}\ (\alpha<\omega_1)$ satisfy the following dichotomy property. For every hereditary collection $\cf$ of finite subsets of $\N$, either there exists infinite $M=(m_i)_1^{\infty}\subseteq\N$…

Functional Analysis · Mathematics 2016-09-07 Robert Judd

We prove the consistency of: for suitable strongly inaccessible cardinal lambda the dominating number, i.e. the cofinality of lambda^lambda is strictly bigger than cov(meagre_lambda), i.e. the minimal number of nowhere dense subsets of…

Logic · Mathematics 2022-09-07 Saharon Shelah

In this paper we continue the study in [Gilton-Levine-Stejskalova] of compactness and incompactness principles at double successors, focusing here on the case of double successors of singulars of countable cofinality. We obtain models which…

Logic · Mathematics 2024-08-13 Thomas Gilton , Šárka Stejskalová

We explore different generalizations of the classical concept of independent families on $\omega$ following the study initiated by Fisher and Montoya. We show that under $\diamondsuit^*(\kappa)$ we can get strongly independent families on…

Logic · Mathematics 2023-02-20 Fernando Hernández-Hernández , Carlos López-Callejas

Starting from an abstract elementary class with no maximal models, Shelah and Villaveces have shown (assuming instances of diamond) that categoricity implies a superstability-like property for a certain independence relation called…

Logic · Mathematics 2017-04-26 Will Boney , Rami Grossberg , Monica M. VanDieren , Sebastien Vasey

A set theory is developed based on the approximations of sets and denoted by AS. In AS the set of all sets exists but the argument for Russell's and Cantor's paradox fail. The Axioms of Separation, Replacement and Foundation are not valid.…

General Mathematics · Mathematics 2009-04-15 Slavko Rede

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…

Combinatorics · Mathematics 2014-12-16 Jonathan Cutler , Luke Pebody

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

This paper deals with variety of problems in pcf theory and infinitary combinatorics. We look at normal filters and prc, measures of the size of [lambda]^{<kappa}, pcf-inaccessibility, entangled orders (and narrow Boolean Algebras),…

Logic · Mathematics 2007-05-23 Saharon Shelah

We show that the consistency of $\mathrm{ZF} + \mathrm{AD}_{\mathbb{R}} + ``\Theta$ is measurable$"$ implies the consistency of $\mathrm{ZF} +``\Theta$ is the least strongly regular cardinal and the least measurable cardinal$"$ + $``$all…

Logic · Mathematics 2026-03-11 Rahman Mohammadpour , Otto Rajala , Sebastiano Thei

We give a construction of a convex set $A \subset \mathbb R$ with cardinality $n$ such that $A-A$ contains a convex subset with cardinality $\Omega (n^2)$. We also consider the following variant of this problem: given a convex set $A$, what…

Combinatorics · Mathematics 2023-09-15 Krishnendu Bhowmick , Ben Lund , Oliver Roche-Newton

We consider a dichotomy for analytic families of trees stating that either there is a colouring of the nodes for which all but finitely many levels of every tree are nonhomogeneous, or else the family contains an uncountable antichain. This…

Logic · Mathematics 2008-08-12 James Hirschorn

Let $A_1$ and $A_2$ be randomly chosen subsets of the first $n$ integers of cardinalities $s_2\geq s_1 = \Omega(s_2)$, such that their sumset $A_1+A_2$ has size $m$. We show that asymptotically almost surely $A_1$ and $A_2$ are almost fully…

Combinatorics · Mathematics 2023-01-31 Marcelo Campos , Matthew Coulson , Oriol Serra , Maximilian Wötzel

I introduced the notions of proper and piecewise proper families of reals to make progress on an open question in the field of models of PA about whether every Scott set is the standard system of a model of PA. A family of reals X is proper…

Logic · Mathematics 2008-01-29 Victoria Gitman

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…

Logic · Mathematics 2024-04-11 Arturo Martínez-Celis , Tomasz Żuchowski

It is shown that $A:=H_{1,\eta}(G)$, the Sympectic Reflection Algebra, has $T_G$ independent traces, where $T_G$ is the number of conjugacy classes of elements without eigenvalue 1 belonging to the finite group $G$ generated by the system…

Representation Theory · Mathematics 2019-12-12 S. E. Konstein , I. V. Tyutin

The Frankl conjecture, also known as the union-closed sets conjecture, states that in any finite non-empty union-closed family, there exists an element in at least half of the sets. From an optimization point of view, one could instead…

Combinatorics · Mathematics 2016-08-03 Jonad Pulaj , Annie Raymond , Dirk Theis

We prove that successors of singular limits of strongly compact cardinals have the strong tree property. We also prove that aleph_{omega+1} can consistently satisfy the strong tree property.

Logic · Mathematics 2013-01-28 Laura Fontanella

We say that a set $A$ \emph{$t$-intersects} a set $B$ if $A$ and $B$ have at least $t$ common elements. A family $\mathcal{A}$ of sets is said to be \emph{$t$-intersecting} if each set in $\mathcal{A}$ $t$-intersects any other set in…

Combinatorics · Mathematics 2013-01-01 Peter Borg

If alpha=alpha(G) is the maximum size of an independent set and s_{k} equals the number of stable sets of cardinality k in graph G, then I(G;x)=s_{0}+s_{1}x+...+s_{alpha}x^{alpha} is the independence polynomial of G. In this paper we…

Combinatorics · Mathematics 2011-01-25 Vadim E. Levit , Eugen Mandrescu