Related papers: The linear refinement number and selection theory
We investigate several relations between cardinal characteristics of the continuum related with the asymptotic density of the natural numbers and some known cardinal invariants. Specifically, we study the cardinals of the form…
How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We define the \emph{rearrangement number}, a new cardinal…
In [CMRM24], it was proved that it is relatively consistent that \emph{bounding number} $\mathfrak{b}$ is smaller than the uniformity of $\mathcal{MA}$, where $\mathcal{MA}$ denotes the ideal of the meager-additive sets of $2^{\omega}$. To…
How many permutations are needed so that every infinite-coinfinite set of natural numbers with asymptotic density can be rearranged to no longer have the same density? We prove that the density number $\mathfrak{dd}$, which answers this…
We introduce and analyze a new cardinal characteristic of the continuum, the \emph{splitting number of the reals}, denoted $\mathfrak{s}(\mathbb R)$. This number is connected to Efimov's problem, which asks whether every infinite compact…
The \emph{matching preclusion number} of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. As a generalization, Liu and Liu recently introduced the…
Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…
For cardinals $\mathfrak{a}$ and $\mathfrak{b}$, we write $\mathfrak{a}=^\ast\mathfrak{b}$ if there are sets $A$ and $B$ of cardinalities $\mathfrak{a}$ and $\mathfrak{b}$, respectively, such that there are partial surjections from $A$ onto…
In this paper, we exploit the relation between the regularity of refinable functions with non-integer dilations and the distribution of powers of a fixed number modulo 1, and show the nonexistence of a non-trivial {\bf C}^{\infty} solution…
The Colour Refinement algorithm is a classical procedure to detect symmetries in graphs, whose most prominent application is in graph-isomorphism tests. The algorithm and its generalisation, the Weisfeiler-Leman algorithm, evaluate local…
Generalizing the notion of a tight almost disjoint family, we introduce the notions of a {\em tight eventually different} family of functions in Baire space and a {\em tight eventually different set of permutations} of $\omega$. Such sets…
Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into "colour classes" in such a way that all…
In this note we collect some known information and prove new results about the small uncountable cardinal $\mathfrak q_0$. The cardinal $\mathfrak q_0$ is defined as the smallest cardinality $|A|$ of a subset $A\subset \mathbb R$ which is…
We study the universal closest refinement problem on measurable bipartite relations over standard Borel spaces. Given prescribed side measures, the feasible class consists of finite refinement plans concentrated on the relation and carrying…
Define the special tree number, denoted $\mathfrak{st}$, to be the least size of a tree of height $\omega_1$ which is neither special nor has a cofinal branch. This cardinal had previously been studied in the context of fragments of…
We compute the minimal cardinality of a covering (resp. an irredundant covering) of a vector space over an arbitrary field by proper linear subspaces. Analogues for affine linear subspaces are also given.
We prove that if ZF is consistent then ZFC+GCH is consistent with the following statement: There is for every k<omega a model of cardinality aleph_1 which is L_{infty,omega_1}-equivalent to exactly k non-isomorphic models of cardinality…
The regularity of refinable functions has been studied extensively in the past. A classical result by Daubechies and Lagarias states that a compactly supported refinable function in $\R$ of finite mask with integer dilation and translations…
A topological space X$ has the Frechet-Urysohn property if for each subset A of X and each element x in the closure of A, there exists a countable sequence of elements of A which converges to x. Reznichenko introduced a natural…
Cardinal characteristics of the continuum represent the boundaries in size between the countable and the continuum with respect to certain properties of sets. They are often defined as the minimum sizes of families of reals that meet some…