Finite Coverings by Translates of Centrally Symmetric Convex Domains.

Fejes G. Tóth

Displaying similar documents to “Finite Coverings by Translates of Centrally Symmetric Convex Domains.”

A note on Costara's paper

Armen Edigarian (2004)

Annales Polonici Mathematici

Similarity:

We show that the symmetrized bidisc 𝔾₂ = {(λ₁+λ₂,λ₁λ₂):|λ₁|,|λ₂| < 1} ⊂ ℂ² cannot be exhausted by domains biholomorphic to convex domains.

The symmetrized polydisc cannot be exhausted by domains biholomorphic to convex domains

Nikolai Nikolov (2006)

Annales Polonici Mathematici

Similarity:

We prove that the symmetrized polydisc cannot be exhausted by domains biholomorphic to convex domains.

Domains of biregularity in Clifford analysis

Brackx, Freddy, Pincket, Willy

Similarity:

The Different Ways of Stabbing Disjoint Convex Sets.

M. Katchalski, T. Lewis, A. Liu (1992)

Discrete & computational geometry

Similarity:

Convex Disks Can Cover Their Shadow.

G. Kós, J. Töröcsik (1990)

Discrete & computational geometry

Similarity:

Generalized Breadths, Circular Cantor Sets, and the Least Area UCC .

Gy. Elekes (1994)

Discrete & computational geometry

Similarity:

A Postscript on Distances in Convex n-Gons.

P. Erdös, P. Fishburn (1994)

Discrete & computational geometry

Similarity:

Lempert theorem for strongly linearly convex domains

Łukasz Kosiński, Tomasz Warszawski (2013)

Annales Polonici Mathematici

Similarity:

In 1984 L. Lempert showed that the Lempert function and the Carathéodory distance coincide on non-planar bounded strongly linearly convex domains with real-analytic boundaries. Following his paper, we present a slightly modified and more detailed version of the proof. Moreover, the Lempert Theorem is proved for non-planar bounded strongly linearly convex domains.

Can You Cover Your Shadows?

P. Mani-Levitska, H.E. Debrunner (1986)

Discrete & computational geometry

Similarity:

On Convex Body Chasing.

J. Friedman, N. Linial (1993)

Discrete & computational geometry

Similarity: