On the average number of \(k\)-sets

DOI10.1007/BF02293044zbMath0760.52006MaRDI QIDQ1193707

Paul H. Edelman

Publication date: 27 September 1992

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/131217

zbMATH Keywords

\(k\)-setsallowable circular sequence

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Other problems of combinatorial convexity (52A37)

Related Items (1)

The maximum multiplicity of a generator in a reduced word

Cites Work

• Unnamed Item
• Unnamed Item
• The number of small semispaces of a finite set of points in the plane
• On the number of reduced decompositions of elements of Coxeter groups
• Balanced tableaux
• On the number of line separations of a finite set in the plane
• The Hook Graphs of the Symmetric Group

This page was built for publication: On the average number of \(k\)-sets