A Combinatorial Lemma for Complex Numbers

1961/09/01 by Glen Baxter · 3 citations
Computer Science · #Data Management and Algorithms #Computational Geometry and Mesh Generation #Topological and Geometric Data Analysis

paper · pdf · doi:10.1214/aoms/1177704985

Abstract

Z1 + * * * + Zn X n > 1. We call SO, Si * * *, Sn, * * * a random walk in the plane. The combinatorial lemmas given below are concerned with the convex hull of the random walk. Specifically, every walk So, * , S. (n + 1 points in the plane) determines a smallest closed, convex set containing these points. The boundary of this set is called the (convex) hull2 of SO, * **, Sn. Later, we will be concerned with three properties of the hull of a walk. We list these properties in the form of variables for later reference. Kn: the number of variables Zi, ***, Zn which are line segments in the hull of SO, * * * , Sn,

Cited by

• Convex hulls of random walks
• Convex hulls of planar random walks
• Improved bounds on the inradius and inverse inradius process of the convex hull of planar Brownian motion

Related

• Convex hulls of multidimensional random walks
• Positive hulls of random walks and bridges
• Sylvester's problem for random walks and bridges
• Convex hulls of random walks, hyperplane arrangements, and Weyl chambers
• Some Combinatorial Identities from the Random Walk