Related papers: Splitting, Bounding, and Almost Disjointness can b…
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…
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_lambda(meagre), i.e. the minimal number of nowhere dense subsets of…
It is well known that for every $f\in C^m$ there exists a polynomial $p_n$ such that $p^{(k)}_n\rightarrow f^{(k)}$, $k=0,\ldots,m$. Here we prove such a result for fractional (non-integer) derivatives. Moreover, a numerical method is…
We show three basic properties on the image Milnor number $\mu_I(f)$ of a germ $f\colon(\mathbb{C}^{n},S)\rightarrow(\mathbb{C}^{n+1},0)$ with isolated instability. First, we show the conservation of the image Milnor number, from which one…
Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…
We prove the consistency of the inequality $\mathfrak{r}_{\mathsf{nwd}}<\mathfrak{irr}$, which in turn implies the consistency of $\mathfrak{r}_\mathsf{nwd}<\mathfrak{i}$ and $\mathfrak{r}_{\mathsf{scatt}}<\mathfrak{irr}$. This answers one…
We prove that if there is a real-valued measurable cardinal then the splitting number is $\aleph_1$. Likewise, if the continuum is real-valued measurable then the reaping number equals the continuum.
We address ZFC inequalities between some cardinal invariants of the continuum, which turned to be true in spite of strong expectations given by [RoSh:470].
This is a follow up to a paper by the author where the disjointness relation for (the graphs of) definable functions from ${^\omega \omega}$ to ${^\omega \omega}$ is analyzed. In that paper, for each $a \in {^\omega \omega}$ we defined a…
A union ultrafilter is an ultrafilter over the finite subsets of $\omega$ that has a base of sets of the form $\mathrm{FU}(X)$, where $X$ is an infinite pairwise disjoint family and $\mathrm{FU}(X)=\{\bigcup…
We exploit dynamical properties of diagonal actions to derive results in Diophantine approximations. In particular, we prove that the continued fraction expansion of almost any point on the middle third Cantor set (with respect to the…
We show that some common and important global constraints like ALL-DIFFERENT and GCC can be decomposed into simple arithmetic constraints on which we achieve bound or range consistency, and in some cases even greater pruning. These…
When approximating the joint distribution of the component counts of a decomposable combinatorial structure that is `almost' in the logarithmic class, but nonetheless has irregular structure, it is useful to be able first to establish that…
If an irreducible fraction $\frac mn>0$ can be decomposed into the sum of several irreducible proper fractions with different denominators, and the positive number smaller than $\frac mn$ in fractional ideal $\frac 1n\mathbb Z$ can not be…
Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…
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…
Non-compact proofs are a class of reasoning that is used in mathematics but overlooked in the analysis of (un)provability of consistency. We focus on proofs of arithmetical statements (*) "for any natural number n, F(n)." A proof of (*) is…
We consider natural cardinal invariants hm_n and prove several duality theorems, saying roughly: if I is a suitably definable ideal and provably cov(I)>=hm_n, then non(I) is provably small. The proofs integrate the determinacy theory,…
In this paper we present a simpler proof of the fact that no inequality between $\mathrm{cof}(\mathcal{SN})$ and $\mathfrak{c}$ can be decided in ZFC by using well-known tecniques and results.
An almost disjoint family $\mathcal A$ of subsets of $\mathbb N$ is said to be $\mathbb R$-embeddable if there is a function $f:\mathbb N\rightarrow \mathbb R$ such that the sets $f[A]$ are ranges of real sequences converging to distinct…