English
Related papers

Related papers: How you are with $\mathfrak{s}$ and $\mathfrak{r}$…

200 papers

A (continuous) necklace is simply an interval of the real line colored measurably with some number of colors. A well-known application of the Borsuk-Ulam theorem asserts that every $k$-colored necklace can be fairly split by at most $k$…

Combinatorics · Mathematics 2014-12-30 Noga Alon , Jarosław Grytczuk , Michał Lasoń , Mateusz Michałek

We give a detailed proof of the properties of the usual Prikry type forcing notion for turning a measurable cardinal into $\aleph_\omega$.

Logic · Mathematics 2019-02-20 Mohammad Golshani

A topological space $Y$ is said to have (AEEP) if the following condition is fulfilled. Whenever $(X,\mathfrak{M})$ is a measurable space and $f, g: X \to Y$ are two measurable functions, then the set $\Delta(f,g) = \{x \in X:\ f(x) =…

General Topology · Mathematics 2014-11-03 Piotr Niemiec

The cardinal invariants $ \mathfrak h, \mathfrak b, \mathfrak s$ of $\mathcal P (\omega)$ are known to satisfy that $\omega_1 \leq \mathfrak h \leq\min\{\mathfrak b, \mathfrak s\}$. We prove that all inequalities can be strict. We also…

Logic · Mathematics 2022-02-02 Alan Dow , Saharon Shelah

Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…

General Topology · Mathematics 2007-05-23 Joan E. Hart , Kenneth Kunen

We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…

Combinatorics · Mathematics 2025-03-28 Ming Yean Lim

This paper develops a technical and practical reinterpretation of the real interval [a,b] under the paradigm of fractal countability. Instead of assuming the continuum as a completed uncountable totality, we model [a,b] as a layered…

Logic in Computer Science · Computer Science 2025-05-21 Stanislav Semenov

We introduce the split principles and show that they bear tight connections to large cardinal properties such as inaccessibility, weak compactness, subtlety, almost ineffability and ineffability, as well as classical combinatorial objects…

Logic · Mathematics 2024-11-26 Gunter Fuchs , Kaethe Minden

A partition is finitary if all its blocks are finite. For a cardinal $\mathfrak{a}$ and a natural number $n$, let $\mathrm{fin}(\mathfrak{a})$ and $\mathscr{B}_{n}(\mathfrak{a})$ be the cardinalities of the set of finite subsets and the set…

Logic · Mathematics 2024-11-12 Yifan Hu , Guozhen Shen

We prove that the strong polarized relation for the continuum holds for $\aleph_0$ and for every supercompact cardinal. We use iteration of Mathias forcing.

Logic · Mathematics 2012-06-13 Shimon Garti , Saharon Shelah

We show that the existence of a universal countably chromatic graph of size $\aleph_1$ together with the failure of continuum hypothesis is consistent. The proof is a forcing iteration of strongly proper ccc posets. The construction works…

Logic · Mathematics 2025-11-12 Siiri Kivimäki

Let $\R^\R$ denote the set of real valued functions defined on the real line. A map $D: \R^\R \to \R^\R$ is a {\it difference operator}, if there are real numbers $a_i, b_i \ (i=1,..., n)$ such that $(Df)(x)=\sum_{i=1}^n a_i f(x+b_i)$ for…

Classical Analysis and ODEs · Mathematics 2011-09-23 Márton Elekes , Miklós Laczkovich

For a commutative ring $R$, a polynomial $f\in R[x]$ is called separable if $R[x]/f$ is a separable $R$-algebra. We derive formulae for the number of separable polynomials when $R = \mathbb{Z}/n$, extending a result of L. Carlitz. For…

Rings and Algebras · Mathematics 2017-03-22 Jason K. C. Polak

We investigate game-theoretic variants of cardinal invariants of the continuum. The invariants we treat are the reaping number $\mathfrak{r}$, the bounding number $\mathfrak{b}$, the dominating number $\mathfrak{d}$, and the additivity…

Logic · Mathematics 2024-12-03 Jorge Antonio Cruz Chapital , Tatsuya Goto , Yusuke Hayashi

Let chi be the minimum cardinal of a subset of 2^omega that cannot be made convergent by multiplication with a single Toeplitz matrix. By an application of creature forcing we show that s<chi is consistent. We thus answer a question by…

Logic · Mathematics 2007-05-23 Heike Mildenberger , Saharon Shelah

We generalize the class of split graphs to the directed case and show that these split digraphs can be identified from their degree sequences. The first degree sequence characterization is an extension of the concept of splittance to…

Discrete Mathematics · Computer Science 2014-04-25 M. Drew LaMar

A permutation class $C$ is splittable if it is contained in a merge of two of its proper subclasses, and it is 1-amalgamable if given two permutations $\sigma$ and $\tau$ in $C$, each with a marked element, we can find a permutation $\pi$…

Combinatorics · Mathematics 2023-06-22 Vít Jelínek , Michal Opler

We define a weak iterability notion that is sufficient for a number of arguments concerning $\Sigma_1$-definability at uncountable regular cardinals. In particular we give its exact consistency strength firstly in terms of the second…

Logic · Mathematics 2019-01-18 P. D. Welch

It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…

General Topology · Mathematics 2015-12-29 V. V. Mykhaylyuk

Our goal is to study the pseudo-intersection and tower numbers on uncountable regular cardinals, whether these two cardinal characteristics are necessarily equal, and related problems on the existence of gaps. First, we prove that either…