Results 1 to 10 of about 10,428 (64)
Overcomplete sets in non-separable Banach spaces [PDF]
We introduce and study the notion of overcomplete set in a Banach space, that subsumes and extends the classical concept of overcomplete sequence in a (separable) Banach space.
Russo, Tommaso, Somaglia, Jacopo
core +2 more sources
Equivariant absolute extensor property on hyperspaces of convex sets [PDF]
Let G be a compact group acting on a Banach space L by means of linear isometries. The action of G on L induces a natural continuous action on cc(L), the hyperspace of all compact convex subsets of L endowed with the Hausdorff metric topology.
Jonard-Pérez, Natalia
core +1 more source
On strict inclusion relations between approximation and interpolation spaces [PDF]
We study strict inclusion relations between approximation and interpolation spaces.Comment: 13 pages, Submitted to a ...
Almira, J. M.
core +1 more source
Computational Problems in Metric Fixed Point Theory and their Weihrauch Degrees
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly closed ...
Neumann, Eike
core +1 more source
Regularity lemmas in a Banach space setting
Szemer\'edi's regularity lemma is a fundamental tool in extremal graph theory, theoretical computer science and combinatorial number theory. Lov\'asz and Szegedy [L. Lov\'asz and B.
Regts, Guus
core +2 more sources
Topological radicals, II. Applications to spectral theory of multiplication operators [PDF]
We develop the spectral radius technique and the theory of tensor radicals. As applications we obtain numerous results on mutiplication operators in Banach algebras and Operator ...
Shulman, Victor S., Turovskii, Yuri V.
core
Bounded time computation on metric spaces and Banach spaces
We extend the framework by Kawamura and Cook for investigating computational complexity for operators occurring in analysis. This model is based on second-order complexity theory for functions on the Baire space, which is lifted to metric spaces by means
Schröder, Matthias, Steinberg, Florian
core +1 more source
On the relation of three theorems of analysis to the axiom of choice
In what follows, essentially two things will be accomplished: Firstly, it will be proven that a version of the Arzel\`a--Ascoli theorem and the Fr\'echet--Kolmogorov theorem are equivalent to the axiom of countable choice for subsets of real numbers ...
Fellhauer, Adrian
core +1 more source
Ultraproducts and metastability [PDF]
Given a convergence theorem in analysis, under very general conditions a model-theoretic compactness argument implies that there is a uniform bound on the rate of metastability.
Avigad, Jeremy, Iovino, José
core
Order convergence in infinite-dimensional vector lattices is not topological [PDF]
In this note, we show that the order convergence in a vector lattice $X$ is not topological unless $\dim ...
Dabboorasad, Y. A. +2 more
core +1 more source

