Configurations Between Geometry and Combinatorics

Total Page:16

File Type:pdf, Size:1020Kb

Configurations Between Geometry and Combinatorics CORE Metadata, citation and similar papers at core.ac.uk Provided by Elsevier - Publisher Connector Discrete Applied Mathematics 138 (2004) 79–88 www.elsevier.com/locate/dam Conÿgurations between geometry and combinatorics Harald Gropp Universitat Heidelberg, Muhlingstr. 19, D-69121 Heidelberg, Germany Received 1 November 2000; received in revised form 24 January 2003; accepted 27 February 2003 Abstract The combinatorial structure conÿguration which was already deÿned as early as 1876 is the topic of this paper. In their early years conÿgurations were regarded to be ÿnite geometrical substructures of the plane. The best example is the wrong picture of a conÿguration 103 by Kantor. However, before 1890 conÿgurations were already established as purely combinatorial structures. In the 20th century the problem of realization of conÿgurations over ÿelds and of drawing of conÿgurations in the real plane has been investigated. ? 2003 Elsevier B.V. All rights reserved. Keywords: Conÿguration; Geometry; Realization; Drawing 1. Introduction The word “conÿguration” is quite often used in mathematics, in particular in com- binatorics, as a synonym for substructure. However, it is a well-deÿned combinatorial structure like a graph or design. Moreover, it is indeed one of the oldest combinatorial structures, deÿned already in a geometrical context in 1876. A modern deÿnition is as follows. Deÿnition 1.1. A conÿguration (vr;bk ) is a ÿnite incidence structure of v points and b lines such that (i) there are k points on each line and r lines through each point, and (ii) there is at most one line through two given points. E-mail address: [email protected] (H. Gropp). 0166-218X/$ - see front matter ? 2003 Elsevier B.V. All rights reserved. doi:10.1016/S0166-218X(03)00271-3 80 H. Gropp / Discrete Applied Mathematics 138 (2004) 79–88 For further information see [9]; there are only two other books which contain infor- mation on conÿgurations [16,18], the former was reprinted recently. In this paper the development of conÿgurations which were born in geometry during the last 125 years is described and discussed. Section 2 describes the early years of conÿgurations and the conFict between their geometrical and combinatorial properties, represented by the wrong picture of Kantor. The breakthrough of Martinetti (see Section 3) opened the research of conÿgurations as purely combinatorial objects. However, the old geometrical origin of conÿgurations again occurs in the modern realization and drawing problems of our century (Section 4). The ÿrst part (Sections 2 and 3) contains several citations from original papers of the last century which are not so easily available today in order to enable the reader to follow the development from geometry to combinatorics. For further information see [5,11]. There is also a paper [15] in the German language which more explicitly describes the situation in StraHburg after 1871 as well as the possible connection of conÿgurations to Hilbert’s Grundlagen der Geometrie of 1899. The topic of Section 4 is discussed in more detail in [12,13] which contain further theoretical background, many references, and several drawings of conÿgurations. 2. Conÿgurations born in geometry 2.1. The book “Geometrie der Lage” The word conÿguration in the above sense was used in Theodor Reye’s book Geometrie der Lage for the ÿrst time. In the second edition of his book of 1876 [21] Reye mentioned conÿgurations as mathematical objects in their own right as gen- eralizations of the Desargues conÿguration 103. Von SJatzen uberJ das Dreieck will ich nur den folgenden nennen: Liegen zwei Dreiecke ABC und A1B1C1 so (Fig. 3), daH die Verbindungslinien AA1, BB1 und CC1 gleichnamiger Eckpunkte sich in einem und demselben Punkte S schneiden, so begegnen sich die gleichnamigen Seiten AB und A1B1, BC und B1C1, CA und C1A1 in drei Punkten C2, A2, B2 einer Geraden, und umgekehrt. The above citation in the ÿrst edition of Reye’s book describes the theorem of Desargues. In the second edition of 1876 the following sentence is included. Die den Satz erlJauternde Figur verdient Beachtung als ReprJasentant einer Gattung von merkwurdigen,J durch eine gewisse RegelmJassigkeit ausgezeichneten Conÿgu- rationen. Sie besteht aus 10 Punkten und 10 Geraden; auf jeder der Geraden liegen drei von den 10 Punkten, und durch jeden dieser Punkte gehen drei von den 10 Geraden. Here Reye describes the ÿgure related to the above theorem (which is the conÿgura- tion of Desargues) as the representative of a certain family of conÿgurations consisting H. Gropp / Discrete Applied Mathematics 138 (2004) 79–88 81 of 10 points and 10 lines such that there are three points on each line and three lines through each point. 2.2. Some biographical remarks Since most of the mathematicians who are involved in the research of conÿgurations do not belong to the well-known ones in the following there are some short biographical notes on some of them. Theodor Reye was born in RitzebuttelJ near Cuxhaven in 1838, was a professor of mathematics in Zurich,J Aachen, and (after 1872) in StraHburg, and died in WurzburgJ in 1919. Reye started his research in applied mathematics and physics. In ZurichJ he turned his interests towards geometry. Seligmann Kantor was born in Soborten near Teplitz (now Teplice in the Czech Republic) in 1857, studied in Wien, Roma, StraHburg, and Paris, and became a Pri- vatdocent in Praha in 1881. In 1886 he left academic life and lived in Italy. Vittorio Martinetti was born in Scorzalo near Mantova in 1859, became a professor of mathematics at the university of Messina in 1887, and died in Milano in 1936. Heinrich Eduard SchrJoter was born in KJonigsberg (now Kaliningrad in Russia) in 1829, studied in Berlin and KJonigsberg, became a professor in Breslau (now Wroc law in Poland) in 1858, and died in Breslau in 1892. 2.3. The ÿrst constructions and the “wrong” picture A few years later a formal deÿnition for conÿgurations ni was given in [22]. Eine Conÿguration ni in der Ebene besteht aus n Punkten und n Geraden in solcher Lage, dass jede der n Geraden i von den n Punkten enthJalt und durch jeden der n Punkte i von den n Geraden gehen. Reye still discusses conÿgurations as ÿnite geometrical substructures of the plane. This becomes totally clear when he discusses the existence problem of conÿgurations n3 for small values of n as follows. Reelle Conÿgurationen 83 existiren nicht; dagegen hat Herr S. Kantor drei ver- schiedenartige Conÿgurationen 93 und zehn verschiedene 103 nachgewiesen. In the case of conÿgurations 83 Reye remarks that there are no real conÿgurations. In fact, there is a unique conÿguration 83, however, not realizable over the real numbers. He mentions a result of Kantor that there are three diPerent conÿgurations 93 and ten diPerent conÿgurations 103. In the same paper Reye describes the “problem of conÿgurations” that is, of ÿnding all diPerent conÿgurations ni for given numbers n and i and discussing their properties as follows. Das Problem der Conÿgurationen nun verlangt, daH alle verschiedenartigen, zu den Zahlen n und i gehJorigen Conÿgurationen ni ermittelt und daH ihre wichtigsten Eigenschaften aufgesucht werden. 82 H. Gropp / Discrete Applied Mathematics 138 (2004) 79–88 Fig. 1. This deÿnition corresponds to the situation where v=b=n, i.e. the number of points is equal to the number of lines. In the plane the axiom that through two distinct points there is at most one line is automatically fulÿlled. Indeed, 1 year earlier already Kantor [17] had constructed all 10 conÿgurations 103. These are combinatorial structures having the same parameters as the Desargues conÿguration but are pairwise nonisomorphic. Although the constructions of Kantor are done from a combinatorial point of view and the geometrical aspect is not touched at all in his paper, at the end of the journal 10 drawings of these 10 conÿgurations in the plane are included. However, one of these drawings (see Fig. 1) is wrong (one line consists of two straight segments not forming an angle of 180◦). A few years later it was proved by SchrJoter (see below) for the ÿrst time that exactly one of these 10 conÿgurations cannot be drawn in the plane. However, it seems that to Kantor it was not clear whether there is a diPerence between the combinatorial and the geometrical aspect of a conÿguration. In his paper Kantor announces the construction of all conÿgurations 103 and 113.He does not use Reye’s notation which is now standard; as far as it is known the further paper on conÿgurations 113 of Kantor never appeared. In dieser und einer folgenden Abhandlung werde ich die sJammtlichen mJoglichen Formen der ebenen Conÿgurationen (3,3) aus 10, respective 11 Geraden und Punk- ten geben. ..... Es wird sich im Verlaufe unserer Raisonnements ergeben, daH es 10 essentiell verschiedene Gestalten der (3; 3)10 gibt, von denen bisher uberhauptJ nur eine bekannt war. To summarize these ÿrst years the diPerence between conÿgurations realized or drawn in real geometry and conÿgurations as purely combinatorial structures seems to H. Gropp / Discrete Applied Mathematics 138 (2004) 79–88 83 be unknown. Apparently even Reye thinks that there are 10 diPerent conÿgurations 103 in the real plane. 3. Conÿgurations as combinatorial structures It is not clear whether Reye remained interested in conÿgurations in the years which followed. Kantor left academic life and moved to Italy as mentioned above. The interest in conÿgurations moved to Breslau in Germany and to Italy. 3.1. The breakthrough of Martinetti Already a few years later, at the latest in Martinetti’s paper of 1887 [19], it is clear that conÿgurations are only considered from a combinatorial point of view. Mar- tinetti ÿnds a recursive construction method to construct all conÿgurations n3 if all conÿgurations (n − 1)3 are known and by using his method constructs all 31 con- ÿgurations 113.
Recommended publications
  • Robot Vision: Projective Geometry
    Robot Vision: Projective Geometry Ass.Prof. Friedrich Fraundorfer SS 2018 1 Learning goals . Understand homogeneous coordinates . Understand points, line, plane parameters and interpret them geometrically . Understand point, line, plane interactions geometrically . Analytical calculations with lines, points and planes . Understand the difference between Euclidean and projective space . Understand the properties of parallel lines and planes in projective space . Understand the concept of the line and plane at infinity 2 Outline . 1D projective geometry . 2D projective geometry ▫ Homogeneous coordinates ▫ Points, Lines ▫ Duality . 3D projective geometry ▫ Points, Lines, Planes ▫ Duality ▫ Plane at infinity 3 Literature . Multiple View Geometry in Computer Vision. Richard Hartley and Andrew Zisserman. Cambridge University Press, March 2004. Mundy, J.L. and Zisserman, A., Geometric Invariance in Computer Vision, Appendix: Projective Geometry for Machine Vision, MIT Press, Cambridge, MA, 1992 . Available online: www.cs.cmu.edu/~ph/869/papers/zisser-mundy.pdf 4 Motivation – Image formation [Source: Charles Gunn] 5 Motivation – Parallel lines [Source: Flickr] 6 Motivation – Epipolar constraint X world point epipolar plane x x’ x‘TEx=0 C T C’ R 7 Euclidean geometry vs. projective geometry Definitions: . Geometry is the teaching of points, lines, planes and their relationships and properties (angles) . Geometries are defined based on invariances (what is changing if you transform a configuration of points, lines etc.) . Geometric transformations
    [Show full text]
  • COMBINATORICS, Volume
    http://dx.doi.org/10.1090/pspum/019 PROCEEDINGS OF SYMPOSIA IN PURE MATHEMATICS Volume XIX COMBINATORICS AMERICAN MATHEMATICAL SOCIETY Providence, Rhode Island 1971 Proceedings of the Symposium in Pure Mathematics of the American Mathematical Society Held at the University of California Los Angeles, California March 21-22, 1968 Prepared by the American Mathematical Society under National Science Foundation Grant GP-8436 Edited by Theodore S. Motzkin AMS 1970 Subject Classifications Primary 05Axx, 05Bxx, 05Cxx, 10-XX, 15-XX, 50-XX Secondary 04A20, 05A05, 05A17, 05A20, 05B05, 05B15, 05B20, 05B25, 05B30, 05C15, 05C99, 06A05, 10A45, 10C05, 14-XX, 20Bxx, 20Fxx, 50A20, 55C05, 55J05, 94A20 International Standard Book Number 0-8218-1419-2 Library of Congress Catalog Number 74-153879 Copyright © 1971 by the American Mathematical Society Printed in the United States of America All rights reserved except those granted to the United States Government May not be produced in any form without permission of the publishers Leo Moser (1921-1970) was active and productive in various aspects of combin• atorics and of its applications to number theory. He was in close contact with those with whom he had common interests: we will remember his sparkling wit, the universality of his anecdotes, and his stimulating presence. This volume, much of whose content he had enjoyed and appreciated, and which contains the re• construction of a contribution by him, is dedicated to his memory. CONTENTS Preface vii Modular Forms on Noncongruence Subgroups BY A. O. L. ATKIN AND H. P. F. SWINNERTON-DYER 1 Selfconjugate Tetrahedra with Respect to the Hermitian Variety xl+xl + *l + ;cg = 0 in PG(3, 22) and a Representation of PG(3, 3) BY R.
    [Show full text]
  • Performance Evaluation of Genetic Algorithm and Simulated Annealing in Solving Kirkman Schoolgirl Problem
    FUOYE Journal of Engineering and Technology (FUOYEJET), Vol. 5, Issue 2, September 2020 ISSN: 2579-0625 (Online), 2579-0617 (Paper) Performance Evaluation of Genetic Algorithm and Simulated Annealing in solving Kirkman Schoolgirl Problem *1Christopher A. Oyeleye, 2Victoria O. Dayo-Ajayi, 3Emmanuel Abiodun and 4Alabi O. Bello 1Department of Information Systems, Ladoke Akintola University of Technology, Ogbomoso, Nigeria 2Department of Computer Science, Ladoke Akintola University of Technology, Ogbomoso, Nigeria 3Department of Computer Science, Kwara State Polytechnic, Ilorin, Nigeria 4Department of Mathematical and Physical Sciences, Afe Babalola University, Ado-Ekiti, Nigeria [email protected]|[email protected]|[email protected]|[email protected] Received: 15-FEB-2020; Reviewed: 12-MAR-2020; Accepted: 28-MAY-2020 http://dx.doi.org/10.46792/fuoyejet.v5i2.477 Abstract- This paper provides performance evaluation of Genetic Algorithm and Simulated Annealing in view of their software complexity and simulation runtime. Kirkman Schoolgirl is about arranging fifteen schoolgirls into five triplets in a week with a distinct constraint of no two schoolgirl must walk together in a week. The developed model was simulated using MATLAB version R2015a. The performance evaluation of both Genetic Algorithm (GA) and Simulated Annealing (SA) was carried out in terms of program size, program volume, program effort and the intelligent content of the program. The results obtained show that the runtime for GA and SA are 11.23sec and 6.20sec respectively. The program size for GA and SA are 2.01kb and 2.21kb, respectively. The lines of code for GA and SA are 324 and 404, respectively. The program volume for GA and SA are 1121.58 and 3127.92, respectively.
    [Show full text]
  • Blocking Set Free Configurations and Their Relations to Digraphs and Hypergraphs
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE provided by Elsevier - Publisher Connector DISCRETE MATHEMATICS ELSIZI’IER Discrete Mathematics 1651166 (1997) 359.-370 Blocking set free configurations and their relations to digraphs and hypergraphs Harald Gropp* Mihlingstrasse 19. D-69121 Heidelberg, German> Abstract The current state of knowledge concerning the existence of blocking set free configurations is given together with a short history of this problem which has also been dealt with in terms of digraphs without even dicycles or 3-chromatic hypergraphs. The question is extended to the case of nonsymmetric configurations (u,, b3). It is proved that for each value of I > 3 there are only finitely many values of u for which the existence of a blocking set free configuration is still unknown. 1. Introduction In the language of configurations the existence of blocking sets was investigated in [3, 93 for the first time. Further papers [4, 201 yielded the result that the existence problem for blocking set free configurations v3 has been nearly solved. There are only 8 values of v for which it is unsettled whether there is a blocking set free configuration ~7~:u = 15,16,17,18,20,23,24,26. The existence of blocking set free configurations is equivalent to the existence of certain hypergraphs and digraphs. In these two languages results have been obtained much earlier. In Section 2 the relations between configurations, hypergraphs, and digraphs are exhibited. Furthermore, a nearly forgotten result of Steinitz is described In his dissertation of 1894 Steinitz proved the existence of a l-factor in a regular bipartite graph 20 years earlier then Kiinig.
    [Show full text]
  • Self-Dual Configurations and Regular Graphs
    SELF-DUAL CONFIGURATIONS AND REGULAR GRAPHS H. S. M. COXETER 1. Introduction. A configuration (mci ni) is a set of m points and n lines in a plane, with d of the points on each line and c of the lines through each point; thus cm = dn. Those permutations which pre­ serve incidences form a group, "the group of the configuration." If m — n, and consequently c = d, the group may include not only sym­ metries which permute the points among themselves but also reci­ procities which interchange points and lines in accordance with the principle of duality. The configuration is then "self-dual," and its symbol («<*, n<j) is conveniently abbreviated to na. We shall use the same symbol for the analogous concept of a configuration in three dimensions, consisting of n points lying by d's in n planes, d through each point. With any configuration we can associate a diagram called the Menger graph [13, p. 28],x in which the points are represented by dots or "nodes," two of which are joined by an arc or "branch" when­ ever the corresponding two points are on a line of the configuration. Unfortunately, however, it often happens that two different con­ figurations have the same Menger graph. The present address is concerned with another kind of diagram, which represents the con­ figuration uniquely. In this Levi graph [32, p. 5], we represent the points and lines (or planes) of the configuration by dots of two colors, say "red nodes" and "blue nodes," with the rule that two nodes differently colored are joined whenever the corresponding elements of the configuration are incident.
    [Show full text]
  • Geometry and Dynamics of Configuration Spaces Mickaël Kourganoff
    Geometry and dynamics of configuration spaces Mickaël Kourganoff To cite this version: Mickaël Kourganoff. Geometry and dynamics of configuration spaces. Differential Geometry [math.DG]. Ecole normale supérieure de lyon - ENS LYON, 2015. English. NNT : 2015ENSL1049. tel-01250817 HAL Id: tel-01250817 https://tel.archives-ouvertes.fr/tel-01250817 Submitted on 5 Jan 2016 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. These` en vue de l’obtention du grade de Docteur de l’Universit´ede Lyon, d´elivr´epar l’Ecole´ Normale Sup´erieurede Lyon Discipline : Math´ematiques pr´esent´eeet soutenue publiquement le 4 d´ecembre 2015 par Micka¨el Kourganoff G´eom´etrieet dynamique des espaces de configuration Directeur de th`ese: Abdelghani Zeghib Devant la commission d’examen form´eede : Viviane Baladi (Universit´ePierre et Marie Curie, Paris), examinatrice Thierry Barbot (Universit´ed’Avignon), rapporteur G´erard Besson (Universit´ede Grenoble), examinateur Etienne´ Ghys( Ecole´ Normale Sup´erieure de Lyon), examinateur Boris Hasselblatt (Tufts University), rapporteur Mark Pollicott (University of Warwick), rapporteur BrunoS evennec´ ( Ecole´ Normale Sup´erieure de Lyon), examinateur Abdelghani Zeghib( Ecole´ Normale Sup´erieure de Lyon), directeur Unit´ede Math´ematiques Pures et Appliqu´ees– Ecole´ doctorale InfoMaths 2 Remerciements Mes premiers remerciements vont `aGhani, qui m’a fait d´ecouvrir un sujet passionnant, riche et original, et m’a laiss´eune grande libert´e,tout en sachant s’impliquer dans le d´etaild`esque n´ecessaire.
    [Show full text]
  • Intel® MAX® 10 FPGA Configuration User Guide
    Intel® MAX® 10 FPGA Configuration User Guide Subscribe UG-M10CONFIG | 2021.07.02 Send Feedback Latest document on the web: PDF | HTML Contents Contents 1. Intel® MAX® 10 FPGA Configuration Overview................................................................ 4 2. Intel MAX 10 FPGA Configuration Schemes and Features...............................................5 2.1. Configuration Schemes..........................................................................................5 2.1.1. JTAG Configuration.................................................................................... 5 2.1.2. Internal Configuration................................................................................ 6 2.2. Configuration Features.........................................................................................13 2.2.1. Remote System Upgrade...........................................................................13 2.2.2. Configuration Design Security....................................................................20 2.2.3. SEU Mitigation and Configuration Error Detection........................................ 24 2.2.4. Configuration Data Compression................................................................ 27 2.3. Configuration Details............................................................................................ 28 2.3.1. Configuration Sequence............................................................................ 28 2.3.2. Intel MAX 10 Configuration Pins................................................................
    [Show full text]
  • 21 TOPOLOGICAL METHODS in DISCRETE GEOMETRY Rade T
    21 TOPOLOGICAL METHODS IN DISCRETE GEOMETRY Rade T. Zivaljevi´cˇ INTRODUCTION A problem is solved or some other goal achieved by “topological methods” if in our arguments we appeal to the “form,” the “shape,” the “global” rather than “local” structure of the object or configuration space associated with the phenomenon we are interested in. This configuration space is typically a manifold or a simplicial complex. The global properties of the configuration space are usually expressed in terms of its homology and homotopy groups, which capture the idea of the higher (dis)connectivity of a geometric object and to some extent provide “an analysis properly geometric or linear that expresses location directly as algebra expresses magnitude.”1 Thesis: Any global effect that depends on the object as a whole and that cannot be localized is of homological nature, and should be amenable to topological methods. HOW IS TOPOLOGY APPLIED IN DISCRETE GEOMETRIC PROBLEMS? In this chapter we put some emphasis on the role of equivariant topological methods in solving combinatorial or discrete geometric problems that have proven to be of relevance for computational geometry and topological combinatorics and with some impact on computational mathematics in general. The versatile configuration space/test map scheme (CS/TM) was developed in numerous research papers over the years and formally codified in [Ziv98].ˇ Its essential features are summarized as follows: CS/TM-1: The problem is rephrased in topological terms. The problem should give us a clue how to define a “natural” configuration space X and how to rephrase the question in terms of zeros or coincidences of the associated test maps.
    [Show full text]
  • Arxiv:1712.00299V1 [Math.GT]
    POLYGONS WITH PRESCRIBED EDGE SLOPES: CONFIGURATION SPACE AND EXTREMAL POINTS OF PERIMETER JOSEPH GORDON, GAIANE PANINA, YANA TEPLITSKAYA Abstract. We describe the configuration space S of polygons with pre- scribed edge slopes, and study the perimeter as a Morse function on S. We characterize critical points of (these areP tangential polygons) and compute their Morse indices. ThisP setup is motivated by a number of re- sults about critical points and Morse indices of the oriented area function defined on the configuration space of polygons with prescribed edge lengths (flexible polygons). As a by-product, we present an independent computa- tion of the Morse index of the area function (obtained earlier by G. Panina and A. Zhukova). 1. Introduction Consider the space L of planar polygons with prescribed edge lengths1 and the oriented area as a Morse function defined on it. It is known that gener- ically: A L is a smooth closed manifold whose diffeomorphic type depends on • the edge lengths [1, 2]. The oriented area is a Morse function whose critical points are cyclic • configurations (thatA is, polygons with all the vertices lying on a cir- cle), whose Morse indices are known, see Theorem 2, [3, 5, 6]. The Morse index depends not only on the combinatorics of a cyclic poly- arXiv:1712.00299v1 [math.GT] 1 Dec 2017 gon, but also on some metric data. Direct computations of the Morse index proved to be quite involved, so the existing proof comes from bifurcation analysis combined with a number of combinatorial tricks. Bifurcations of are captured by cyclic polygons P whose dual poly- • gons P ∗ have zeroA perimeter [5]; see also Lemma 4.
    [Show full text]
  • Cyclone III Device Handbook Volume 1. Chapter 9. Configuration
    9. Configuration, Design Security, and Remote System Upgrades in the August 2012 CIII51016-2.2 Cyclone III Device Family CIII51016-2.2 This chapter describes the configuration, design security, and remote system upgrades in Cyclone® III devices. The Cyclone III device family (Cyclone III and Cyclone III LS devices) uses SRAM cells to store configuration data. Configuration data must be downloaded to Cyclone III device family each time the device powers up because SRAM memory is volatile. The Cyclone III device family is configured using one of the following configuration schemes: ■ Fast Active serial (AS) ■ Active parallel (AP) for Cyclone III devices only ■ Passive serial (PS) ■ Fast passive parallel (FPP) ■ Joint Test Action Group (JTAG) All configuration schemes use an external configuration controller (for example, MAX® II devices or a microprocessor), a configuration device, or a download cable. The Cyclone III device family offers the following configuration features: ■ Configuration data decompression ■ Design security (for Cyclone III LS devices only) ■ Remote system upgrade As Cyclone III LS devices play a role in larger and more critical designs in competitive commercial and military environments, it is increasingly important to protect your designs from copying, reverse engineering, and tampering. Cyclone III LS devices address these concerns with 256-bit advanced encryption standard (AES) programming file encryption and anti-tamper feature support to prevent tampering. For more information about the design security feature in Cyclone III LS devices, refer to “Design Security” on page 9–70. System designers face difficult challenges such as shortened design cycles, evolving standards, and system deployments in remote locations.
    [Show full text]
  • Tur\'An's Theorem for the Fano Plane
    TURÁN’S THEOREM FOR THE FANO PLANE LOUIS BELLMANN AND CHRISTIAN REIHER Abstract. Confirming a conjecture of Vera T. Sós in a very strong sense, we give a complete solution to Turán’s hypergraph problem for the Fano plane. That is we prove for n ¥ 8 that among all 3-uniform hypergraphs on n vertices not containing the Fano plane there is indeed exactly one whose number of edges is maximal, namely the balanced, complete, bipartite hypergraph. Moreover, for n “ 7 there is exactly one other extremal configuration with the same number of edges: the hypergraph arising from a clique of order 7 by removing all five edges containing a fixed pair of vertices. For sufficiently large values n this was proved earlier by Füredi and Simonovits, and by Keevash and Sudakov, who utilised the stability method. §1. Introduction With his seminal work [22], Turán initiated extremal graph theory as a separate subarea of combinatorics. After proving his well known extremal result concerning graphs not containing a clique of fixed order, he proposed to study similar problems for graphs arising from platonic solids and for hypergraphs. For instance, given a 3-uniform hypergraph F and a natural number n, there arises the question to determine the largest number expn, F q of edges that a 3-uniform hypergraph H can have without containing F as a subhypergraph. Here a 3-uniform hypergraph H “ pV, Eq consists of a set V of vertices and a collec- tion E Ď V p3q “ te Ď V : |e| “ 3u of 3-element subsets of V , that are called the edges of H.
    [Show full text]
  • The Second Hull of a Knotted Curve
    The Second Hull of a Knotted Curve 1, 2, 3, 4, Jason Cantarella, ∗ Greg Kuperberg, y Robert B. Kusner, z and John M. Sullivan x 1Department of Mathematics, University of Georgia, Athens, GA 30602 2Department of Mathematics, University of California, Davis, CA 95616 3Department of Mathematics, University of Massachusetts, Amherst, MA 01003 4Department of Mathematics, University of Illinois, Urbana, IL 61801 (Dated: May 5, 2000; revised April 4, 2002) The convex hull of a set K in space consists of points which are, in a certain sense, “surrounded” by K. When K is a closed curve, we define its higher hulls, consisting of points which are “multiply surrounded” by the curve. Our main theorem shows that if a curve is knotted then it has a nonempty second hull. This provides a new proof of the Fary/Milnor´ theorem that every knotted curve has total curvature at least 4π. A space curve must loop around at least twice to become knotted. This intuitive idea was captured in the celebrated Fary/Milnor´ theorem, which says the total curvature of a knot- ted curve K is at least 4π. We prove a stronger result: that there is a certain region of space doubly enclosed, in a precise sense, by K. We call this region the second hull of K. The convex hull of a connected set K is characterized by the fact that every plane through a point in the hull must in- teresect K. If K is a closed curve, then a generic plane inter- sects K an even number of times, so the convex hull is the set of points through which every plane cuts K twice.
    [Show full text]