2000 character limit reached
Functional Covering Numbers
Published 22 Apr 2017 in math.FA | (1704.06753v1)
Abstract: We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric inequalities on covering numbers, such as volume bounds, bounds connected with Hadwiger's conjecture, and inequalities about M-positions for geometric log-concave functions. In particular, we obtain strong versions of M-positions for geometric log-concave functions.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.