pith. sign in

arxiv: 1708.05218 · v2 · pith:Q2A2S7V4new · submitted 2017-08-17 · 🧮 math.FA

Operations with slicely countably determined sets

classification 🧮 math.FA
keywords setsavilcountablydemonstratedeterminedoperationsslicelysome
0
0 comments X
read the original abstract

The notion of slicely countably determined (SCD) sets was introduced in 2010 by A.~Avil\'{e}s, V.~Kadets, M.~Mart\'{i}n, J.~Mer\'{i} and V.~Shepelska. We solve in the negative some natural questions about preserving being SCD by the operations of union, intersection and Minkowski sum. Moreover, we demonstrate that corresponding examples exist in every space with the Daugavet property and can be selected to be unit balls of some equivalent norms. We also demonstrate that almost SCD sets need not be SCD, thus answering a question posed by A. Avil\'{e}s et al.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.