A combinatorial version of Sylvester's four-point problem

DOI10.1016/J.AAM.2010.01.008MaRDI QIDQ990768zbMATH OpenOpenAlexFDO

Authors Gregory S. Warrington

Publication date 1 September 2010

Published in Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0910.5945

zbMATH Keywords

convexprobabilityreduced expressionssorting networksSylvester four-point problemsymmetric group

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Combinatorial probability (60C05)

Abstract: 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.

Recommendations

• Sylvester's problem and random chords
• scientific article; zbMATH DE number 3967548
• AROUND SYLVESTER'S QUESTION IN THE PLANE
• The Historical Development of J. J. Sylvester's Four Point Problem
• A modification of Sylvester's four point problem

Cites work

• Axioms and hulls
• Balanced tableaux
• scientific article; zbMATH DE number 3368644 (Why is no real title available?)
• Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations
• Note on the expected number of Yang-Baxter moves applicable to reduced decompositions.
• On expected factors in reduced decompositions in type \(B\)
• On the combinatorial classification of nondegenerate configurations in the plane
• On the number of reduced decompositions of elements of Coxeter groups
• Point sets with many \(k\)-sets
• Random sorting networks
• Random subnetworks of random sorting networks
• The Historical Development of J. J. Sylvester's Four Point Problem

Cited in

(4)

• The Historical Development of J. J. Sylvester's Four Point Problem
• The Rectilinear Crossing Number of a Complete Graph and Sylvester's "Four Point Problem" of Geometric Probability
• One step further : an explicit solution to Robbins’ problem when n = 4
• A note on the 2-colored rectilinear crossing number of random point sets in the unit square

This page was built for publication: A combinatorial version of Sylvester's four-point problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q990768)