A combinatorial version of Sylvester's four-point problem

Details A combinatorial version of Sylvester's four-point problem A combinatorial version of Sylvester's four-point problem

2009-10-30

arxiv.org/abs/0910.5945v2

Adv. in App. Math., 45 (2010) no. 3, 390--394

Mathematics

Combinatorics

5 pages, 4 figures. Reference added to fact that the main conjecture has been proven by O. Angel and A. E. Holroyd, Electron.

Scientific paper

10.1016/j.aam.2010.01.008

J. J. Sylvester's four-point problem asks for the probability that four points chosen uniformly at random in the plane have a triangle as their convex hull. Using a combinatorial classification of points in the plane due to Goodman and Pollack, we generalize Sylvester's problem to one involving reduced expressions for the long word in the symmetric group. We conjecture an answer of 1/4 for this new version of the problem.

Affiliated with

Also associated with

No associations

Rating

A combinatorial version of Sylvester's four-point problem does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A combinatorial version of Sylvester's four-point problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A combinatorial version of Sylvester's four-point problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-90530