DOCSLIB.ORG

ADDENDUM the Following Remarks Were Added in Proof (November 1966). Page 67. an Easy Modification of Exercise 4.8.25 Establishes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

ADDENDUM The following remarks were added in proof (November 1966). Page 67. An easy modification of exercise 4.8.25 establishes the follow­ ing result of Wagner [I]: Every simplicial k-"complex" with at most 2 k ~ vertices has a representation in R + 1 such that all the "simplices" are geometric (rectilinear) simplices. Page 93. J. H. Conway (private communication) has established the validity of the conjecture mentioned in the second footnote. Page 126. For d = 2, the theorem of Derry [2] given in exercise 7.3.4 was found earlier by Bilinski [I]. Page 183. M. A. Perles (private communication) recently obtained an affirmative solution to Klee's problem mentioned at the end of section 10.1. Page 204. Regarding the question whether a(~) = 3 implies b(~) ~ 4, it should be noted that if one starts from a topological cell complex ~ with a(~) = 3 it is possible that ~ is not a complex (in our sense) at all (see exercise 11.1.7). On the other hand, G. Wegner pointed out (in a private communication to the author) that the 2-complex ~ discussed in the proof of theorem 11.1 .7 indeed satisfies b(~) = 4. Page 216. Halin's [1] result (theorem 11.3.3) has recently been genera­ lized by H. A. lung to all complete d-partite graphs. (Halin's result deals with the graph of the d-octahedron, i.e. the d-partite graph in which each class of nodes contains precisely two nodes.) The existence of the numbers n(k) follows from a recent result of Mader [1] ; Mader's result shows that n(k) ~ k.2(~) . Page 222. A very elegant, non-computational, construction of the 3-diagram E0 ' of theorem 11.5.2 was communicated to the author by G. Wegner. His construction is explained in an addendum to Griinbaum­ Sreedharan [1]. Concerning the dual A* of the 3-complex A represented by E0' (see page 224), Wegner has shown that it is not representable by a 3-diagram if the basis of the diagram is required to be the 3-face of A* which corresponds to the vertex 8 of A. Page 231, line 4. M. A. Perles has shown (private communication) that the graphs in question are dimensionally ambiguous whenever d ~ n + 3. 426 ADDEND UM 427 Page 271. In a revised version of Barnette's paper [3], the following improvement of the inequalities of exercise 13.3.13 is established: If (Pk) is a 3-realizable sequence, then 2P3 + 2P4 + 2ps + 2P6 + P7 ~ 16 + L (k - 8)Pk' k ?: 9 Thi s inequality refutes conjecture 2 (page 268). Indeed, if Pk = 0 for k -:f 3, 6, 6m, then equation (*) (page 254) implies P3 = 4 + (2m - 2)P6m' hence Barnette's inequality yields P6 ~ 4 + (m - 2)P 6m ' For (m - 2)(P6m - 6) ~ 8 this contradicts conjecture 2. On the other hand, an affi rmative solution of conjecture 1 (page 267) will be established in a forth coming paper by the author. Page 315. Recent results have greatly increased the number of known Euler-type relations, and their comparison here seems useful. We have alre ady discu ssed Euler's equation (Chapter 8) concerning numbers of faces, Gram's equation (theorem 14.1.1) concerning angle sums, and the equation of theorem 14.3.2 dealing with the Steiner point of a polytope and its faces. In order to discuss the new results, let pd = P1 denote a d-polytope, let Jj = HP), and let the j-faces of pdbe p{, ..., Pir Let m(K) denote the mean width of the compact convex set K. Shephard [11] proved that for each d-polytope P d I j L (-IY L m(P{) = -m(P). j;O j; 1 Another function with similar properties is the "angle-deficiency" l5(pL P) defined below. Let us define qJ(PL pt -I) as the angle (see page 297) spanned by pi in pt -I if pi c Pi: '; and as 0 if Pi is not contained in pt - I. Extending the well known case (d = 3), the following results were obtained by Perles-Shephard [1], Perles-Walkup [1], and Shephard [10]: For eachj-face pi ofthe d-polytope P (0::::; j ::::; d - 1), Id -I l5(pL P) = I- L qJ(P{, pt - I) ~ 0, j ; 1 with equality for j ~ d - 2, and strict inequality for j ::::; d - 3. For each d-polytope P, d -3 Ij L ( -lY L (j(P{, P) = 1 + (_I)d- I. j ; O j ; 1 428 CONVEX POLYTOPES An additional relation of the same type (which contains the mean width result as a special case) is due to Shephard [13]. Let p d be ad-polytope, let 0 < r < d, and let K,+ 1> "" K, be any d - r convex bodies. Let us denote by v(P{, . , PI, K,+ I' .. ., K d) the mixed volume (Bonnesen­ Fenchel [1], page 38) of the face p{ of pd (repeated r times) and the sets K,+ I> ••• , K d • Then d r, L (-IY L v(P{, .. ,P{,K'+I, · .. K d) j=O i =O = (-1)'v( -pd, ..., -r-, K,+I"" K d )· For proofs of these results, which usc a great variety of methods, the reader should consult the papers quoted. They contain also extensions to the case of spherical polytopes, as well as analogues of the Dehn-Sommer­ ville equations (in case of simplicial polytopes, and of other special families of polytopes) for the various quantities considered. One indication of the usefulness of some of these results may be found in Perles-Shephard [2]. Thi s paper contains results of the following type (which were completely unassailable so far) ; we quote only two very special results which are easy to formulate : If d ~ 7, no d-polytope has all facets combinatorially equ ivalent to the (d - 1)-octahedron. No 5-polytope has all facets combinatorially equivalent to the cyclic polytope C(8,4). Page 365. The example (figure 17.1.9) of a 3-valent, 3-connected, cyclically 5-connected planar graph without a Hamiltonian circuit (Walther [1]) was recently improved in some respects. While Walther's example contains 162 nodes, the author has found a similar example with 154 nodes, as well as an example with 464 nodes which does not admit even a Hamiltonian path. The first example was improved still further by Walther, who constructed a 114-node graph of this type which has no Hamiltonian circuit (private communication). A still smaller graph with the same property (with 46 nodes only) has reportedly been found by Kozyrev. Page 425. The coefficients of the Dehn-Sommerville equations given in table 3 were independently computed by Riordan [1]; however, his table is marred by misprints. In Riordan's notation, the incorrect values are Ai,_1(4) and Aj,2(5). ERRATA FOR THE 1967 EDITION This is a list of corrections (other than small typos), noted by Marge Bayer, Branko Grtinbaum, Michael Joswig, Volker Kaibel, Victor Klee, Carsten Lange, Julian Pfeifle, and GUnterM. Ziegler. A minus in front of a line number means "counted from the bottom" . Page Line Original Correction 9 6 Use exercise 2 Use statement 2 9 13 The relative interior of a convex set A C Rd may be defined as relintA := {x E Rd : (affA) n (x+ eB") C A for some e > OJ. This is empty if and only if A = 0. 13 20 The claim in exercise 7 is not valid. The following counter­ example is due to P. McMullen: Let K := K' + B3• where 3 K' := {(x,y,O) E R3 I x> 0, xy ~ I} and B3 := {(x,y,z) ER 1 x 2 +r + z2 ~ I} is the 3-dimensional unit ball. and let L := {(x, 0, I) Ix E R}. (An earlier counterexample. due to T. Botts. ap­ pears on p. 459 of Klee [a].) 35 - 15 P = conv(FUF1) aff(P) = aff(FUF)) 35 - I4 The hypothesis in exercise 3 should include Fk _) C FH) . 59 12 section 9.3 section 9.4 61 I 2d -) 2d - i 62 5 O~i~[id ] O~i<lid] 65 -5 K~ -K~ 68 15 P{Vj ) P). (V) 68 -3 9"(K) 9"(P) 77 16 AK AP 78 - II In part (ii) ofTheorem I the "only if' part is not true. Let F be a vertex of a polygon P and let V be the new vertex so that E' := conv({V} U F) is an edge that contains an original edge E of P. Then E' is a face of P·. but (*) is not satisfied. since V ~ aff F. and (**) is not satisfied. because there is no facet (edge) of P containing F for which V is beyond. The (first) error in the proof occurs in lines 4-5 on page 79. See Altshuler-Shemer [a]. 79 -7 aff FoC affF is false for the same reason as above. 82 17 The claim in exercise 13(ii) was not established by Shephard in [7]; he later found an error in his construction. (See also the notes in sec­ tion 4.9.) 100 - 8 [id2J [!d2] II 3 3 The last product in this formula contains two typos; it should be: TI Pj-l .28 je{ilr,<a,} Pj 428a 428b CONVEX POLYTOPES Page Line Original Correction lIS 0 In the figure, the star diagram and the Gale-diagram do not fit together (there should be a * at position (2,3». 117 10 el' e2,e3,e4 e)le2,e3,-e4 129 -I exercise 7.3.4 exercise 7.3.5 129 -3 exercise 7.3.4 exercise 7.3.5 138 3 section 3.3 section 3.2 170 4 Perles and Shephard did not prove the existence, for each d ~ 4, of infinitely many d-polytopes of type (2,d - 2).
Recommended publications
  • On the Circuit Diameter Conjecture

    On the Circuit Diameter Conjecture

    On the Circuit Diameter Conjecture Steffen Borgwardt1, Tamon Stephen2, and Timothy Yusun2 1 University of Colorado Denver [email protected] 2 Simon Fraser University {tamon,tyusun}@sfu.ca Abstract. From the point of view of optimization, a critical issue is relating the combina- torial diameter of a polyhedron to its number of facets f and dimension d. In the seminal paper of Klee and Walkup [KW67], the Hirsch conjecture of an upper bound of f − d was shown to be equivalent to several seemingly simpler statements, and was disproved for unbounded polyhedra through the construction of a particular 4-dimensional polyhedron U4 with 8 facets. The Hirsch bound for bounded polyhedra was only recently disproved by Santos [San12]. We consider analogous properties for a variant of the combinatorial diameter called the circuit diameter. In this variant, the walks are built from the circuit directions of the poly- hedron, which are the minimal non-trivial solutions to the system defining the polyhedron. We are able to prove that circuit variants of the so-called non-revisiting conjecture and d-step conjecture both imply the circuit analogue of the Hirsch conjecture. For the equiva- lences in [KW67], the wedge construction was a fundamental proof technique. We exhibit why it is not available in the circuit setting, and what are the implications of losing it as a tool. Further, we show the circuit analogue of the non-revisiting conjecture implies a linear bound on the circuit diameter of all unbounded polyhedra – in contrast to what is known for the combinatorial diameter. Finally, we give two proofs of a circuit version of the 4-step conjecture.
  • A General Geometric Construction of Coordinates in a Convex Simplicial Polytope

    A General Geometric Construction of Coordinates in a Convex Simplicial Polytope

    A general geometric construction of coordinates in a convex simplicial polytope ∗ Tao Ju a, Peter Liepa b Joe Warren c aWashington University, St. Louis, USA bAutodesk, Toronto, Canada cRice University, Houston, USA Abstract Barycentric coordinates are a fundamental concept in computer graphics and ge- ometric modeling. We extend the geometric construction of Floater’s mean value coordinates [8,11] to a general form that is capable of constructing a family of coor- dinates in a convex 2D polygon, 3D triangular polyhedron, or a higher-dimensional simplicial polytope. This family unifies previously known coordinates, including Wachspress coordinates, mean value coordinates and discrete harmonic coordinates, in a simple geometric framework. Using the construction, we are able to create a new set of coordinates in 3D and higher dimensions and study its relation with known coordinates. We show that our general construction is complete, that is, the resulting family includes all possible coordinates in any convex simplicial polytope. Key words: Barycentric coordinates, convex simplicial polytopes 1 Introduction In computer graphics and geometric modelling, we often wish to express a point x as an affine combination of a given point set vΣ = {v1,...,vi,...}, x = bivi, where bi =1. (1) i∈Σ i∈Σ Here bΣ = {b1,...,bi,...} are called the coordinates of x with respect to vΣ (we shall use subscript Σ hereafter to denote a set). In particular, bΣ are called barycentric coordinates if they are non-negative. ∗ [email protected] Preprint submitted to Elsevier Science 3 December 2006 v1 v1 x x v4 v2 v2 v3 v3 (a) (b) Fig.
  • 7 LATTICE POINTS and LATTICE POLYTOPES Alexander Barvinok

    7 LATTICE POINTS and LATTICE POLYTOPES Alexander Barvinok

    7 LATTICE POINTS AND LATTICE POLYTOPES Alexander Barvinok INTRODUCTION Lattice polytopes arise naturally in algebraic geometry, analysis, combinatorics, computer science, number theory, optimization, probability and representation the- ory. They possess a rich structure arising from the interaction of algebraic, convex, analytic, and combinatorial properties. In this chapter, we concentrate on the the- ory of lattice polytopes and only sketch their numerous applications. We briefly discuss their role in optimization and polyhedral combinatorics (Section 7.1). In Section 7.2 we discuss the decision problem, the problem of finding whether a given polytope contains a lattice point. In Section 7.3 we address the counting problem, the problem of counting all lattice points in a given polytope. The asymptotic problem (Section 7.4) explores the behavior of the number of lattice points in a varying polytope (for example, if a dilation is applied to the polytope). Finally, in Section 7.5 we discuss problems with quantifiers. These problems are natural generalizations of the decision and counting problems. Whenever appropriate we address algorithmic issues. For general references in the area of computational complexity/algorithms see [AB09]. We summarize the computational complexity status of our problems in Table 7.0.1. TABLE 7.0.1 Computational complexity of basic problems. PROBLEM NAME BOUNDED DIMENSION UNBOUNDED DIMENSION Decision problem polynomial NP-hard Counting problem polynomial #P-hard Asymptotic problem polynomial #P-hard∗ Problems with quantifiers unknown; polynomial for ∀∃ ∗∗ NP-hard ∗ in bounded codimension, reduces polynomially to volume computation ∗∗ with no quantifier alternation, polynomial time 7.1 INTEGRAL POLYTOPES IN POLYHEDRAL COMBINATORICS We describe some combinatorial and computational properties of integral polytopes.
  • Fitting Tractable Convex Sets to Support Function Evaluations

    Fitting Tractable Convex Sets to Support Function Evaluations

    Fitting Tractable Convex Sets to Support Function Evaluations Yong Sheng Sohy and Venkat Chandrasekaranz ∗ y Institute of High Performance Computing 1 Fusionopolis Way #16-16 Connexis Singapore 138632 z Department of Computing and Mathematical Sciences Department of Electrical Engineering California Institute of Technology Pasadena, CA 91125, USA March 11, 2019 Abstract The geometric problem of estimating an unknown compact convex set from evaluations of its support function arises in a range of scientific and engineering applications. Traditional ap- proaches typically rely on estimators that minimize the error over all possible compact convex sets; in particular, these methods do not allow for the incorporation of prior structural informa- tion about the underlying set and the resulting estimates become increasingly more complicated to describe as the number of measurements available grows. We address both of these short- comings by describing a framework for estimating tractably specified convex sets from support function evaluations. Building on the literature in convex optimization, our approach is based on estimators that minimize the error over structured families of convex sets that are specified as linear images of concisely described sets { such as the simplex or the free spectrahedron { in a higher-dimensional space that is not much larger than the ambient space. Convex sets parametrized in this manner are significant from a computational perspective as one can opti- mize linear functionals over such sets efficiently; they serve a different purpose in the inferential context of the present paper, namely, that of incorporating regularization in the reconstruction while still offering considerable expressive power. We provide a geometric characterization of the asymptotic behavior of our estimators, and our analysis relies on the property that certain sets which admit semialgebraic descriptions are Vapnik-Chervonenkis (VC) classes.
  • Snub ���Cell �Tetricosa

    Snub Cell Tetricosa

    E COLE NORMALE SUPERIEURE ________________________ A Zo o of ` embeddable Polytopal Graphs Michel DEZA VP GRISHUHKIN LIENS ________________________ Département de Mathématiques et Informatique CNRS URA 1327 A Zo o of ` embeddable Polytopal Graphs Michel DEZA VP GRISHUHKIN LIENS January Lab oratoire dInformatique de lEcole Normale Superieure rue dUlm PARIS Cedex Tel Adresse electronique dmiensfr CEMI Russian Academy of Sciences Moscow A zo o of l embeddable p olytopal graphs MDeza CNRS Ecole Normale Superieure Paris VPGrishukhin CEMI Russian Academy of Sciences Moscow Abstract A simple graph G V E is called l graph if for some n 2 IN there 1 exists a vertexaddressing of each vertex v of G by a vertex av of the n cub e H preserving up to the scale the graph distance ie d v v n G d av av for all v 2 V We distinguish l graphs b etween skeletons H 1 n of a variety of well known classes of p olytop es semiregular regularfaced zonotop es Delaunay p olytop es of dimension and several generalizations of prisms and antiprisms Introduction Some notation and prop erties of p olytopal graphs and hypermetrics Vector representations of l metrics and hypermetrics 1 Regularfaced p olytop es Regular p olytop es Semiregular not regular p olytop es Regularfaced not semiregularp olytop es of dimension Prismatic graphs Moscow and Glob e graphs Stellated k gons Cup olas Antiwebs Capp ed antiprisms towers and fullerenes regularfaced not semiregular p olyhedra Zonotop es Delaunay p olytop es Small
  • Diameter of Simplicial Complexes, a Computational Approach

    Diameter of Simplicial Complexes, a Computational Approach

    University of Cantabria Master’s thesis. Masters degree in Mathematics and Computing Diameter of simplicial complexes, a computational approach Author: Advisor: Francisco Criado Gallart Francisco Santos Leal 2015-2016 This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License. Desvarío laborioso y empobrecedor el de componer vastos libros; el de explayar en quinientas páginas una idea cuya perfecta exposición oral cabe en pocos minutos. Mejor procedimiento es simular que esos libros ya existen y ofrecer un resumen, un comentario. Borges, Ficciones Acknowledgements First, I would like to thank my advisor, professor Francisco Santos. He has been supportive years before I arrived in Santander, and even more when I arrived. Also, I want to thank professor Michael Joswig and his team in the discrete ge- ometry group of the Technical University of Berlin, for all the help and advice that they provided during my (short) visit to their department. Finally, I want to thank my friends at Cantabria, and my “disciples”: Álvaro, Ana, Beatriz, Cristina, David, Esther, Jesús, Jon, Manu, Néstor, Sara and Susana. i Diameter of simplicial complexes, a computational approach Abstract The computational complexity of the simplex method, widely used for linear program- ming, depends on the combinatorial diameter of the edge graph of a polyhedron with n facets and dimension d. Despite its popularity, little is known about the (combinatorial) diameter of polytopes, and even for simpler types of complexes. For the case of polytopes, it was conjectured by Hirsch (1957) that the diameter is smaller than (n − d), but this was disproved by Francisco Santos (2010).
  • Conjugate Convex Functions in Topological Vector Spaces

    Conjugate Convex Functions in Topological Vector Spaces

    Matematisk-fysiske Meddelelser udgivet af Det Kongelige Danske Videnskabernes Selskab Bind 34, nr. 2 Mat. Fys. Medd . Dan. Vid. Selsk. 34, no. 2 (1964) CONJUGATE CONVEX FUNCTIONS IN TOPOLOGICAL VECTOR SPACES BY ARNE BRØNDSTE D København 1964 Kommissionær : Ejnar Munksgaard Synopsis Continuing investigations by W. L . JONES (Thesis, Columbia University , 1960), the theory of conjugate convex functions in finite-dimensional Euclidea n spaces, as developed by W. FENCHEL (Canadian J . Math . 1 (1949) and Lecture No- tes, Princeton University, 1953), is generalized to functions in locally convex to- pological vector spaces . PRINTP_ll IN DENMARK BIANCO LUNOS BOGTRYKKERI A-S Introduction The purpose of the present paper is to generalize the theory of conjugat e convex functions in finite-dimensional Euclidean spaces, as initiated b y Z . BIRNBAUM and W. ORLICz [1] and S . MANDELBROJT [8] and developed by W. FENCHEL [3], [4] (cf. also S. KARLIN [6]), to infinite-dimensional spaces . To a certain extent this has been done previously by W . L . JONES in his Thesis [5] . His principal results concerning the conjugates of real function s in topological vector spaces have been included here with some improve- ments and simplified proofs (Section 3). After the present paper had bee n written, the author ' s attention was called to papers by J . J . MOREAU [9], [10] , [11] in which, by a different approach and independently of JONES, result s equivalent to many of those contained in this paper (Sections 3 and 4) are obtained. Section 1 contains a summary, based on [7], of notions and results fro m the theory of topological vector spaces applied in the following .
  • Combinatorial Characterizations of K-Matrices

    Combinatorial Characterizations of K-Matrices

    Combinatorial Characterizations of K-matricesa Jan Foniokbc Komei Fukudabde Lorenz Klausbf October 29, 2018 We present a number of combinatorial characterizations of K-matrices. This extends a theorem of Fiedler and Pt´ak on linear-algebraic character- izations of K-matrices to the setting of oriented matroids. Our proof is elementary and simplifies the original proof substantially by exploiting the duality of oriented matroids. As an application, we show that a simple principal pivot method applied to the linear complementarity problems with K-matrices converges very quickly, by a purely combinatorial argument. Key words: P-matrix, K-matrix, oriented matroid, linear complementarity 2010 MSC: 15B48, 52C40, 90C33 1 Introduction A matrix M ∈ Rn×n is a P-matrix if all its principal minors (determinants of principal submatrices) are positive; it is a Z-matrix if all its off-diagonal elements are non-positive; and it is a K-matrix if it is both a P-matrix and a Z-matrix. Z- and K-matrices often occur in a wide variety of areas such as input–output produc- tion and growth models in economics, finite difference methods for partial differential equations, Markov processes in probability and statistics, and linear complementarity problems in operations research [2]. In 1962, Fiedler and Pt´ak [9] listed thirteen equivalent conditions for a Z-matrix to be a K-matrix. Some of them concern the sign structure of vectors: arXiv:0911.2171v3 [math.OC] 3 Aug 2010 a This research was partially supported by the project ‘A Fresh Look at the Complexity of Pivoting in Linear Complementarity’ no.
  • An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function

    An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function

    Journal of Convex Analysis Volume 3 (1996), No.1, 63{70 An Asymptotical Variational Principle Associated with the Steepest Descent Method for a Convex Function B. Lemaire Universit´e Montpellier II, Place E. Bataillon, 34095 Montpellier Cedex 5, France. e-mail:[email protected] Received July 5, 1994 Revised manuscript received January 22, 1996 Dedicated to R. T. Rockafellar on his 60th Birthday The asymptotical limit of the trajectory defined by the continuous steepest descent method for a proper closed convex function f on a Hilbert space is characterized in the set of minimizers of f via an asymp- totical variational principle of Brezis-Ekeland type. The implicit discrete analogue (prox method) is also considered. Keywords : Asymptotical, convex minimization, differential inclusion, prox method, steepest descent, variational principle. 1991 Mathematics Subject Classification: 65K10, 49M10, 90C25. 1. Introduction Let X be a real Hilbert space endowed with inner product :; : and associated norm : , and let f be a proper closed convex function on X. h i k k The paper considers the problem of minimizing f, that is, of finding infX f and some element in the optimal set S := Argmin f, this set assumed being non empty. Letting @f denote the subdifferential operator associated with f, we focus on the contin- uous steepest descent method associated with f, i.e., the differential inclusion du @f(u); t > 0 − dt 2 with initial condition u(0) = u0: This method is known to yield convergence under broad conditions summarized in the following theorem. Let us denote by the real vector space of continuous functions from [0; + [ into X that are absolutely conAtinuous on [δ; + [ for all δ > 0.
  • Report on 8Th EUROPT Workshop on Advances in Continuous

    Report on 8Th EUROPT Workshop on Advances in Continuous

    8th EUROPT Workshop on Advances in Continuous Optimization Aveiro, Portugal, July 9-10, 2010 Final Report The 8th EUROPT Workshop on Advances in Continuous Optimization was hosted by the Univer- sity of Aveiro, Portugal. Workshop started with a Welcome Reception of the participants on July 8, fol- lowed by two working days, July 9 and July 10. This Workshop continued the line of the past EUROPT workshops. The first one was held in 2000 in Budapest, followed by the workshops in Rotterdam in 2001, Istanbul in 2003, Rhodes in 2004, Reykjavik in 2006, Prague in 2007, and Remagen in 2009. All these international workshops were organized by the EURO Working Group on Continuous Optimization (EUROPT; http://www.iam.metu.edu.tr/EUROPT) as a satellite meeting of the EURO Conferences. This time, the 8th EUROPT Workshop, was a satellite meeting before the EURO XXIV Conference in Lisbon, (http://www.euro2010lisbon.org/). During the 8th EUROPT Workshop, the organizational duties were distributed between a Scientific Committee, an Organizing Committee, and a Local Committee. • The Scientific Committee was composed by Marco Lopez (Chair), Universidad de Alicante; Domin- gos Cardoso, Universidade de Aveiro; Emilio Carrizosa, Universidad de Sevilla; Joaquim Judice, Uni- versidade de Coimbra; Diethard Klatte, Universitat Zurich; Olga Kostyukova, Belarusian Academy of Sciences; Marco Locatelli, Universita’ di Torino; Florian Potra, University of Maryland Baltimore County; Franz Rendl, Universitat Klagenfurt; Claudia Sagastizabal, CEPEL (Research Center for Electric Energy); Oliver Stein, Karlsruhe Institute of Technology; Georg Still, University of Twente. • The Organizing Committee was composed by Domingos Cardoso (Chair), Universidade de Aveiro; Tatiana Tchemisova (co-Chair), Universidade de Aveiro; Miguel Anjos, University of Waterloo; Edite Fernandes, Universidade do Minho; Vicente Novo, UNED (Spain); Juan Parra, Universidad Miguel Hernandez´ de Elche; Gerhard-Wilhelm Weber, Middle East Technical University.
  • Arxiv:Math/9906062V1 [Math.MG] 10 Jun 1999 Udo Udmna Eerh(Rn 96-01-00166)

    Arxiv:Math/9906062V1 [Math.MG] 10 Jun 1999 Udo Udmna Eerh(Rn 96-01-00166)

    Embedding the graphs of regular tilings and star-honeycombs into the graphs of hypercubes and cubic lattices ∗ Michel DEZA CNRS and Ecole Normale Sup´erieure, Paris, France Mikhail SHTOGRIN Steklov Mathematical Institute, 117966 Moscow GSP-1, Russia Abstract We review the regular tilings of d-sphere, Euclidean d-space, hyperbolic d-space and Coxeter’s regular hyperbolic honeycombs (with infinite or star-shaped cells or vertex figures) with respect of possible embedding, isometric up to a scale, of their skeletons into a m-cube or m-dimensional cubic lattice. In section 2 the last remaining 2-dimensional case is decided: for any odd m ≥ 7, star-honeycombs m m {m, 2 } are embeddable while { 2 ,m} are not (unique case of non-embedding for dimension 2). As a spherical analogue of those honeycombs, we enumerate, in section 3, 36 Riemann surfaces representing all nine regular polyhedra on the sphere. In section 4, non-embeddability of all remaining star-honeycombs (on 3-sphere and hyperbolic 4-space) is proved. In the last section 5, all cases of embedding for dimension d> 2 are identified. Besides hyper-simplices and hyper-octahedra, they are exactly those with bipartite skeleton: hyper-cubes, cubic lattices and 8, 2, 1 tilings of hyperbolic 3-, 4-, 5-space (only two, {4, 3, 5} and {4, 3, 3, 5}, of those 11 have compact both, facets and vertex figures). 1 Introduction arXiv:math/9906062v1 [math.MG] 10 Jun 1999 We say that given tiling (or honeycomb) T has a l1-graph and embeds up to scale λ into m-cube Hm (or, if the graph is infinite, into cubic lattice Zm ), if there exists a mapping f of the vertex-set of the skeleton graph of T into the vertex-set of Hm (or Zm) such that λdT (vi, vj)= ||f(vi), f(vj)||l1 = X |fk(vi) − fk(vj)| for all vertices vi, vj, 1≤k≤m ∗This work was supported by the Volkswagen-Stiftung (RiP-program at Oberwolfach) and Russian fund of fundamental research (grant 96-01-00166).
  • Polyhedral Combinatorics, Complexity & Algorithms

    Polyhedral Combinatorics, Complexity & Algorithms

    POLYHEDRAL COMBINATORICS, COMPLEXITY & ALGORITHMS FOR k-CLUBS IN GRAPHS By FOAD MAHDAVI PAJOUH Bachelor of Science in Industrial Engineering Sharif University of Technology Tehran, Iran 2004 Master of Science in Industrial Engineering Tarbiat Modares University Tehran, Iran 2006 Submitted to the Faculty of the Graduate College of Oklahoma State University in partial fulfillment of the requirements for the Degree of DOCTOR OF PHILOSOPHY July, 2012 COPYRIGHT c By FOAD MAHDAVI PAJOUH July, 2012 POLYHEDRAL COMBINATORICS, COMPLEXITY & ALGORITHMS FOR k-CLUBS IN GRAPHS Dissertation Approved: Dr. Balabhaskar Balasundaram Dissertation Advisor Dr. Ricki Ingalls Dr. Manjunath Kamath Dr. Ramesh Sharda Dr. Sheryl Tucker Dean of the Graduate College iii Dedicated to my parents iv ACKNOWLEDGMENTS I would like to wholeheartedly express my sincere gratitude to my advisor, Dr. Balabhaskar Balasundaram, for his continuous support of my Ph.D. study, for his patience, enthusiasm, motivation, and valuable knowledge. It has been a great honor for me to be his first Ph.D. student and I could not have imagined having a better advisor for my Ph.D. research and role model for my future academic career. He has not only been a great mentor during the course of my Ph.D. and professional development but also a real friend and colleague. I hope that I can in turn pass on the research values and the dreams that he has given to me, to my future students. I wish to express my warm and sincere thanks to my wonderful committee mem- bers, Dr. Ricki Ingalls, Dr. Manjunath Kamath and Dr. Ramesh Sharda for their support, guidance and helpful suggestions throughout my Ph.D.