相关论文: On needed reals

We present an algorithm for solving binary classification problems when the dataset is not fully representative of the problem being solved, and obtaining more data is not possible. It relies on a trained model with loose accuracy…

A (vector space) basis B of a Lie algebra is said to be very nilpotent if all the iterated brackets of elements of B are nilpotent. In this note, we prove a refinement of Engel's Theorem. We show that a Lie algebra has a very nilpotent…

For two countable ordinals $\alpha$ and $\beta$, a basis of a Banach space $X$ is said to be $(\alpha, \beta)$-quasi-greedy if it is 1) quasi-greedy, 2) $\mathcal{S}_\alpha$-unconditional but not $\mathcal{S}_{\alpha+1}$-unconditional, and…

Counterfactual frameworks have grown popular in machine learning for both explaining algorithmic decisions but also defining individual notions of fairness, more intuitive than typical group fairness conditions. However, state-of-the-art…

We study the sets that are computable from both halves of some (Martin-L\"of) random sequence, which we call \emph{$1/2$-bases}. We show that the collection of such sets forms an ideal in the Turing degrees that is generated by its c.e.\…

Given any polynomial with real coefficients, the existence of a real quadratic polynomial factor is proven using only basic real analysis. The aim is to provide an approachable proof to anybody who is familiar with the least upper bound…

Let $X$ be a Banach space and $(e_n)_{n=1}^\infty$ be a basis. For a function $f$ in a large collection $\mathcal{F}$ (closed under composition), we define and characterize $f$-greedy and $f$-almost greedy bases. We study relations among…

We add an analytic trans-exponential function $\varphi$ to $\mathbb{R}_{an,\exp}$. We reduce the o-minimality of $\mathbb{R}_{an,\exp,\varphi}$ to the existence of "many" regular values for some definable systems of functions, which is a…

We compare two methods of proving separable reduction theorems in functional analysis -- the method of rich families and the method of elementary submodels. We show that any result proved using rich families holds also when formulated with…

We examine the relation of BSS-reducibility on subsets of the real numbers. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSS-computation to be BSS-reducible to a countable set.…

Let $\mathcal{A}$ denote a real, $n$-dimensional, unital, associative algebra.This paper provides an introductory exposition of calculus over $\mathcal{A}$. An $\mathcal{A}$-differentiable function is one for which the differential is…

While theoretical computer science primarily works with discrete models of computation, like the Turing machine and the wordRAM, there are many scenarios in which introducing real computation models is more adequate. We want to compare real…

We reformulate slightly Russell's notion of typicality, so as to eliminate its circularity and make it applicable to elements of any first-order structure. We argue that the notion parallels Martin-L\"{o}f (ML) randomness, in the sense that…

Using methods from coarse topology we show that fundamental classes of closed enlargeable manifolds map non-trivially both to the rational homology of their fundamental groups and to the K-theory of the corresponding reduced C*-algebras.…

We study computable probably approximately correct (CPAC) learning, where learners are required to be computable functions. It had been previously observed that the Fundamental Theorem of Statistical Learning, which characterizes PAC…

Recently, there have been found new relations between the zero forcing number and the minimum rank of a graph with the algebraic co-rank. We continue on this direction by giving a characterization of the graphs with real algebraic co-rank…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a ring which is not necessarily associative or unitary, but whose additive group is finitely generated, we construct a decomposition of $R/{\rm Ann}(R)$ into directly indecomposable factors…

Let $X$ be a separable Banach space with a separating polynomial. We show that there exists $C\geq 1$ (depending only on $X$) such that for every Lipschitz function $f:X\rightarrow\mathbb{R}$, and every $\epsilon>0$, there exists a…

We show that if a finite dimensional Hopf algebra over ${\bf C}$ has a basis such that all the structure constants are non-negative, then the Hopf algebra must be given by a finite group $G$ and a factorization $G=G_+G_-$ into two…

The closure $\textrm{cl}(R)$ of a consistent set $R$ of triples (rooted binary trees on three leaves) provides essential information about tree-like relations that are shown by any supertree that displays all triples in $R$. In this…