English
Related papers

Related papers: On CON(Dominating_lambda > cov_\lambda(meagre))

200 papers

We propose the conjecture that the domination number $\gamma(G)$ of a $\Delta$-regular graph $G$ with $\Delta\geq 1$ is always at most its edge domination number $\gamma_e(G)$, which coincides with the domination number of its line graph.…

Combinatorics · Mathematics 2019-07-09 Julien Baste , Maximilian Fürst , Michael A. Henning , Elena Mohr , Dieter Rautenbach

We prove a revised version of Laver's indestructibility theorem which slightly improves over the classical result. An application yields the consistency of $(\kappa^+,\kappa)\notcc(\aleph\_1,\aleph\_0)$ when $\kappa$ is supercompact. The…

Logic · Mathematics 2007-05-23 Bernhard Koenig

We prove the consistency of $\mathfrak{r}_\lambda<\mathfrak{d}_\lambda$ and even $\mathfrak{u}_\lambda<\mathfrak{d}_\lambda$ for a singular cardinal $\lambda$.

Logic · Mathematics 2020-06-09 Shimon Garti , Saharon Shelah

For $\lambda \in (1/2, 1)$ and $\alpha$, we consider sets of numbers $x$ such that for infinitely many $n$, $x$ is $2^{-\alpha n}$-close to some $\sum_{i=1}^n \omega_i \lambda^i$, where $\omega_i \in \{0,1\}$. These sets are in Falconer's…

Number Theory · Mathematics 2014-01-14 Tomas Persson , Henry W. J. Reeve

We introduce a new compactness principle which we call the gluing property. For a measurable cardinal $\kappa$ and a cardinal $\lambda$, we say that $\kappa$ has the $\lambda$-gluing property if every sequence of $\lambda$-many…

Logic · Mathematics 2026-03-27 Yair Hayut , Alejandro Poveda

We give another proof that for every lambda >= beth_omega for every large enough regular kappa < beth_omega we have lambda^{[kappa]}= lambda, dealing with sufficient conditions for replacing beth_omega by aleph_omega. In section 2 we show…

Logic · Mathematics 2009-09-25 Saharon Shelah

The authors show, by means of a finitary version square^{fin}_{lambda,D} of the combinatorial principle square^{b^*}_{lambda}, the consistency of the failure, relative to the consistency of supercompact cardinals, of the following: for all…

Logic · Mathematics 2007-05-23 Juliette Kennedy , Saharon Shelah

We prove that assuming suitable cardinal arithmetic, if B is a Boolean algebra every homomorphic image of which is isomorphic to a factor, then B has locally small density. We also prove that for an (infinite) Boolean algebra B, the number…

Logic · Mathematics 2008-02-03 Saharon Shelah

We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…

Logic · Mathematics 2007-05-23 Arthur W. Apter

An inaccessible cardinal kappa is supercompact when (kappa, lambda)-ITP holds for all lambda greater than or equal to kappa. We prove that if there is a model of ZFC with infinitely many supercompact cardinals, then there is a model of ZFC…

Logic · Mathematics 2012-05-21 Laura Fontanella

Given any $\lambda\leq\kappa$, we construct a symmetric extension in which there is a set $X$ such that $\aleph(X)=\lambda$ and $\aleph^*(X)=\kappa$. Consequently, we show that $\mathsf{ZF}+$"For all pairs of infinite cardinals…

Logic · Mathematics 2024-08-16 Asaf Karagila , Calliope Ryan-Smith

A $\textit{covering system}$ is a collection of integer congruences such that every integer satisfies at least one congruence in the collection. A covering system is called $\textit{distinct}$ if all of its moduli are distinct. An expansive…

Number Theory · Mathematics 2023-08-24 Raj Agrawal , Prarthana Bhatia , Kratik Gupta , Powers Lamb , Andrew Lott , Alex Rice , Christine Rose Ward

We introduce new formulations of aperiodicity and cofinality for finitely aligned higher-rank graphs \Lambda, and prove that C*(\Lambda) is simple if and only if \Lambda is aperiodic and cofinal. The main advantage of our versions of…

Operator Algebras · Mathematics 2015-05-13 Peter Lewin , Aidan Sims

We prove that for any $C^1$-stably weakly shadowing transitive set $\Lambda$, either $\Lambda$ is a sink or a source, or $\Lambda$ admits a dominated splitting.

Dynamical Systems · Mathematics 2010-03-11 Dawei Yang

Suppose $\kappa$ is a regular cardinal and $\bar a=\langle \mu_i: i<\kappa \rangle$ is a non-decreasing sequence of regular cardinals. We study the set of possible cofinalities of cuts Pcut$(\bar a)=\{(\lambda_1, \lambda_2):$ for some…

Logic · Mathematics 2025-01-20 Mohammad Golshani

We briefly review known results on upper bounds for the minimal domination number $\gamma_n$ of a hypercube of dimension $n$, then present a new method for constructing dominating sets. Write $n =2^{\hat{n}}-1 +{\check{n}}$ with $0\leq…

Combinatorics · Mathematics 2024-09-24 Zachary DeVivo , Robert K. Hladky

We continue here [She88] but we do not rely on it. The motivation was a conjecture of Galvin stating that 2^{omega} >= omega_2 + omega_2-> [omega_1]^{n}_{h(n)} is consistent for a suitable h: omega-> omega. In section 5 we disprove this and…

Logic · Mathematics 2024-01-30 Saharon Shelah

A 1984 problem of S.Z. Ditor asks whether there exists a lattice of cardinality aleph two, with zero, in which every principal ideal is finite and every element has at most three lower covers. We prove that the existence of such a lattice…

General Mathematics · Mathematics 2010-05-18 Friedrich Wehrung

This paper contributes to the theory of large cardinals beyond the Kunen inconsistency, or choiceless large cardinal axioms, in the context where the Axiom of Choice is not assumed. The first part of the paper investigates a periodicity…

Logic · Mathematics 2021-02-19 Gabriel Goldberg

Working under large cardinal assumptions, we study the Borel-reducibility between equivalence relations modulo restrictions of the non-stationary ideal on some fixed cardinal $\kappa$. We show the consistency of…

Logic · Mathematics 2017-08-10 David Asperó , Tapani Hyttinen , Vadim Kulikov , Miguel Moreno