Über Mengen mit Trennrelationen
Un théorème en Algèbre et en Analyse.
Una classe di soluzioni con zeri dell'equazione funzionale di Aleksandrov.
In this paper we consider the Aleksandrov equation f(L + x) = f(L) + f(x) where L is contained in Rn and f: L --> R and we describe the class of solutions bounded from below, with zeros and assuming on the boundary of the set of zeros only values multiple of a fixed a > 0. This class is the natural generalization of that described by Aleksandrov itself in the one-dimensional case.
Unbouded descending infinite chain in Rudin-Frolík order
Universal cyclic relations
Universality of the μ-predictor
For suitable topological spaces X and Y, given a continuous function f:X → Y and a point x ∈ X, one can determine the value of f(x) from the values of f on a deleted neighborhood of x by taking the limit of f. If f is not required to be continuous, it is impossible to determine f(x) from this information (provided |Y| ≥ 2), but as the author and Alan Taylor showed in 2009, there is nevertheless a means of guessing f(x), called the μ-predictor, that will be correct except on a small set; specifically,...