On convexified packing and entropy duality (Q1764305)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On convexified packing and entropy duality |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.8178815245628357
0 references
0.811464786529541
0 references
0.8106300234794617
0 references
0.7757113575935364
0 references
0.7683387994766235
0 references
