2000 character limit reached
On weakly m-convex sets (1703.06785v1)
Published 17 Mar 2017 in math.MG
Abstract: There were obtained some properties of weakly m-convex sets. Various kinds of the problem of shadow were investigated. There was obtained the lower estimation for the number of balls that are necessary to create a shadow at the point of the sphere in three-dimensional Euclidean space
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.