Related papers: Strongly almost disjoint sets and weakly uniform b…

A nonempty closed convex bounded subset $C$ of a Banach space is said to have the weak approximate fixed point property if for every continuous map $f:C\to C$ there is a sequence $\{x_n\}$ in $C$ such that $x_n-f(x_n)$ converge weakly to 0.…

A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…

A longstanding question is to characterize the lattice of supersets (modulo finite sets), $\mathcal{L}^*(A)$, of a low$_2$ computably enumerable (c.e.) set. The conjecture is that $\mathcal{L}^*(A)\cong {\mathcal E}^*$. In spite of claims…

Let $A$ and $C$ be two unital simple C*-algebas with tracial rank zero. Suppose that $C$ is amenable and satisfies the Universal Coefficient Theorem. Denote by ${{KK}}_e(C,A)^{++}$ the set of those $\kappa$ for which…

We define the class of weakly approximately divisible unital C*-algebras and show that this class is closed under direct sums, direct limits, any tensor product with any C*-algebra, and quotients. A nuclear C*-algebra is weakly…

Hart and Kunen, and independently in the recent preprint arXiv:2304.13113, R\'ios-Herrej\'on defined and studied the class $C({\omega}_1)$ of topological spaces $X$ having the property that for every neighborhood assignment $\{U(y) : y \in…

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…

Let $(r_{n})_{n \in \mathbb{N}}$ be the sequence of subdiagonal Pad\'{e} approximations of the exponential function. We prove that for $-A$ the generator of a uniformly bounded $C_{0}$-semigroup $T$ on a Banach space $X$, the sequence…

We prove the following results: (i) Every absolutely weakly compact set in a Banach lattice is absolutely weakly sequentially compact. (ii) The converse of (i) holds if $E$ is separable or $B_{E^{**}}$ is absolutely weak$^*$ compact. (iii)…

Commonly used in computer vision and other applications, robust PCA represents an algorithmic attempt to reduce the sensitivity of classical PCA to outliers. The basic idea is to learn a decomposition of some data matrix of interest into…

We generalize Kirchberg's weak exactness to inclusions of C*-algebras in von Neumann algebras and study some characterizations and permanence properties which are similar to those of exact groups. We then consider a similar condition to…

We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…

Principal Component Analysis (PCA) is a highly useful topic within an introductory Linear Algebra course, especially since it can be used to incorporate a number of applied projects. This method represents an essential application and…

Let $A$ be a separable amenable $C^*$-algebra and $B$ a non-unital and $\sigma$-unital simple $C^*$-algebra with continuous scale ($B$ need not be stable). We classify, up to unitary equivalence, all essential extensions of the form $0…

We study the complexity of proof systems augmenting resolution with inference rules that allow, given a formula $\Gamma$ in conjunctive normal form, deriving clauses that are not necessarily logically implied by $\Gamma$ but whose addition…

Principal component analysis (PCA) is widely used for dimensionality reduction, with well-documented merits in various applications involving high-dimensional data, including computer vision, preference measurement, and bioinformatics. In…

To study finite-dimensional modules of the Lie superalgebras, Kac introduced the Kac-modules and divided them into typical or atypical modules according as they are simple or not. For Lambda being atypical, Hughes et al have an algorithm to…

Principal Component Analysis (PCA) is a powerful tool in statistics and machine learning. While existing study of PCA focuses on the recovery of principal components and their associated eigenvalues, there are few precise characterizations…

We prove a version of a small index property theorem for strong amalgamation classes. Our result builds on an earlier theorem by Lascar and Shelah (in their case, for saturated models of uncountable first-order theories). We then study…