Minimal ball-coverings in Banach spaces and their application

Lixin Cheng; Qingjin Cheng; Huihua Shi

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

The search session has expired. Please query the service again.

Displaying similar documents to “Minimal ball-coverings in Banach spaces and their application”

Covering the unit cube by equal balls.

Joós, Antal (2008)

Beiträge zur Algebra und Geometrie

Similarity:

On covering of bounded sets by sets with the twice less diameter

Karol Borsuk, Rimas Vaina (1979)

Colloquium Mathematicae

Similarity:

Concerning two covering properties

Rastislav Telgársky (1976)

Colloquium Mathematicae

Similarity:

Erratum to: Covering the unit cube by equal balls.

Joos, A. (2009)

Beiträge zur Algebra und Geometrie

Similarity:

Mean with respect to a map

G. J. Michaelides (1981)

Colloquium Mathematicae

Similarity:

Covering a disk by disks.

Dumitrescu, Adrian, Jiang, Minghui (2010)

Beiträge zur Algebra und Geometrie

Similarity:

On a covering group theorem and its applications.

Grigorian, S.A., Gumerov, R.N. (2002)

Lobachevskii Journal of Mathematics

Similarity:

On the covering space and the automorphism group of the covering space.

Tekcan, A., Bayraktar, M., Bizim, O. (2003)

Balkan Journal of Geometry and its Applications (BJGA)

Similarity:

Some topological properties of $ω$ -covering sets

Andrzej Nowik (2000)

Czechoslovak Mathematical Journal

Similarity:

We prove the following theorems: There exists an $ω$ -covering with the property $s_{0}$ . Under $c o v (𝒩) =$ there exists $X$ such that $\forall_{B \in ℬ o r} [B \cap X$ is not an $ω$ -covering or $X ∖ B$ is not an $ω$ -covering]. Also we characterize the property of being an $ω$ -covering.

A characterization of covering equivalence

Hao Pan, Zhi-Wei Sun (2007)

Acta Arithmetica

Similarity:

A new lower bound for the football pool problem for $7$ matches

Laurent Habsieger (1996)

Journal de théorie des nombres de Bordeaux

Similarity:

Let $K_{3} (7, 1)$ denote the minimum cardinality of a ternary code of length $7$ and covering radius one. In a previous paper, we improved on the lower bound $K_{3} (7, 1) \geq 147$ by showing that $K_{3} (7, 1) \geq 150$ . In this note, we prove that $K_{3} (7, 1) \geq 153$ .