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

For different classes of measure preserving transformations, we investigate collections of sets that exhibit the property of lightly mixing. Lightly mixing is a stronger property than topological mixing, and requires that a lim inf is…

The simplest condition characterizing quasi-finite CW complexes $K$ is the implication $X\tau_h K\implies \beta(X)\tau K$ for all paracompact spaces $X$. Here are the main results of the paper: Theorem: If $\{K_s\}_{s\in S}$ is a family of…

We consider a family of vector dot products that can be implemented using sign changes and addition operations only. The dot products are energy-efficient as they avoid the multiplication operation entirely. Moreover, the dot products…

Congruence families, i.e., $\ell$-adic convergence for well-defined arithmetic subsequences, is a commonplace phenomenon for the coefficients of modular forms. Such families superficially resemble one another, but they often vary…

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

We give elementary proofs of the theorems mentioned in the title. Our methods rely on a simple version of Ramsey theory and a martingale difference lemma. They also provide quantitative results: if a Banach space contains $\ell^{1}$ only…

We show that over the weak base theory $\mathrm{RCA}_0^*$, cohesive Ramsey's theorem for pairs $\mathrm{CRT}^2_2$ implies exponential closure of the definable cut $\mathrm{I}^0_1$, which is the intersection of all $\Sigma^0_1$-definable…

In this note we look at the interdependences between James' theorem and the boundary problem. To do so we show a variant of James' sup-theorem for C(K)-spaces conjectured by Godefroy: in order to know that a bounded weakly closed subset of…

Principal component analysis (PCA) is often used to reduce the dimension of data by selecting a few orthonormal vectors that explain most of the variance structure of the data. L1 PCA uses the L1 norm to measure error, whereas the…

PCA is a classical statistical technique whose simplicity and maturity has seen it find widespread use as an anomaly detection technique. However, it is limited in this regard by being sensitive to gross perturbations of the input, and by…

We use Arveson's notion of strongly peaking representation to generalize uniqueness theorems for free spectrahedra and matrix convex sets which admit minimal presentations. A fully compressed separable operator system necessarily generates…

We study when a union of saturated models is saturated in the framework of tame abstract elementary classes (AECs) with amalgamation. We prove: $\mathbf{Theorem}$ If $K$ is a tame AEC with amalgamation satisfying a natural definition of…

A new viewpoint for the gauge hierarchy problem is proposed: compactification at a large scale, 1/R, leads to a low energy effective theory with supersymmetry softly broken at a much lower scale, \alpha/R. The hierarchy is induced by an…

We give a very simple and elementary proof of the existence of a weakly compact family of probability measures $\{P_{\theta}:\theta \in \Theta \}$ to represent an important sublinear expectation--G-expectation $\mathbb{E}[\cdot]$. We also…

M. Talagrand showed that, for the Cech-Stone compactification \beta\omega\ of the space of natural numbers, the norm and the weak topology generate different Borel structures in the Banach space C(\beta\omega). We prove that the Borel…

The proofs of K. Oka's Coherence Theorems are based on Weierstrass' Preparation (division) Theorem. Here we formulate and prove a Weak Coherence Theorem without using Weierstrass' Preparation Theorem, but only with power series expansions:…

We present a new technique called contrastive principal component analysis (cPCA) that is designed to discover low-dimensional structure that is unique to a dataset, or enriched in one dataset relative to other data. The technique is a…

There is a long history of studying Ramsey theory using the algebraic structure of the Stone-\v{C}ech compactification of discrete semigroup. It has been shown that various Ramsey theoretic structures are contained in different algebraic…

Two novel descriptions of weak {\omega}-categories have been recently proposed, using type-theoretic ideas. The first one is the dependent type theory CaTT whose models are {\omega}-categories. The second is a recursive description of a…

The Strong Exponential Time Hypothesis (SETH) asserts that for every $\varepsilon>0$ there exists $k$ such that $k$-SAT requires time $(2-\varepsilon)^n$. The field of fine-grained complexity has leveraged SETH to prove quite tight…