相关论文: Strongly almost disjoint sets and weakly uniform b…

Principal components analysis (PCA) is a well-known technique for approximating a tabular data set by a low rank matrix. Here, we extend the idea of PCA to handle arbitrary data sets consisting of numerical, Boolean, categorical, ordinal,…

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

A novel selection principle was introduced by Dorantes-Aldama and Shakhmatov: a topological space $X$ is termed {\em selectively pseudocompact} if for any sequence $(U_n:n\in {\omega})$ of pairwise disjoint non-empty open sets of $X$, one…

For self-similar sets, there are two important separation properties: the open set condition and the weak separation condition introduced by Zerner, which may be replaced by the formally stronger finite type property of Ngai and Wang. We…

Quasi *-algebras possessing a sufficient family $\mathcal{M}$ of invariant positive sesquilinear forms carry several topologies related to $\mathcal{M}$ which make every *-representation continuous. This leads to define the class of locally…

We consider the problem of learning a mixture of Random Utility Models (RUMs). Despite the success of RUMs in various domains and the versatility of mixture RUMs to capture the heterogeneity in preferences, there has been only limited…

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

An approximate Spielman-Teng theorem for the least singular value $s_n(M_n)$ of a random $n\times n$ square matrix $M_n$ is a statement of the following form: there exist constants $C,c >0$ such that for all $\eta \geq 0$, $\Pr(s_n(M_n)…

In this paper we prove tight bounds on the combinatorial and topological complexity of sets defined in terms of $n$ definable sets belonging to some fixed definable family of sets in an o-minimal structure. This generalizes the…

This paper investigates the effective categoricity of ultrahomogeneous structures. It is shown that any computable ultrahomogeneous structure is $\Delta^0_2$ categorical. A structure A is said to be weakly ultrahomogeneous if there is a…

The uniform Kruskal theorem extends the original result for trees to general recursive data types. As shown by A. Freund, M. Rathjen and A. Weiermann, it is equivalent to $\Pi^1_1$-comprehension, over $\mathsf{RCA_0}$ with the chain…

Motivated by questions in theoretical distributed computing, we develop the combinatorial theory of abstract simplex path subdivisions. Our main application is a short and structural proof of the theorem of Castaneda and Rajsbaum. This…

Adaptation is to make model learn the patterns shifted from the training distribution. In general, this adaptation is formulated as the minimum entropy problem. However, the minimum entropy problem has inherent limitation -- shifted…

We consider the properties weak cancellation, K_1-surjectivity, good index theory, and K_1-injectivity for the class of extremally rich C*-algebras, and for the smaller class of isometrically rich C*-algebras. We establish all four…

The article addresses some open questions about the relations between the topological weak mixing property and the transitivity of the map $f\times f^2 \times...\times f^m$, where $f\colon X\ra X$ is a topological dynamical system on a…

Many problems in high-dimensional statistics appear to have a statistical-computational gap: a range of values of the signal-to-noise ratio where inference is information-theoretically possible, but (conjecturally) computationally…

In this note we show that for analytic semigroups the so-called Weiss condition of uniform boundedness of the operators $Re(\lambda)^\einhalb C(\lambda+A)^{-1}, \qquad Re(\lambda)>0$ on the complex right half plane and weak Lebesgue…

We work in set-theory without choice ZF. Denoting by AC(N) the countable axiom of choice, we show in ZF+AC(N) that the closed unit ball of a uniformly convex Banach space is compact in the convex topology (an alternative to the weak…

The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…

Almost surely in an Angelesco ensemble,the normalized counting measure of a random point converges weak* to the equilibrium measure.This result, for orthogonal polynomial ensembles, is well-known.