Randomness and pattern in convex geometric analysis.
For a given lattice, we establish an equivalence between closed zones for the corresponding Voronoï polytope, suitable hyperplane sections of the corresponding Delaunay partition, and rank quadratic forms which are extreme rays for the corresponding -type domain.
A sign pattern matrix (or nonnegative sign pattern matrix) is a matrix whose entries are from the set (, respectively). The minimum rank (or rational minimum rank) of a sign pattern matrix is the minimum of the ranks of the matrices (rational matrices, respectively) whose entries have signs equal to the corresponding entries of . Using a correspondence between sign patterns with minimum rank and point-hyperplane configurations in and Steinitz’s theorem on the rational realizability of...
For every hemisphere K supporting a spherically convex body C of the d-dimensional sphere we consider the width of C determined by K. By the thickness Δ(C) of C we mean the minimum of the widths of C over all supporting hemispheres K of C. A spherically convex body is said to be reduced provided Δ(Z) < Δ(R) for every spherically convex body Z ⊂ R different from R. We characterize reduced spherical polygons on S². We show that every reduced spherical polygon is of thickness at most π/2. We...