Numerical experiments suggest that this random area, upon subtraction of 1 2\pi log n, converges in distribution as n \to \infty, but this remains an open problem.
Statement
Numerical experiments suggest that this random area, upon subtraction of 1 2\pi log n, converges in distribution as n \to \infty, but this remains an open problem. properties of uniformly sampled such disks, hinting at the existence of a universal scaling limit. For the first family, we consider n-sided self-overlapping polygons with fixed side set, i.e. the set of n vectors in R2 \ {0} corresponding to the boundary segments oriented in counterclockwise direction. We say an n-element set Zn \subset R2 \ {0} that sums to zero is generic if for any pair of non-empty disjoint subsets U, V \subset Zn such that U \cup V 6= Zn the sums of U and V are linearly independent. Theorem 1 ([2]). For n \geq 3 and a fixed generic set Zn , the number of self- overlapping polygons with side set Zn is (n − 2)!. An example of the (n − 2)! self-overlapping polygons sharing a particular side set Zn for n = 5 is Riemann Surfaces: Random, Flat, and Hyperbolic Geometry 2383
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.