On convexified packing and entropy duality (Q1764305): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q104523480, #quickstatements; #temporary_batch_1706897434465 |
Removed claims |
||
| Property / author | |||
| Property / author: Q1764303 / rank | |||
| Property / author | |||
| Property / author: Vitali D. Milman / rank | |||
| Property / author | |||
| Property / author: Stanislaw J. Szarek / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Semen S. Kutateladze / rank | |||
Revision as of 18:16, 14 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On convexified packing and entropy duality |
scientific article |
Statements
On convexified packing and entropy duality (English)
0 references
24 February 2005
0 references
The authors suggest a new approach to the duality conjecture for covering numbers. This approach is based on the conception of convex separation which is close to sequential packing. The authors prove a duality result and announce a few theorems on convex separation and duality of the covering and packing numbers. The proofs will appear elsewhere.
0 references
covering number
0 references
packing number
0 references
convex separation
0 references
