DOCSLIB.ORG

Projection Algorithms for Convex and Combinatorial Optimization By

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Projection Algorithms for Convex and Combinatorial Optimization By Projection Algorithms for Convex and Combinatorial Optimization By JAMIE HADDOCK DISSERTATION Submitted in partial satisfaction of the requirements for the degree of DOCTOR OF PHILOSOPHY in APPLIED MATHEMATICS in the OFFICE OF GRADUATE STUDIES of the UNIVERSITY OF CALIFORNIA DAVIS Approved: Professor Jes´usA. De Loera, Chair University of California, Davis Professor Albert Fannjiang University of California, Davis Professor Roland W. Freund University of California, Davis Professor Deanna Needell University of California, Los Angeles Committee in Charge 2018 -i- To my family, whose examples have taught me strength and perseverence. -ii- Table of Contents List of Tables . v List of Figures . vi Abstract . x Acknowledgments . xii Chapter 1. Introduction . 1 1.1. Background . 1 1.2. Linear Feasibility (LF)............................................. 16 1.2.1. Examples of LF Applications . 17 1.2.2. Iterative Projection Methods for LF ............................... 23 1.3. Minimum Norm Point (MNP) ........................................ 29 1.3.1. Examples of MNP Applications . 30 1.3.2. Wolfe's Methods for MNP ....................................... 36 1.4. How are LF and MNP Related? . 39 Chapter 2. Iterative Projection Methods for Linear Feasibility . 41 2.1. Motzkin's Method . 41 2.1.1. Convergence Rate . 44 2.1.2. Acceleration of Motzkin's Method . 45 2.2. Randomized Kaczmarz Method . 57 2.2.1. Convergence Rate . 59 2.2.2. A Kaczmarz-Type Approach for Corruption . 61 2.3. Sampling Kaczmarz-Motzkin Method . 79 2.3.1. Convergence Rate . 80 -iii- 2.3.2. Finiteness . 86 2.3.3. Termination of SKM Reflection Method . 88 2.4. Experimental Results . 89 Chapter 3. Wolfe's Methods for Minimum Norm Point . 103 3.1. Background . 103 3.2. Wolfe's Method . 107 3.2.1. Examples . 109 3.3. Discussion of Related Results . 114 3.4. Example of Exponential Behavior . 118 3.4.1. Preliminary Lemmas . 119 3.4.2. Proof of Exponential Behavior . 125 Chapter 4. Connections and Conclusions . 136 4.1. Issues of Computational Complexity for LP and MNP Problems . 136 4.2. Strongly-Polynomial Reduction of LP to MNP ............................. 140 4.3. Conclusions and Future Work . 149 Appendix A. MATLAB Code . 153 Bibliography . 166 Index............................................................... 175 -iv- List of Tables Table 2.1 CPU computing time comparisons for MATLAB methods and SKM . 98 Table 3.1 Iterations for linopt insertion rule on Wolfe's example . 110 Table 3.2 Iterations for minnorm insertion rule on Wolfe's example . 110 Table 3.3 Iterations for minnorm insertion rule on simplex . 113 Table 3.4 Iterations for linopt insertion rule on simplex . 113 Table 3.5 Iterations for minnorm insertion rule on P (3) . 120 Table 3.6 Iterations for linopt insertion rule on P (3) . 121 -v- List of Figures Figure 1.1 Nonlinear behavior of projection . 2 Figure 1.2 `1- and `2-projections onto K .................................... 2 Figure 1.3 `2-projection onto hyperplane and halfspace . 5 Figure 1.4 `2-projection onto sphere . 6 Figure 1.5 `2-projection onto variety . 7 2 Figure 1.6 Polyhedra in R .............................................. 8 3 Figure 1.7 Convex hull, affine hull, cone of five points in R ....................... 9 Figure 1.8 Polyhedron with linear objectives defining faces . 9 Figure 1.9 3-simplex . 10 Figure 1.10 Normal fan and normal manifold of polytope P ....................... 13 Figure 1.11 Carath´eodory's theorem . 14 Figure 1.12 Iterative projection methods . 15 Figure 1.13 Projection problems . 16 Figure 1.14 Three outcomes of linear program . 19 = Figure 1.15 Polyhedron PA;b .............................................. 20 Figure 1.16 SVM problem . 21 Figure 1.17 Iterative projection method on an LF ............................... 23 Figure 1.18 Convergence constant for various β ................................ 27 Figure 1.19 MNP problems with optimal points on vertex and facet . 30 Figure 1.20 Compressed sensing recovery . 31 Figure 1.21 Colorful Carath´eodory's theorem . 32 -vi- Figure 1.22 Two classifiers for SVM problem . 34 Figure 1.23 Least-norm formulation of underdetermined Ax = b .................... 34 Figure 1.24 Submodularity of graph-cut function . 36 Figure 1.25 Wolfe's criterion . 37 Figure 1.26 Size of P (n) and iteration bound for varying dimension, n . 39 Figure 2.1 Projections with λ = 1, λ < 1 and λ > 1............................. 42 Figure 2.2 Iterates of Motzkin's method . 43 Figure 2.3 Projection onto an induced hyperplane . 43 Figure 2.4 Iterates of Motzkin's method on inconsistent system of equations . 46 Figure 2.5 Convergence of MM and RK on correlated system . 50 Figure 2.6 Convergence of MM and RK on Netlib LPs . 51 Figure 2.7 Convergence of MM and RK on Gaussian system with two types of noise . 52 Figure 2.8 γk values for Gaussian matrices of varying size . 53 Figure 2.9 Convergence of MM, RK and a hybrid on Gaussian system with two types of noise 53 Figure 2.10 MM and RK iterates on Gaussian system with sparse error . 54 Figure 2.11 Convergence of MM and RK on Gaussian system . 57 Figure 2.12 RK iterates on LF ............................................. 58 Figure 2.13 System on which RK iterate is closer than MM iterate . 59 Figure 2.14 Pseudo-solution is far from least-squares solution . 63 Figure 2.15 Method 2.6 on Gaussian system . 71 Figure 2.16 Method 2.6 on Gaussian system . 72 Figure 2.17 Method 2.7 on Gaussian system . 72 Figure 2.18 Method 2.6 on correlated system . 74 Figure 2.19 Method 2.6 on correlated system . 75 Figure 2.20 Method 2.6 with varying d ...................................... 76 -vii- Figure 2.21 Method 2.6 with varying W ..................................... 76 Figure 2.22 Method 2.5 on Gaussian system . 77 Figure 2.23 Methods 2.6 and 2.5 on tomography system . 78 Figure 2.24 Methods 2.6 and 2.5 on breast cancer data systems . 79 Figure 2.25 SKM iterates on LF ........................................... 80 Figure 2.26 Reflecting SKM terminates on full-dimensional polyhedron . 84 Figure 2.27 Non-polynomial example for iterative projection methods . 89 Figure 2.28 Computational time for convergence of SKM with various sample sizes . 91 Figure 2.29 Convergence of SKM with.
Load more

Recommended publications
  • Arxiv:1705.01294V1
    Branes and Polytopes Luca Romano email address: [email protected] ABSTRACT We investigate the hierarchies of half-supersymmetric branes in maximal supergravity theories. By studying the action of the Weyl group of the U-duality group of maximal supergravities we discover a set of universal algebraic rules describing the number of independent 1/2-BPS p-branes, rank by rank, in any dimension. We show that these relations describe the symmetries of certain families of uniform polytopes. This induces a correspondence between half-supersymmetric branes and vertices of opportune uniform polytopes. We show that half-supersymmetric 0-, 1- and 2-branes are in correspondence with the vertices of the k21, 2k1 and 1k2 families of uniform polytopes, respectively, while 3-branes correspond to the vertices of the rectified version of the 2k1 family. For 4-branes and higher rank solutions we find a general behavior. The interpretation of half- supersymmetric solutions as vertices of uniform polytopes reveals some intriguing aspects. One of the most relevant is a triality relation between 0-, 1- and 2-branes. arXiv:1705.01294v1 [hep-th] 3 May 2017 Contents Introduction 2 1 Coxeter Group and Weyl Group 3 1.1 WeylGroup........................................ 6 2 Branes in E11 7 3 Algebraic Structures Behind Half-Supersymmetric Branes 12 4 Branes ad Polytopes 15 Conclusions 27 A Polytopes 30 B Petrie Polygons 30 1 Introduction Since their discovery branes gained a prominent role in the analysis of M-theories and du- alities [1]. One of the most important class of branes consists in Dirichlet branes, or D-branes. D-branes appear in string theory as boundary terms for open strings with mixed Dirichlet-Neumann boundary conditions and, due to their tension, scaling with a negative power of the string cou- pling constant, they are non-perturbative objects [2].
    [Show full text]
  • 15 BASIC PROPERTIES of CONVEX POLYTOPES Martin Henk, J¨Urgenrichter-Gebert, and G¨Unterm
    15 BASIC PROPERTIES OF CONVEX POLYTOPES Martin Henk, J¨urgenRichter-Gebert, and G¨unterM. Ziegler INTRODUCTION Convex polytopes are fundamental geometric objects that have been investigated since antiquity. The beauty of their theory is nowadays complemented by their im- portance for many other mathematical subjects, ranging from integration theory, algebraic topology, and algebraic geometry to linear and combinatorial optimiza- tion. In this chapter we try to give a short introduction, provide a sketch of \what polytopes look like" and \how they behave," with many explicit examples, and briefly state some main results (where further details are given in subsequent chap- ters of this Handbook). We concentrate on two main topics: • Combinatorial properties: faces (vertices, edges, . , facets) of polytopes and their relations, with special treatments of the classes of low-dimensional poly- topes and of polytopes \with few vertices;" • Geometric properties: volume and surface area, mixed volumes, and quer- massintegrals, including explicit formulas for the cases of the regular simplices, cubes, and cross-polytopes. We refer to Gr¨unbaum [Gr¨u67]for a comprehensive view of polytope theory, and to Ziegler [Zie95] respectively to Gruber [Gru07] and Schneider [Sch14] for detailed treatments of the combinatorial and of the convex geometric aspects of polytope theory. 15.1 COMBINATORIAL STRUCTURE GLOSSARY d V-polytope: The convex hull of a finite set X = fx1; : : : ; xng of points in R , n n X i X P = conv(X) := λix λ1; : : : ; λn ≥ 0; λi = 1 : i=1 i=1 H-polytope: The solution set of a finite system of linear inequalities, d T P = P (A; b) := x 2 R j ai x ≤ bi for 1 ≤ i ≤ m ; with the extra condition that the set of solutions is bounded, that is, such that m×d there is a constant N such that jjxjj ≤ N holds for all x 2 P .
    [Show full text]
  • Convex Polytopes and Tilings with Few Flag Orbits
    Convex Polytopes and Tilings with Few Flag Orbits by Nicholas Matteo B.A. in Mathematics, Miami University M.A. in Mathematics, Miami University A dissertation submitted to The Faculty of the College of Science of Northeastern University in partial fulfillment of the requirements for the degree of Doctor of Philosophy April 14, 2015 Dissertation directed by Egon Schulte Professor of Mathematics Abstract of Dissertation The amount of symmetry possessed by a convex polytope, or a tiling by convex polytopes, is reflected by the number of orbits of its flags under the action of the Euclidean isometries preserving the polytope. The convex polytopes with only one flag orbit have been classified since the work of Schläfli in the 19th century. In this dissertation, convex polytopes with up to three flag orbits are classified. Two-orbit convex polytopes exist only in two or three dimensions, and the only ones whose combinatorial automorphism group is also two-orbit are the cuboctahedron, the icosidodecahedron, the rhombic dodecahedron, and the rhombic triacontahedron. Two-orbit face-to-face tilings by convex polytopes exist on E1, E2, and E3; the only ones which are also combinatorially two-orbit are the trihexagonal plane tiling, the rhombille plane tiling, the tetrahedral-octahedral honeycomb, and the rhombic dodecahedral honeycomb. Moreover, any combinatorially two-orbit convex polytope or tiling is isomorphic to one on the above list. Three-orbit convex polytopes exist in two through eight dimensions. There are infinitely many in three dimensions, including prisms over regular polygons, truncated Platonic solids, and their dual bipyramids and Kleetopes. There are infinitely many in four dimensions, comprising the rectified regular 4-polytopes, the p; p-duoprisms, the bitruncated 4-simplex, the bitruncated 24-cell, and their duals.
    [Show full text]
  • Applying Multidimensional Geometry to Basic Data Centre Designs
    JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING RESEARCH VOL. 1, NO. 1, 2021 Applying Multidimensional Geometry to Basic Data Centre Designs Pedro Juan Roig1,2,*, Salvador Alcaraz1, Katja Gilly1, Carlos Juiz2 1Department of Computing Engineering, Miguel Hernández University, Spain, Email: [email protected], [email protected], [email protected] 2Department of Mathematics and Computer Science, University of the Balearic Islands, Spain, Email: [email protected] * Corresponding author Abstract: Fog computing deployments are catching up by the Therefore, that leads to utilize a smaller amount of switches day due to their advantages on latency and bandwidth compared so as to link together all those hosts, thus allowing for the use to cloud implementations. Furthermore, the number of required of easier interconnection topologies among those switches [5]. hosts is usually far smaller, and so are the amount of switches needed to make the interconnections among them. In this paper, Hence, Fog deployments permit the implementation of an approach based on multidimensional geometry is proposed basic Data Centre designs, which may be modelled by means for building up basic switching architectures for Data Centres, of elements of multidimensional geometry, specifically, by in a way that the most common convex regular N-polytopes are using different types of N-polytopes. first introduced, where N is treated in an incremental manner in The organization of the rest of the paper goes as follows: order to reach a generic high-dimensional N, and in turn, those first, Section 2 introduces multidimensional geometry, next, resulting shapes are associated with their corresponding switching topologies. This way, N-simplex is related to a full Section 3 talks about platonic solids, Section 4 explains the mesh pattern, N-orthoplex is linked to a quasi full mesh Schläfli notation, afterwards, Section 5 exposes regular N- structure and N-hypercube is referred to as a certain type of polytopes in Euclidean spaces, later on, Section 6 presents the partial mesh layout.
    [Show full text]
  • New Family of Tilings of Three-Dimensional Euclidean Space by Tetrahedra and Octahedra
    New family of tilings of three-dimensional Euclidean space by tetrahedra and octahedra John H. Conwaya, Yang Jiaob, and Salvatore Torquatob,c,1 aDepartment of Mathematics, Princeton University, Princeton, NJ 08544; bPrinceton Institute for the Science and Technology of Materials, Princeton University, Princeton, NJ 08544; and cDepartment of Chemistry, Department of Physics, Princeton Center for Theoretical Science, Program in Computational and Applied Mathematics, Princeton University, Princeton, NJ 08544 Edited* by Ronald L. Graham, University of California, La Jolla, CA, and approved May 17, 2011 (received for review April 7, 2011) It is well known that two regular tetrahedra can be combined with a single regular octahedron to tile (complete fill) three-dimensional Euclidean space R3. This structure was called the “octet truss” by Buckminster Fuller. It was believed that such a tiling, which is the Delaunay tessellation of the face-centered cubic (fcc) lattice, and its closely related stacking variants, are the only tessellations of R3 that involve two different regular polyhedra. Here we identify and analyze a unique family comprised of a noncountably infinite number of periodic tilings of R3 whose smallest repeat tiling unit Fig. 1. The three regular tilings of the plane: (A) A portion of the tiling by triangles with a fundamental cell containing two triangles with two different consists of one regular octahedron and six smaller regular tetrahe- orientations (shown by different shadings). (B) A portion of the tiling by dra. We first derive an extreme member of this unique tiling family squares. (C) A portion of the tiling by hexagons. by showing that the “holes” in the optimal lattice packing of octa- hedra, obtained by Minkowski over a century ago, are congruent regular polygons and the remaining two of which are made of tetrahedra.
    [Show full text]
  • Stereographic Visualization of 5-Dimensional Regular Polytopes
    S S symmetry Article Stereographic Visualization of 5-Dimensional Regular Polytopes Xingchang Wang 1, Tao Yu 1,* , Kwokwai Chung 2, Krzysztof Gdawiec 3 and Peichang Ouyang 1 1 School of Mathematics and Physics, Jinggangshan University, Ji’an 343009, China; [email protected] (X.W.); [email protected] (P.O.) 2 Department of Mathematics, City University of Hong Kong, Kowloon, Hong Kong; [email protected] 3 Institute of Mathematics, University of Silesia, 40-007 Katowice, Poland; [email protected] * Correspondence: [email protected] Received: 30 January 2019; Accepted: 15 March 2019; Published: 18 March 2019 Abstract: Regular polytopes (RPs) are an extension of 2D (two-dimensional) regular polygons and 3D regular polyhedra in n-dimensional (n ≥ 4) space. The high abstraction and perfect symmetry are their most prominent features. The traditional projections only show vertex and edge information. Although such projections can preserve the highest degree of symmetry of the RPs, they can not transmit their metric or topological information. Based on the generalized stereographic projection, this paper establishes visualization methods for 5D RPs, which can preserve symmetries and convey general metric and topological data. It is a general strategy that can be extended to visualize n-dimensional RPs (n > 5). Keywords: five-dimensional regular polytopes; fundamental root systems; stereographic projection; kaleidoscope principle 1. Introduction Regular polytopes (RPs) are an extension of 2D regular polygons and 3D regular polyhedra in n-dimensional Euclidean space Rn (n ≥ 4), which have high abstraction and perfect symmetry [1–3]. For instance, the 5D hypercube f4, 3, 3, 3g has 32 vertices, 80 edges, 80 squares, 40 3D cubes, and 10 4D regular polytopes f4, 3, 3g.
    [Show full text]
  • The Extreme Projections of the Regular Simplex
    transactions of the american mathematical society Volume 317, Number 2, February 1990 THE EXTREME PROJECTIONS OF THE REGULAR SIMPLEX P. FILLIMAN Abstract. The largest and smallest projections of the regular «-dimensional simplex into a A:-dimensional subspace are determined for certain values of n and k . These results suggest that the smallest k-dimensional projection and the largest (n — A)-dimensional projection occur in orthogonal subspaces of R" . Introduction Let T" be the regular «-dimensional simplex with edge length \/2, and let P = Tl(Tn : L) be the orthogonal projection of T" into a k-dimensional subspace L of R" . Our goal is to find the projections of T" with the maximum and minimum k-volume. A striking pattern has emerged in the results below, which leads to the follow- ing conjectures: Let Tn =Yl(Tn: LQ) be a ^-dimensional simplex with evenly distributed weights, where the weights of a vertex is the number of vertices of T" which project onto it. Conjecture A. The smallest /c-dimensional projection of T" is Tn . Conjecture B. The largest (n - A:)-dimensional projection of T" is Tkn=U(Tn:L^). If true, these conjectures would imply that the largest and smallest projections of T" occur in orthogonal subspaces, and are therefore Gale transforms of each other (see [12, §3.1]). This can be contrasted with the case of the regular «-cube, in which such projections have the same volume (see [2, 3.7]). The main tool we shall use in the exterior algebra method of [6], which is summarized in §1. §2 deals with minimal projections, and §3 with maximal projections, where results are given when k or « - k is small (see also [7] and [10]).
    [Show full text]
  • Coxeter Groups and Artin Groups Day 1: Polytopes and Reflection Groups
    Coxeter groups and Artin groups Day 1: Polytopes and Reflection Groups Jon McCammond (U.C. Santa Barbara) 1 Overview The plan is to spend • two days on (topics related to) Coxeter groups, and • two days on (topics related to) Artin groups. The theme will be the close connections these groups have with other parts of mathematics (and the need to understand these connections in order to fully understand the groups). For Coxeter groups, the list includes regular polytopes, Lie groups, symmetric spaces, and finite simple groups. All of these connections are well-known (but not to everyone). For Artin groups, the associated objects are less well understood (and they include some interesting infinite continuous groups). 2 Where do Coxeter groups come from? Although Coxeter groups (and Artin groups) can be easily defined via presentations, this fails to show why they are important. The motivation for the definition comes from two directions: Platonic solids ⇒ Regular polytopes ⇒ Finite reflection groups Lie groups ⇒ Lie algebras ⇒ Affine reflection groups Both finite and affine reflection groups have simple presentations and Coxeter groups can be viewed as their natural generalization. 3 Polytopes Def: A polytope P is the convex hull of a finite set of points in some Euclidean space, or, equivalently, it is a bounded, non- empty intersection of finite number of half-spaces. The dimension of the minimal affine subspace containing P is called the dimension of P . If H is a half-space containing P and Q = ∂H ∩ P is non-empty, then Q is another polytope called a face of P . The faces of P are ordered by inclusion.
    [Show full text]
  • 1. Lecture I: Introduction to Polytopes and Face Enumeration
    POLYTOPES MARGARET A. READDY 1. Lecture I: Introduction to Polytopes and Face Enumeration Gr¨unbaum and Shephard [40] remarked that there were three develop- ments which foreshadowed the modern theory of convex polytopes. (1) The publication of Euclid's Elements and the five Platonic solids. In modern terms, these are the regular 3-polytopes. (2) Euler's Theorem which states that that v − e + f = 2 holds for any 3-dimensional polytope, where v, e and f denote the number of vertices, edges and facets, respectively. In modern lan- guage, f0 − f1 + f2 = 2; where fi, i = 0; 1; 2, is the number of i-dimensional faces. (3) The discovery of polytopes in dimensions greater or equal to four by Schl¨afli. We will use these as a springboard to describe the theory of convex polytopes in the 21st century. 1.1. Examples. n Recall a set S in R is convex if the line segment connecting any two points in S is completely contained in the set S. In mathematical terms, given any x1; x2 2 S, the set of all points λ · x1 + (1 − λ)x2 2 S for 0 ≤ λ ≤ 1. A n convex polytope or polytope in n-dimensional Euclidean space R is defined n as the convex hull of k points x1; : : : ; xk in R , that is, the intersection of all convex sets containing these points. Throughout we will assume all of the polytopes we work with are convex. One can also define a polytope as the bounded intersection of a finite num- n ber of half-spaces in R .
    [Show full text]
  • E-Polytopes in Picard Groups of Smooth Rational Surfaces
    S S symmetry Article E-Polytopes in Picard Groups of Smooth Rational Surfaces Jae-Hyouk Lee 1,* and YongJoo Shin 2 1 Department of Mathematics, Ewha Womans University, Seoul 03760, Korea 2 Shanghai Center for Mathematical Sciences, Fudan University, Shanghai 103077, China; [email protected] * Correspondence: [email protected]; Tel.: +82-2-3277-3346 Academic Editor: Brigitte Servatius Received: 30 September 2015; Accepted: 13 April 2016; Published: 20 April 2016 Abstract: In this article, we introduce special divisors (root, line, ruling, exceptional system and rational quartic) in smooth rational surfaces and study their correspondences to subpolytopes in Gosset polytopes k21. We also show that the sets of rulings and exceptional systems correspond equivariantly to the vertices of 2k1 and 1k2 via E-type Weyl action. Keywords: del Pezzo surface; Hirzebruch surface; Gosset polytope; E-polytope MSC Classifications: 14J26; 14E05 1. Introduction Rational surfaces are complex surfaces birational to P2. According to the classification of surfaces [1], the minimal surfaces of smooth rational surfaces are either a projective plane P2 or a Hirzebruch surface F. In particular, the typical examples of del Pezzo surfaces, which are smooth surfaces Sr with the ample anticanonical divisor class −KSr , are obtained by blowing up r (<9) points of P2 in general position. Del Pezzo surfaces have drawn the attention of mathematicians and physicists because of their geometries and dualities involving mysterious symmetries. For example, the special 2 divisor classes l (called lines) of a del Pezzo surface Sr satisfying l = l · KSr = −1 are bijectively related to the vertices of Gosset polytopes (r − 4)21 , which are one type of semiregular polytopes given by the action of the Er symmetry group (called E-polytopes).
    [Show full text]
  • 4D Polytopes and Their Dual Polytopes of the Coxeter Group AW 4 )( Represented by Quaternions
    4D Polytopes and Their Dual Polytopes of the Coxeter GroupWA()4 Represented by Quaternions Mehmet Koca a) , Nazife Ozdes Koca b, *) and Mudhahir Al-Ajmi c) Department of Physics, College of Science, Sultan Qaboos University P. O. Box 36, Al-Khoud 123, Muscat, Sultanate of Oman ABSTRACT 4-dimensional A4 polytopes and their dual polytopes have been constructed as the orbits of the Coxeter-Weyl group WA()4 where the group elements and the vertices of the polytopes are represented by quaternions. Projection of an arbitrary W ()A4 orbit into three dimensions is made using the subgroupW (A3 ) . A generalization of the Catalan solids for 3D polyhedra has been developed and dual polytopes of the uniform A4 polytopes have been constructed. Keywords: 4D polytopes, Dual polytopes, Coxeter groups, Quaternions, W(A4 ) a) electronic-mail: [email protected] b, * ) electronic-mail: [email protected], Corresponding author c) electronic-mail: [email protected] 1 1. Introduction The orbits of the Coxeter groups in an arbitrary Euclidean space represent the quasi regular polytopes (including the regular and semi regular polytopes as special cases). An infinite number of rank-2 Coxeter groups which are isomorphic to the dihedral groups Dn exist in 2D dimensions describing the symmetries of the vertex and edge transitive polygons. In 3D, besides the prismatic groups isomorphic to DCn 2 , there exist three rank- 3 Coxeter groupsWA( 3 ) ,WB( 3 ) and WH( 3 ) describing the symmetries of the tetrahedron, octahedron-cube and icosahedron-dodecahedron and their Archimedean polyhedra. Extension of the rank-3 Coxeter groups to rank-4 Coxeter groups is somewhat straightforward.
    [Show full text]
  • Exterior Algebra and Projections of Polytopes
    Discrete Comput Geom 5:305-322 (1990) © 1990Sprinser-Verlag New York~Incl~Y Exterior Algebra and Projections of Polytopes P. Filliman Department of Mathematics, Western Washington University, Bellingham, WA 98225, USA Communicated by G. D. Chakerian Abstract. This paper explores the metrical properties of convex polytopes by means of the classical Pliicker embedding of the Grassmannian G(k, n) of k-planes in R n into the exterior algebra AkR ~. The results follow from the description of the volume of the projection of a polytope into a k-plane by a piecewise linear function on G(k, n). For example, the Hodge-star operator is used to obtain the volume of a polytope from its Gale transform. Also, the classification of the faces of G(2, n) (or G(n -2, n)) imply that the largest projection within a particular combinatorial type is unique if k = 2 or n - 2. Introduction The exterior (or Grassmann) algebra is a beautiful classical theory which can be used to represent geometric properties of R ~ by algebraic operations. This method has had applications in many areas of geometry, one example being the recent use of chirotopes (or oriented matroids) to investigate the combinatorial proper- ties of polytopes (see [2] and [3]). This paper uses the exterior algebra to gain insight into the metric properties of polytopes, in particular, the volume of their projections. The first section contains a review of the properties of the exterior algebra, especially in light of the connection with the geometry of R n mentioned above. The principal object of study is the Grassmann manifold G(k, n) of all k- dimensional subspaces of R n.
    [Show full text]