DOCSLIB.ORG

Structure and Classifications of Lattice Polytopes

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Structure and Classifications of Lattice Polytopes Structure and Classifications of Lattice Polytopes Andreas Paffenholz Technische Universität Darmstadt (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . I Why? . experimentation . obtain/test conjectures August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . I Why? . experimentation . obtain/test conjectures I How? . computational . enumerate complete subfamilies . PALP, polymake . Graded Rings Database, polymake database polyDB August 2, 2016 | TUD | Andreas Paffenholz | 1 (Classifications of) Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I Classifications of subfamilies . by dimension . number of (interior) lattice points . structural properties: . many vertices, h∗-vector, . I Why? . experimentation . obtain/test conjectures I How? . computational . structural . enumerate complete subfamilies . standard polytope constructions . PALP, polymake . projections, liftings . Graded Rings Database, . common properties polymake database polyDB . ... August 2, 2016 | TUD | Andreas Paffenholz | 1 Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z August 2, 2016 | TUD | Andreas Paffenholz | 2 Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I hyperplane description: d Q = f x j hai , xi ≤ bi g ai 2 Z primitive, bi 2 Z August 2, 2016 | TUD | Andreas Paffenholz | 2 Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I hyperplane description: d Q = f x j hai , xi ≤ bi g ai 2 Z primitive, bi 2 Z . assume irredundant: Each ai defines a facet Fi := fx 2 Q j hai , xi = bi g of Q August 2, 2016 | TUD | Andreas Paffenholz | 2 Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I hyperplane description: d Q = f x j hai , xi ≤ bi g ai 2 Z primitive, bi 2 Z . assume irredundant: Each ai defines a facet Fi := fx 2 Q j hai , xi = bi g of Q I normal fan of Q: d ∗ . fan Σ ⊆ (R ) with rays a1, ... , am . rays form cone σ if corresponding facets define face of Q August 2, 2016 | TUD | Andreas Paffenholz | 2 Lattice Polytopes d I lattice polytope: convex hull of finitely many points in Z d Q = conv(v1, ... , vn), vi 2 Z I hyperplane description: d Q = f x j hai , xi ≤ bi g ai 2 Z primitive, bi 2 Z . assume irredundant: Each ai defines a facet Fi := fx 2 Q j hai , xi = bi g of Q I normal fan of Q: d ∗ . fan Σ ⊆ (R ) with rays a1, ... , am . rays form cone σ if corresponding facets define face of Q I polar (dual) polytope: Q_ = f x j hx, vi ≤ 1 8v 2 Q g August 2, 2016 | TUD | Andreas Paffenholz | 2 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d 1 3 ehr (k) = k2 + k + 1 P 2 2 August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d 1 3 ehr (k) = k2 + k + 1 P 2 2 August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d 1 3 ehr (k) = k2 + k + 1 P 2 2 August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d ∗ ∗ X k h (t) h -polynomial of P: ehrP (k)t = I (1 − t)d+1 k≥0 1 3 ehr (k) = k2 + k + 1 P 2 2 August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d ∗ ∗ X k h (t) h -polynomial of P: ehrP (k)t = I (1 − t)d+1 k≥0 . h∗ has integral nonnegative coefficients ∗ ∗ ∗ ∗ . h -vector (h0, h1, ... , hd ) 1 3 ehr (k) = k2 + k + 1 P 2 2 August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d ∗ ∗ X k h (t) h -polynomial of P: ehrP (k)t = I (1 − t)d+1 k≥0 . h∗ has integral nonnegative coefficients ∗ ∗ ∗ ∗ . h -vector (h0, h1, ... , hd ) ∗ . h0 = 1 ∗ d . h1 = jP \ Z j − d − 1 ∗ d . hd = j int P \ Z j 1 3 ehr (k) = k2 + k + 1 P 2 2 August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d ∗ ∗ X k h (t) h -polynomial of P: ehrP (k)t = I (1 − t)d+1 k≥0 . h∗ has integral nonnegative coefficients ∗ ∗ ∗ ∗ . h -vector (h0, h1, ... , hd ) ∗ . h0 = 1 ∗ d . h1 = jP \ Z j − d − 1 ∗ d . hd = j int P \ Z j I lattice polytope Q with normal fan Σ ! 1 2 3 ehrP (k) = k + k + 1 projective toric variety XΣ 2 2 with ample divisior LP August 2, 2016 | TUD | Andreas Paffenholz | 3 Lattice Polytopes d . Ehrhart polynomial ehrP (k) := j k · P \ Z j polynomial of degree d ∗ ∗ X k h (t) h -polynomial of P: ehrP (k)t = I (1 − t)d+1 k≥0 . h∗ has integral nonnegative coefficients ∗ ∗ ∗ ∗ . h -vector (h0, h1, ... , hd ) ∗ . h0 = 1 ∗ d . h1 = jP \ Z j − d − 1 ∗ d . hd = j int P \ Z j I lattice polytope Q with normal fan Σ ! 1 2 3 ehrP (k) = k + k + 1 projective toric variety XΣ 2 2 with ample divisior LP . toric dictionary: properties of variety correpond to properties of polytope August 2, 2016 | TUD | Andreas Paffenholz | 3 Classification of Lattice Polytopes Classify or enumerate complete subfamilies of lattice polytopes August 2, 2016 | TUD | Andreas Paffenholz | 4 Classification of Lattice Polytopes Classify or enumerate complete subfamilies of lattice polytopes . by dimension . my number of (interior) lattice points . by properties of the polytopes . ... August 2, 2016 | TUD | Andreas Paffenholz | 4 Classification of Lattice Polytopes Classify or enumerate complete subfamilies of lattice polytopes . by dimension . my number of (interior) lattice points . by properties of the polytopes . ... Theorem (Hensley; Lagarias & Ziegler) d, m ≥ 1. Then there are, up to lattice equivalence, only finitely many d-dimensional lattice polytopes with m interior lattice points. lattice equivalence: d transformations with affine maps x 7−! Mx + t, M unimodular, t 2 Z . August 2, 2016 | TUD | Andreas Paffenholz | 4 Classification of Lattice Polytopes Classify or enumerate complete subfamilies of lattice polytopes . by dimension . my number of (interior) lattice points . by properties of the polytopes . ... Theorem (Hensley; Lagarias & Ziegler) d, m ≥ 1. Then there are, up to lattice equivalence, only finitely many d-dimensional lattice polytopes with m interior lattice points. lattice equivalence: d transformations with affine maps x 7−! Mx + t, M unimodular, t 2 Z . d ∗ I P empty polytope: int P \ Z = ? () hd = 0. August 2, 2016 | TUD | Andreas Paffenholz | 4 Classification of Lattice Polytopes Classify or enumerate complete subfamilies of lattice polytopes . by dimension . my number of (interior) lattice points . by properties of the polytopes . ... Theorem (Hensley; Lagarias & Ziegler) d, m ≥ 1. Then there are, up to lattice equivalence, only finitely many d-dimensional lattice polytopes with m interior lattice points. lattice equivalence: d transformations with affine maps x 7−! Mx + t, M unimodular, t 2 Z . d ∗ I P empty polytope: int P \ Z = ? () hd = 0. −! different approaches for classifications of empty polytopes and those with interior lattice points. August 2, 2016 | TUD | Andreas Paffenholz | 4 Empty Lattice Polytopes ∗ d ∗ I hd = j int P \ Z j, so hd = 0 iff P is empty −! empty polytopes are filtered by the degree of h∗ (number of trailing zeros in h∗) August 2, 2016 | TUD | Andreas Paffenholz | 5 Empty Lattice Polytopes ∗ d ∗ I hd = j int P \ Z j, so hd = 0 iff P is empty −! empty polytopes are filtered by the degree of h∗ (number of trailing zeros in h∗) −! known classifications for . polytopes for deg h∗ 2 f0, 1g . h∗-vectors for deg h∗ = 2 . h∗-vectors with few nonzero entries August 2, 2016 | TUD | Andreas Paffenholz | 5 Empty Lattice Polytopes ∗ d ∗ I hd = j int P \ Z j, so hd = 0 iff P is empty −! empty polytopes are filtered by the degree of h∗ (number of trailing zeros in h∗) −! known classifications for . polytopes for deg h∗ 2 f0, 1g . h∗-vectors for deg h∗ = 2 . h∗-vectors with few nonzero entries ∗ d . d + 1 − max(k j hk 6= 0) = min(k j int(kP) \ Z 6= ?) August 2, 2016 | TUD | Andreas Paffenholz | 5 Empty Lattice Polytopes ∗ d ∗ I hd = j int P \ Z j, so hd = 0 iff P is empty −! empty polytopes are filtered by the degree of h∗ (number of trailing zeros in h∗) −! known classifications for .
Load more

Recommended publications
  • Cellular Sheaf Cohomology in Polymake Arxiv:1612.09526V1
    Cellular sheaf cohomology in Polymake Lars Kastner, Kristin Shaw, Anna-Lena Winz July 9, 2018 Abstract This chapter provides a guide to our polymake extension cellularSheaves. We first define cellular sheaves on polyhedral complexes in Euclidean space, as well as cosheaves, and their (co)homologies. As motivation, we summarise some results from toric and tropical geometry linking cellular sheaf cohomologies to cohomologies of algebraic varieties. We then give an overview of the structure of the extension cellularSheaves for polymake. Finally, we illustrate the usage of the extension with examples from toric and tropical geometry. 1 Introduction n Given a polyhedral complex Π in R , a cellular sheaf (of vector spaces) on Π associates to every face of Π a vector space and to every face relation a map of the associated vector spaces (see Definition 2). Just as with usual sheaves, we can compute the cohomology of cellular sheaves (see Definition 5). The advantage is that cellular sheaf cohomology is the cohomology of a chain complex consisting of finite dimensional vector spaces (see Definition 3). Polyhedral complexes often arise in algebraic geometry. Moreover, in some cases, invariants of algebraic varieties can be recovered as cohomology of certain cellular sheaves on polyhedral complexes. Our two major classes of examples come from toric and tropical geometry and are presented in Section 2.2. We refer the reader to [9] for a guide to toric geometry and polytopes. For an introduction to tropical geometry see [4], [20]. The main motivation for this polymake extension was to implement tropical homology, as introduced by Itenberg, Katzarkov, Mikhalkin, and Zharkov in [15].
    [Show full text]
  • Easybuild Documentation Release 20210907.0
    EasyBuild Documentation Release 20210907.0 Ghent University Tue, 07 Sep 2021 08:55:41 Contents 1 What is EasyBuild? 3 2 Concepts and terminology 5 2.1 EasyBuild framework..........................................5 2.2 Easyblocks................................................6 2.3 Toolchains................................................7 2.3.1 system toolchain.......................................7 2.3.2 dummy toolchain (DEPRECATED) ..............................7 2.3.3 Common toolchains.......................................7 2.4 Easyconfig files..............................................7 2.5 Extensions................................................8 3 Typical workflow example: building and installing WRF9 3.1 Searching for available easyconfigs files.................................9 3.2 Getting an overview of planned installations.............................. 10 3.3 Installing a software stack........................................ 11 4 Getting started 13 4.1 Installing EasyBuild........................................... 13 4.1.1 Requirements.......................................... 14 4.1.2 Using pip to Install EasyBuild................................. 14 4.1.3 Installing EasyBuild with EasyBuild.............................. 17 4.1.4 Dependencies.......................................... 19 4.1.5 Sources............................................. 21 4.1.6 In case of installation issues. .................................. 22 4.2 Configuring EasyBuild.......................................... 22 4.2.1 Supported configuration
    [Show full text]
  • Release 0.11 Todd Gamblin
    Spack Documentation Release 0.11 Todd Gamblin Feb 07, 2018 Basics 1 Feature Overview 3 1.1 Simple package installation.......................................3 1.2 Custom versions & configurations....................................3 1.3 Customize dependencies.........................................4 1.4 Non-destructive installs.........................................4 1.5 Packages can peacefully coexist.....................................4 1.6 Creating packages is easy........................................4 2 Getting Started 7 2.1 Prerequisites...............................................7 2.2 Installation................................................7 2.3 Compiler configuration..........................................9 2.4 Vendor-Specific Compiler Configuration................................ 13 2.5 System Packages............................................. 16 2.6 Utilities Configuration.......................................... 18 2.7 GPG Signing............................................... 20 2.8 Spack on Cray.............................................. 21 3 Basic Usage 25 3.1 Listing available packages........................................ 25 3.2 Installing and uninstalling........................................ 42 3.3 Seeing installed packages........................................ 44 3.4 Specs & dependencies.......................................... 46 3.5 Virtual dependencies........................................... 50 3.6 Extensions & Python support...................................... 53 3.7 Filesystem requirements........................................
    [Show full text]
  • Mathematisches Forschungsinstitut Oberwolfach Algebraic Statistics
    Mathematisches Forschungsinstitut Oberwolfach Report No. 20/2017 DOI: 10.4171/OWR/2017/20 Algebraic Statistics Organised by Mathias Drton, Seattle Thomas Kahle, Magdeburg Bernd Sturmfels, Berkeley Caroline Uhler, Cambridge MA 16 April – 22 April 2017 Abstract. Algebraic Statistics is concerned with the interplay of techniques from commutative algebra, combinatorics, (real) algebraic geometry, and re- lated fields with problems arising in statistics and data science. This work- shop was the first at Oberwolfach dedicated to this emerging subject area. The participants highlighted recent achievements in this field, explored ex- citing new applications, and mapped out future directions for research. Mathematics Subject Classification (2010): Primary: 13P25, 62E99; Secondary: 15A72, 52A40, 92B05. Introduction by the Organisers The Oberwolfach workshop Algebraic statistics was organized by Mathias Drton, Thomas Kahle, Bernd Sturmfels, and Caroline Uhler and ran April 17-21, 2017. Algebraic statistics is a rather new field, about two decades old. The field emerged from two lines of work: Diaconis and Sturmfels introduced algebraic tools to cat- egorical data analysis and suggested the construction of Markov bases to perform exact goodness-of-fit tests for such data. This got algebraists, combinatorialists, and algebraic geometers interested in problems in statistics. Significant contribu- tions from Japanese statisticians resulted in a book on Markov bases in algebraic statistics. Through recent work Markov bases have also found applications to disclosure limitation and genetics. The second source, which coined the term ‘al- gebraic statistics’, is a book explaining how Gr¨obner basis methods can be used in experimental design. A recent direction that emerged from this is the use of 1208 Oberwolfach Report 20/2017 commutative algebra for experimental design in system reliability.
    [Show full text]
  • 67 SOFTWARE Michael Joswig and Benjamin Lorenz
    67 SOFTWARE Michael Joswig and Benjamin Lorenz INTRODUCTION This chapter is intended as a guide through the ever-growing jungle of geometry software. Software comes in many guises. There are the fully fledged systems consisting of a hundred thousand lines of code that meet professional standards in software design and user support. But there are also the tiny code fragments scattered over the Internet that can nonetheless be valuable for research purposes. And, of course, the very many individual programs and packages in between. Likewise today we find a wide group of users of geometry software. On the one hand, there are researchers in geometry, teachers, and their students. On the other hand, geometry software has found its way into numerous applications in the sciences as well as industry. Because it seems impossible to cover every possible aspect, we focus on software packages that are interesting from the researcher's point of view, and, to a lesser extent, from the student's. This bias has a few implications. Most of the packages listed are designed to run on UNIX/Linux1 machines. Moreover, the researcher's genuine desire to understand produces a natural inclination toward open source software. This is clearly reflected in the selections below. Major exceptions to these rules of thumb will be mentioned explicitly. In order to keep the (already long) list of references as short as possible, in most cases only the Web address of each software package is listed rather than manuals and printed descriptions, which can be found elsewhere. At least for the freely available packages, this allows one to access the software directly.
    [Show full text]
  • Arxiv:1405.3848V3 [Math.GT] 29 Jul 2019 Number of Critical K-Faces
    FRONTIERS OF SPHERE RECOGNITION IN PRACTICE M. JOSWIG, D. LOFANO, F. H. LUTZ, AND M. TSURUGA Abstract. Sphere recognition is known to be undecidable in dimensions five and beyond, and no polynomial time method is known in dimensions three and four. Here we report on positive and negative computational results with the goal to explore the limits of sphere recognition from a practical point of view. An important ingredient are randomly constructed discrete Morse functions. 1. Introduction To tell whether a given space is homeomorphic to the sphere in a given dimension is a basic problem in computational topology. However, this is difficult in an essential way. Theorem 1 (S. P. Novikov [56], [18]). Given a d-dimensional finite simplicial complex K it is d undecidable to check if K is homeomorphic with S for d ≥ 5. We will consider closed manifolds encoded as finite abstract simplicial complexes | but the methods and results in this article also hold for more general cell complexes with little modification. For a brief historical survey: d-sphere recognition is trivial in dimensions d ≤ 2. Rubinstein [47] and Thompson [54] proved that 3-sphere recognition is decidable. More recently, Schleimer [49] showed that 3-sphere recognition lies in the complexity class NP. Hass and Kuperberg [31] announced and Zentner [59] independently proved that this problem also lies in co-NP, assuming the Generalized Riemann Hypothesis to hold. The complexity status of 4- sphere recognition is open. Summing up, we do not know of any efficient algorithm for d-sphere recognition in the relevant dimensions d ≥ 3, and this is a vast understatement.
    [Show full text]
  • Sage 9.3 Reference Manual: External Packages
    Sage 9.4 Reference Manual: External Packages Release 9.4 The Sage Development Team Aug 24, 2021 CONTENTS 1 Standard Packages 1 2 Optional Packages 7 3 Experimental Packages 11 4 Detailed Listing of External Packages 13 i ii CHAPTER ONE STANDARD PACKAGES The Sage distribution includes most programs and libraries on which Sage depends. It installs them automatically if it does not find equivalent system packages. • _prereq: Represents system packages required for installing SageMath from source • alabaster: Default theme for the Sphinx documentation system • appdirs: A small Python module for determining appropriate platform-specific dirs, e.g. a “user data dir”. • appnope: Disable App Nap on OS X • arb: Arbitrary-precision floating-point ball arithmetic • argon2_cffi: The secure Argon2 password hashing algorithm • attrs: Decorator for Python classes with attributes • babel: Internationalization utilities for Python • backcall: Specifications for callback functions • bleach: An HTML-sanitizing tool • boost_cropped: Portable C++ libraries (subset needed for Sage) • brial: Boolean Ring Algebra implementation using binary decision diagrams • bzip2: High-quality data compressor • cddlib: Double description method for polyhedral representation conversion • certifi: Python package for providing Mozilla’s CA Bundle • cffi: Foreign Function Interface for Python calling Ccode • cliquer: Routines for clique searching • cmake: A cross-platform build system generator • combinatorial_designs: Data from the Handbook of Combinatorial Designs • conway_polynomials:
    [Show full text]
  • Tropical Computations in Polymake
    TROPICAL COMPUTATIONS IN POLYMAKE SIMON HAMPE AND MICHAEL JOSWIG Abstract. We give an overview of recently implemented polymake features for computations in tropical geometry. The main focus is on explicit examples rather than technical explanations. Our computations employ tropical hyper- surfaces, moduli of tropical plane curves, tropical linear spaces and Grassman- nians, lines on tropical cubic surfaces as well as intersection rings of matroids. 1. Introduction Many avenues lead to tropical geometry as we know it today. One motivation comes from studying algebraic varieties (over some field with a non-Archimedean valuation) via their piecewise-linear images (under the valuation map). This is useful since many interesting properties are preserved, and they often become al- gorithmically accessible via tools from polyhedral geometry [37]. Many of these methods are actually implemented, and we start out with giving a brief overview. The standard software to compute tropical varieties with con- stant coefficients is Jensen's Gfan [30]. Its main function is to traverse the dual graph of the Gr¨obnerfan of an ideal and to construct the associated tropical variety as a subfan. The Singular [12] library tropical.lib [31] by Jensen, Mark- wig, Markwig and Ren interfaces to Gfan and implements extra functionality on top. The most recent version also covers Ren's implementation of tropical varieties with arbitrary coefficients [42]. Rinc´on'sprogram TropLi computes tropical linear spaces from matrix input [43], whereas the Tropical Polyhedra Library by Allamigeon allows to manipulate tropical polyhedra [1]. The polymake system is a comprehensive system for polyhedral geometry and adjacent areas of discrete math- ematics.
    [Show full text]
  • Polymake for Integer Linear Programming ISMP 2012
    polymake for integer linear programming ISMP 2012 Michael Joswig w/ Ewgenij Gawrilow and many others TU Darmstadt Berlin, August 21, 2012 The polymake System software for research (and education) in: geometric combinatorics: convex polytopes linear/combinatorial optimization algebraic geometry ::: open source, GNU Public License supported platforms: Linux, FreeBSD, MacOS X more than 100,000 uloc (Perl, C++, C, Java) co-authored (since 1996) w/ Ewgenij Gawrilow [now TomTom] contributions by many people www.polymake.org Example: Maximal Matching Let G = (V ; E) be a finite graph. X max xe e2E X s.t. xe ≤ 1 for all v 2 V e3v xe 2 f0; 1g for all e 2 E 1 x3 x5 x1 x2 x4 0 2 3 x6 switch to demo Algorithm Overview (Selection) convex polytopes, polyhedra and fans convex hulls: cdd, lrs, beneath-and-beyond Voronoi diagrams, Delone decompositions face lattices: Kaibel{Pfetsch (including variations) lattice polytopes/toric varieties optimization Hilbert bases: normaliz, 4ti2 Gomory{Chv´atal closures counting integer points: LattE, bounding box/by projection graphs, matroids, ::: simplicial complexes tropical geometry Other polymake Resources for Optimization http://polymake.org/tutorial/... Marc Pfetsch & Sebastian Pokutta: optimization tutorial Michael Schmitt: implementation of branch-and-bound as proof-of-concept Matthias Walter: total unimodularity test [Wed 10:30, H 3005] http://github.com/xammy/unimodularity-test/wiki/ Polymake-Extension Technical Aspects Hybrid design: Perl (interpreted) and C++ (compiled) Perl: Server side (= organization/communication)
    [Show full text]