Related papers: The linear refinement number and selection theory
A family $\mathscr{I} \subseteq [\omega]^\omega$ such that for all finite $\{X_i\}_{i\in n}\subseteq \mathcal I$ and $A \in \mathscr{I} \setminus \{X_i\}_{i\in n}$, the set $A \setminus \bigcup_{i < n} X_i$ is infinite, is said to be ideal…
$\DeclareMathOperator{\chicen}{\chi_{\mathrm{cen}}}\DeclareMathOperator{\chilin}{\chi_{\mathrm{lin}}}$ A centred colouring of a graph is a vertex colouring in which every connected subgraph contains a vertex whose colour is unique and a…
By affine arithmetic is meant the set of affine consequences of Peano arithmetic. This is a continuous theory which is studied in the framework of affine logic, a sublogic of continuous logic. Affine arithmetic is undecidable. Also, its…
We show how to construct, via forcing, splitting families than are preserved by a certain type of finite support iterations. As an application, we construct a model where 15 classical characteristics of the continuum are pairwise different,…
We isolate a new large cardinal concept, "remarkability." Consistencywise, remarkable cardinals are between ineffable and omega-Erdos cardinals. They are characterized by the existence of "0^sharp-like" embeddings; however, they relativize…
We study the generalized dominating number $\mathfrak{d}_{\mu}$ at a singular cardinal $\mu$ of cofinality $\kappa$. We show two lower bounds: in ZFC, $\mathrm{cf}([\mu]^\kappa,\subseteq) \leq \mathfrak{d}_{\mu}$, and under mild…
Unsupervised cell type identification is crucial for uncovering and characterizing heterogeneous populations in single cell omics studies. Although a range of clustering methods have been developed, most focus exclusively on intrinsic…
The \emph{segment number} of a planar graph is the smallest number of line segments whose union represents a crossing-free straight-line drawing of the given graph in the plane. The segment number is a measure for the visual complexity of a…
Using the subdivision schemes theory, we develop a criterion to check if any natural number has at most one representation in the $n$-ary number system with a set of non-negative integer digits $A=\{a_1, a_2,\ldots, a_n\}$ that contains…
We explore the issue of providing a foundational framework for Leibnizian infinitesimals in the light of modern standard and nonstandard approaches. We outline a trichotomy of ordinals, cardinals and ringinals as a historiographic tool. A…
Motivated by classical problems in extremal graph theory, we study a chromatic analogue of Roth-type questions for linear equations over $\mathbb F_p$. Given a homogeneous equation $\mathcal L:\sum_{i=1}^k c_i x_i=0$ with $k\ge 3$, we study…
In this paper I will show that it is relatively consistent with the usual axioms of mathematics (ZFC) together with a strong form of the axiom of infinity (the existence of a supercompact cardinal) that the class of uncountable linear…
Under some cardinal arithmetic assumptions, we prove that every stationary subset of lambda of a right cofinality has the weak diamond. This is a strong negation of uniformization. We then deal with a weaker version of the weak diamond-…
Data processing inequalities for $f$-divergences can be sharpened using constants called "contraction coefficients" to produce strong data processing inequalities. For any discrete source-channel pair, the contraction coefficients for…
In this paper, we give a finite number of defining relations satisfied by a finite number of generators for the elliptic Lie algebras and superalgebras ${\frak g}_R$ with rank $\geq 2$. Here the $R$'s denote the reduced and non-reduced…
Linear regression models are checked by a lack-of-fit (LOF) test to be sure that the model is at least approximatively true. In many practical cases data are sampled sequentially. Such a situation appears in industrial production when goods…
Boolean cardinality constraints state that at most (at least, or exactly) $k$ out of $n$ propositional literals can be true. We propose a new class of selection networks that can be used for an efficient encoding of them. Several comparator…
A classical problem in the literature seeks the minimal number of proper subgroups whose union is a given finite group. A different question, with applications to error-correcting codes and graph colorings, involves covering vector spaces…
We prove the global triangulation conjecture for families of refined p-adic representations under a mild condition. That is, for a refined family, the associated family of (phi, Gamma)-modules admits a global triangulation on a Zariski open…
We propose thresholding as an approach to deal with class imbalance. We define the concept of thresholding as a process of determining a decision boundary in the presence of a tunable parameter. The threshold is the maximum value of this…