arXiv Analytics

Sign in

arXiv:2406.06771 [math.MG]AbstractReferencesReviewsResources

On Extremal Problems Associated with Random Chords on a Circle

Cynthia Bortolotto, João P. G. Ramos

Published 2024-06-10Version 1

Inspired by the work of Karamata, we consider an extremization problem associated with the probability of intersecting two random chords inside a circle of radius $r, \, r \in (0,1]$, where the endpoints of the chords are drawn according to a given probability distribution on $\mathbb{S}^1$. We show that, for $r=1,$ the problem is degenerated in the sense that any continuous measure is an extremiser, and that, for $r$ sufficiently close to $1,$ the desired maximal value is strictly below the one for $r=1$ by a polynomial factor in $1-r.$ Finally, we prove, by considering the auxiliary problem of drawing a single random chord, that the desired maximum is $1/4$ for $r \in (0,1/2).$ Connections with other variational problems and energy minimization problems are also presented.

Related articles:
arXiv:0707.3052 [math.MG] (Published 2007-07-20)
Extremal Problems in Minkowski Space related to Minimal Networks
arXiv:2209.05940 [math.MG] (Published 2022-09-13)
Some extremal problems for polygons in the Euclidean plane
arXiv:1208.6507 [math.MG] (Published 2012-08-30)
Alexandrov's Approach to the Minkowski Problem