DOCSLIB.ORG

Combinatorial Reciprocity Theorems an Invitation to Enumerative Geometric Combinatorics Matthias Beck Raman Sanyal 10.1090/Gsm/195

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Combinatorial Reciprocity Theorems an Invitation to Enumerative Geometric Combinatorics Matthias Beck Raman Sanyal 10.1090/Gsm/195 GRADUATE STUDIES IN MATHEMATICS 195 Combinatorial Reciprocity Theorems An Invitation to Enumerative Geometric Combinatorics Matthias Beck Raman Sanyal 10.1090/gsm/195 Combinatorial Reciprocity Theorems An Invitation to Enumerative Geometric Combinatorics Matthias Beck Raman Sanyal GRADUATE STUDIES IN MATHEMATICS 195 Combinatorial Reciprocity Theorems An Invitation to Enumerative Geometric Combinatorics Matthias Beck Raman Sanyal EDITORIAL COMMITTEE Daniel S. Freed (Chair) Bjorn Poonen Gigliola Staffilani Jeff A. Viaclovsky 2010 Mathematics Subject Classification. Primary 05Axx, 05C31, 05E45, 11P21, 52B05, 52B11, 52B20, 52B45, 52C07, 68R05. For additional information and updates on this book, visit www.ams.org/bookpages/gsm-195 Library of Congress Cataloging-in-Publication Data Names: Beck, Matthias, author. | Sanyal, Raman, 1978-author. Title: Combinatorial reciprocity theorems : an invitation to enumerative geometric combinatorics / Matthias Beck, Raman Sanyal. Description: Providence, Rhode Island : American Mathematical Society, [2018] | Series: Gradu- ate studies in mathematics ; volume 195 | Includes bibliographical references and index. Identifiers: LCCN 2018034294 | ISBN 9781470422004 (alk. paper) Subjects: LCSH: Combinatorial geometry. | Combinatorial analysis. | AMS: Combinatorics – Enumerative combinatorics – Enumerative combinatorics. msc — Combinatorics – Graph theory – Graph polynomials. msc | Combinatorics – Algebraic combinatorics – Combinatorial aspects of simplicial complexes. msc | Number theory – Additive number theory; partitions – Lattice points in specified regions. msc | Convex and discrete geometry – Polytopes and polyhedra – Combinatorial properties (number of faces, shortest paths, etc.). msc | Convex and discrete geometry – Polytopes and polyhedra – n-dimensional polytopes. msc | Convex and discrete geometry – Polytopes and polyhedra – Lattice polytopes (including relations with commutative algebra and algebraic geometry). msc | Convex and discrete geometry – Polytopes and polyhedra – Dissections and valuations (Hilbert’s third problem, etc.). msc | Convex and discrete geometry – Discrete geometry – Lattices and convex bodies in n dimensions. msc | Computer science – Discrete mathematics in relation to computer science – Combinatorics. msc Classification: LCC QA167.B3545 2018 | DDC 511/.6–dc23 LC record available at https://lccn.loc.gov/2018034294 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy select pages for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for permission to reuse portions of AMS publication content are handled by the Copyright Clearance Center. For more information, please visit www.ams.org/publications/pubpermissions. Send requests for translation rights and licensed reprints to [email protected]. c 2018 by the authors. All rights reserved. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at https://www.ams.org/ 10987654321 232221201918 Contents Preface ix Chapter 1. Four Polynomials 1 §1.1. Graph Colorings 1 §1.2. Flows on Graphs 7 §1.3. Order Polynomials 12 §1.4. Ehrhart Polynomials 15 Notes 21 Exercises 23 Chapter 2. Partially Ordered Sets 29 §2.1. Order Ideals and the Incidence Algebra 29 §2.2. The M¨obius Function and Order Polynomial Reciprocity 33 §2.3. Zeta Polynomials, Distributive Lattices, and Eulerian Posets 36 §2.4. Inclusion–Exclusion and M¨obius Inversion 39 Notes 45 Exercises 46 Chapter 3. Polyhedral Geometry 51 §3.1. Inequalities and Polyhedra 52 §3.2. Polytopes, Cones, and Minkowski–Weyl 60 §3.3. Faces, Partially Ordered by Inclusion 66 §3.4. The Euler Characteristic 72 §3.5. M¨obius Functions of Face Lattices 81 v vi Contents §3.6. Uniqueness of the Euler Characteristics and Zaslavsky’s Theorem 86 §3.7. The Brianchon–Gram Relation 91 Notes 94 Exercises 96 Chapter 4. Rational Generating Functions 107 §4.1. Matrix Powers and the Calculus of Polynomials 107 §4.2. Compositions 115 §4.3. Plane Partitions 117 §4.4. Restricted Partitions 120 §4.5. Quasipolynomials 122 §4.6. Integer-point Transforms and Lattice Simplices 124 §4.7. Gradings of Cones and Rational Polytopes 129 §4.8. Stanley Reciprocity for Simplicial Cones 132 §4.9. Chain Partitions and the Dehn–Sommerville Relations 137 Notes 143 Exercises 145 Chapter 5. Subdivisions 155 §5.1. Decomposing a Polyhedron 155 §5.2. M¨obius Functions of Subdivisions 165 §5.3. Beneath, Beyond, and Half-open Decompositions 168 §5.4. Stanley Reciprocity 174 §5.5. h∗-vectors and f-vectors 176 §5.6. Self-reciprocal Complexes and Dehn–Sommerville Revisited 181 §5.7. A Combinatorial Triangulation 188 Notes 193 Exercises 195 Chapter 6. Partially Ordered Sets, Geometrically 203 §6.1. The Geometry of Order Cones 204 §6.2. Subdivisions, Linear Extensions, and Permutations 210 §6.3. Order Polytopes and Order Polynomials 214 §6.4. The Arithmetic of Order Cones and P -Partitions 220 Notes 229 Exercises 230 Contents vii Chapter 7. Hyperplane Arrangements 235 §7.1. Chromatic, Order Polynomials, and Subdivisions Revisited 236 §7.2. Flats and Regions of Hyperplane Arrangements 239 §7.3. Inside-out Polytopes 245 §7.4. Alcoved Polytopes 250 §7.5. Zonotopes and Tilings 261 §7.6. Graph Flows and Totally Cyclic Orientations 273 Notes 280 Exercises 281 Bibliography 287 Notation Index 297 Index 301 Preface Combinatorics is not a field, it’s an attitude. Anon A combinatorial reciprocity theorem relates two classes of combinatorial ob- jects via their counting functions: consider a class X of combinatorial objects and let f(n) be the function that counts the number of objects in X of size n,wheresize refers to some specific quantity that is naturally associated with the objects in X . Similar to canonization, it requires two miracles for a combinatorial reciprocity to occur: 1. the function f(n) is the restriction of some reasonable function (e.g., a polynomial) to the positive integers, and 2. the evaluation f(−n) is an integer of the same sign σ = ±1 for all n ∈ Z>0. In this situation it is only human to ask if σf(−n) has a combinatorial meaning, that is, if there is a natural class X ◦ of combinatorial objects such that σf(−n) counts the objects of X ◦ of size n (where size again refers to some specific quantity naturally associated to X ◦). Combinatorial reci- procity theorems are among the most charming results in mathematics and, in contrast to canonization, can be found all over enumerative combinatorics and beyond. As a first example we consider the class of maps [k] → Z>0 from the finite set [k]:={1, 2,...,k} into the positive integers, and so f(n)=nk counts the number of maps with codomain [n]. Thus f(n) is the restriction of a polynomial and (−1)kf(−n)=nk satisfies our second requirement above. This relates the number of maps [k] → [n] to itself. This relation is a genuine combinatorial reciprocity but the impression one is left with is that of being ix x Preface underwhelmed rather than charmed. Later in the book it will become clear that this example is not boring at all, but for now let’s try again. The term combinatorial reciprocity theorem was coined by Richard Stan- ley in his 1974 paper [162] of the same title, in which he developed a firm foundation of the subject. Stanley starts with an appealing reciprocity that he attributes to John Riordan: For a set S and d ∈ Z≥0, the collection of 1 d-subsets of S is S := {A ⊆ S : |A| = d} . d For d fixed, the number of d-subsets of S depends only on the cardinality |S|, and the number of d-subsets of an n-set is n 1 (0.0.1) f(n)= = n(n − 1) ···(n − d +2)(n − d +1), d d! which is the restriction of a polynomial in n of degree d. From the factoriza- tion we can read off that (−1)df(−n) is a positive integer for every n>0. More precisely, 1 n + d − 1 (−1)df(−n)= n(n +1)···(n + d − 2)(n + d − 1) = , d! d which is the number of d-multisubsets of an n-set, that is, the number of picking d elements from [n] with repetition but without regard to the order in which the elements are picked. Now this is a combinatorial reciprocity! In formulas it reads −n n + d − 1 (0.0.2) (−1)d = . d d This is enticing in more than one way. The identity presents an intriguing connection between subsets and multisubsets via their counting functions, and its formal justification is completely within the realms of an undergradu- ate class in combinatorics. Equation (0.0.2) can be found in Riordan’s book [143] on combinatorial analysis without further comment and, charmingly, Stanley states that his paper [162] can be considered as “further comment”. That further comment is necessary is apparent from the fact that the for- mal proof above falls short of explaining why these two sorts of objects are related by a combinatorial reciprocity. In particular, comparing coefficients in (0.0.2) cannot be the method of choice for establishing more general reci- procity relations. In this book we develop tools and techniques for handling combinatorial reciprocities. However, our own perspective is firmly rooted in geometric combinatorics and, thus, our emphasis is on the geometric nature of the 1All our definitions will look like that: incorporated into the text but bold-faced and so hopefully clearly visible. Preface xi combinatorial reciprocities. That is, for every class of combinatorial objects we associate a geometric object (such as a polytope or a polyhedral complex) in such a way that combinatorial features, including counting functions and reciprocity, are reflected in the geometry.
Load more

Recommended publications
  • The William Lowell Putnam Mathematical Competition 1985–2000 Problems, Solutions, and Commentary
    The William Lowell Putnam Mathematical Competition 1985–2000 Problems, Solutions, and Commentary i Reproduction. The work may be reproduced by any means for educational and scientific purposes without fee or permission with the exception of reproduction by services that collect fees for delivery of documents. In any reproduction, the original publication by the Publisher must be credited in the following manner: “First published in The William Lowell Putnam Mathematical Competition 1985–2000: Problems, Solutions, and Commen- tary, c 2002 by the Mathematical Association of America,” and the copyright notice in proper form must be placed on all copies. Ravi Vakil’s photo on p. 337 is courtesy of Gabrielle Vogel. c 2002 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 2002107972 ISBN 0-88385-807-X Printed in the United States of America Current Printing (last digit): 10987654321 ii The William Lowell Putnam Mathematical Competition 1985–2000 Problems, Solutions, and Commentary Kiran S. Kedlaya University of California, Berkeley Bjorn Poonen University of California, Berkeley Ravi Vakil Stanford University Published and distributed by The Mathematical Association of America iii MAA PROBLEM BOOKS SERIES Problem Books is a series of the Mathematical Association of America consisting of collections of problems and solutions from annual mathematical competitions; compilations of problems (including unsolved problems) specific to particular branches of mathematics; books on the art and practice of problem solving, etc. Committee on Publications Gerald Alexanderson, Chair Roger Nelsen Editor Irl Bivens Clayton Dodge Richard Gibbs George Gilbert Art Grainger Gerald Heuer Elgin Johnston Kiran Kedlaya Loren Larson Margaret Robinson The Inquisitive Problem Solver, Paul Vaderlind, Richard K.
    [Show full text]
  • I. Overview of Activities, April, 2005-March, 2006 …
    MATHEMATICAL SCIENCES RESEARCH INSTITUTE ANNUAL REPORT FOR 2005-2006 I. Overview of Activities, April, 2005-March, 2006 …......……………………. 2 Innovations ………………………………………………………..... 2 Scientific Highlights …..…………………………………………… 4 MSRI Experiences ….……………………………………………… 6 II. Programs …………………………………………………………………….. 13 III. Workshops ……………………………………………………………………. 17 IV. Postdoctoral Fellows …………………………………………………………. 19 Papers by Postdoctoral Fellows …………………………………… 21 V. Mathematics Education and Awareness …...………………………………. 23 VI. Industrial Participation ...…………………………………………………… 26 VII. Future Programs …………………………………………………………….. 28 VIII. Collaborations ………………………………………………………………… 30 IX. Papers Reported by Members ………………………………………………. 35 X. Appendix - Final Reports ……………………………………………………. 45 Programs Workshops Summer Graduate Workshops MSRI Network Conferences MATHEMATICAL SCIENCES RESEARCH INSTITUTE ANNUAL REPORT FOR 2005-2006 I. Overview of Activities, April, 2005-March, 2006 This annual report covers MSRI projects and activities that have been concluded since the submission of the last report in May, 2005. This includes the Spring, 2005 semester programs, the 2005 summer graduate workshops, the Fall, 2005 programs and the January and February workshops of Spring, 2006. This report does not contain fiscal or demographic data. Those data will be submitted in the Fall, 2006 final report covering the completed fiscal 2006 year, based on audited financial reports. This report begins with a discussion of MSRI innovations undertaken this year, followed by highlights
    [Show full text]
  • The Short Toric Polynomial
    THE SHORT TORIC POLYNOMIAL GABOR´ HETYEI Abstract. We introduce the short toric polynomial associated to a graded Eulerian poset. This polynomial contains the same information as the two toric polynomials introduced by Stanley, but allows different algebraic manipulations. The intertwined recurrence defining Stanley’s toric polynomials may be replaced by a single recurrence, in which the degree of the discarded terms is independent of the rank. A short toric variant of the formula by Bayer and Ehrenborg, expressing the toric h-vector in terms of the cd-index, may be stated in a rank-independent form, and it may be shown using weighted lattice path enumeration and the reflection principle. We use our techniques to derive a formula expressing the toric h-vector of a dual simplicial Eulerian poset in terms of its f-vector. This formula implies Gessel’s formula for the toric h-vector of a cube, and may be used to prove that the nonnegativity of the toric h-vector of a simple polytope is a consequence of the Generalized Lower Bound Theorem holding for simplicial polytopes. Introduction As mathematicians, we often look for a “magic” simplification that makes known results easier to state, and helps us find new results which were cumbersome to even talk about using the old terminology. In the study of Eulerian partially ordered sets such a wonderful simplification was the introduction of the cd-index by Fine (see [6]) allowing to restate the already known Bayer-Billera formulas [2] in a simpler form and to formulate Stanley’s famous nonnegativity conjecture [17] regarding the cd-coefficients of Gorenstein∗ posets, shown many years later by Karu [13].
    [Show full text]
  • Coefficients of the Solid Angle and Ehrhart Quasi-Polynomials
    COEFFICIENTS OF THE SOLID ANGLE AND EHRHART QUASI-POLYNOMIALS FABR´ICIO CALUZA MACHADO AND SINAI ROBINS Abstract. Macdonald studied a discrete volume measure for a rational poly- tope P , called solid angle sum, that gives a natural discrete volume for P . We give a local formula for the codimension two quasi-coefficient of the solid angle sum of P . We also show how to recover the classical Ehrhart quasi-polynomial from the solid angle sum and in particular we find a similar local formula for the codimension one and codimension two quasi-coefficients. These local formulas are naturally valid for all positive real dilates of P . An interesting open question is to determine necessary and sufficient con- ditions on a polytope P for which the discrete volume of P given by the solid d angle sum equals its continuous volume: AP (t) = vol(P )t . We prove that d a sufficient condition is that P tiles R by translations, together with the Hyperoctahedral group. Contents 1. Introduction1 2. Main results4 3. Preliminaries9 4. Lattice sums 12 5. Proofs of Theorem 5.2 and Corollary 5.3 15 6. Obtaining the Ehrhart quasi-coefficients ed−1(t) and ed−2(t) 21 7. Two examples in three dimensions 26 8. Concrete polytopes and further remarks 31 References 34 Appendix A. Obtaining the solid angle quasi-coefficients from the Ehrhart quasi-coefficients 35 Appendix B. Comments about local formulas and SI-interpolators 38 1. Introduction d arXiv:1912.08017v2 [math.CO] 26 Jun 2020 Given a polytope P ⊆ R , the number of integer points within P can be regarded as a discrete analog of the volume of the body.
    [Show full text]
  • Computations in Algebraic Geometry with Macaulay 2
    Computations in algebraic geometry with Macaulay 2 Editors: D. Eisenbud, D. Grayson, M. Stillman, and B. Sturmfels Preface Systems of polynomial equations arise throughout mathematics, science, and engineering. Algebraic geometry provides powerful theoretical techniques for studying the qualitative and quantitative features of their solution sets. Re- cently developed algorithms have made theoretical aspects of the subject accessible to a broad range of mathematicians and scientists. The algorith- mic approach to the subject has two principal aims: developing new tools for research within mathematics, and providing new tools for modeling and solv- ing problems that arise in the sciences and engineering. A healthy synergy emerges, as new theorems yield new algorithms and emerging applications lead to new theoretical questions. This book presents algorithmic tools for algebraic geometry and experi- mental applications of them. It also introduces a software system in which the tools have been implemented and with which the experiments can be carried out. Macaulay 2 is a computer algebra system devoted to supporting research in algebraic geometry, commutative algebra, and their applications. The reader of this book will encounter Macaulay 2 in the context of concrete applications and practical computations in algebraic geometry. The expositions of the algorithmic tools presented here are designed to serve as a useful guide for those wishing to bring such tools to bear on their own problems. A wide range of mathematical scientists should find these expositions valuable. This includes both the users of other programs similar to Macaulay 2 (for example, Singular and CoCoA) and those who are not interested in explicit machine computations at all.
    [Show full text]
  • Prizes and Awards Session
    PRIZES AND AWARDS SESSION Wednesday, July 12, 2021 9:00 AM EDT 2021 SIAM Annual Meeting July 19 – 23, 2021 Held in Virtual Format 1 Table of Contents AWM-SIAM Sonia Kovalevsky Lecture ................................................................................................... 3 George B. Dantzig Prize ............................................................................................................................. 5 George Pólya Prize for Mathematical Exposition .................................................................................... 7 George Pólya Prize in Applied Combinatorics ......................................................................................... 8 I.E. Block Community Lecture .................................................................................................................. 9 John von Neumann Prize ......................................................................................................................... 11 Lagrange Prize in Continuous Optimization .......................................................................................... 13 Ralph E. Kleinman Prize .......................................................................................................................... 15 SIAM Prize for Distinguished Service to the Profession ....................................................................... 17 SIAM Student Paper Prizes ....................................................................................................................
    [Show full text]
  • Ehrhart Theory for Lattice Polytopes
    WASHINGTON UNIVERSITY Department of Mathematics Dissertation Examination Committee: John Shareshian, Chair Ramanath Cowsik Renato Feres Lev Gelb Mohan Kumar David Wright Ehrhart Theory for Lattice Polytopes by Benjamin James Braun A dissertation presented to the Graduate School of Arts and Sciences of Washington University in partial fulfillment for the degree of Doctor of Philosophy May 2007 Saint Louis, Missouri Acknowledgements To John Shareshian, for being an excellent advisor and valued mentor; I could not have done this without your guidance. To the faculty in the mathematics department from whom I’ve learned so much, especially Renato Feres, Gary Jensen, Mohan Kumar, John McCarthy, Rachel Roberts, and David Wright. To the other graduate students who have been great friends and colleagues, especially Kim, Jeff and Paul. To Matthias Beck and Sinai Robins for teaching me about Ehrhart theory and writing a great book; special thanks to Matt for introducing me to open problems re- garding Ehrhart polynomial roots and coefficients. To Mike Develin for collaborating and sharing his good ideas. To all of the members of the combinatorics community who I have had the pleasure of working with and learning from over the last few years, especially Paul Bendich, Tristram Bogart, Pat Byrnes, Jes´us De Loera, Tyrrell McAllister, Sam Payne, and Kevin Woods. To my parents and my brother, for always being there and supporting me. Most of all, to my wife, Laura, for your love and encouragement. None of this would mean anything if you were not in my life. ii Contents Acknowledgements ii List of Figures v 1 Introduction 2 1.1 Overture.................................
    [Show full text]
  • Arxiv:2010.06953V2 [Math.RA] 23 Apr 2021
    IDENTITIES AND BASES IN THE HYPOPLACTIC MONOID ALAN J. CAIN, ANTÓNIO MALHEIRO, AND DUARTE RIBEIRO Abstract. This paper presents new results on the identities satisfied by the hypoplactic monoid. We show how to embed the hypoplactic monoid of any rank strictly greater than 2 (including infinite rank) into a direct product of copies of the hypoplactic monoid of rank 2. This confirms that all hypoplactic monoids of rank greater than or equal to 2 satisfy exactly the same identities. We then give a complete characterization of those identities, and prove that the variety generated by the hypoplactic monoid has finite axiomatic rank, by giving a finite basis for it. 1. Introduction A (non-trivial) identity is a formal equality u ≈ v, where u and v are words over some alphabet of variables, which is not of the form u ≈ u. If a monoid is known to satisfy an identity, an important question is whether the set of identities it satisfies is finitely based, that is, if all these identities are consequences of those in some finite subset (see [37, 42]). The plactic monoid plac, also known as the monoid of Young tableaux, is an important algebraic structure, first studied by Schensted [38] and Knuth [23], and later studied in depth by Lascoux and Schützenberger [27]. It is connected to many different areas of Mathematics, such as algebraic combinatorics, symmetric functions [29], crystal bases [4] and representation theory [14]. In particular, the question of identities in the plactic monoid has received a lot of attention recently [26, 20]. Finitely-generated polynomial-growth groups are virtually nilpotent and so sat- isfy identities [16].
    [Show full text]
  • Triangulations of Integral Polytopes, Examples and Problems
    数理解析研究所講究録 955 巻 1996 年 133-144 133 Triangulations of integral polytopes, examples and problems Jean-Michel KANTOR We are interested in polytopes in real space of arbitrary dimension, having vertices with integral co- ordinates: integral polytopes. The recent increase of interest for the study of these $\mathrm{p}\mathrm{o}\mathrm{l}\mathrm{y}$ topes and their triangulations has various motivations; let us mention the main ones: . the beautiful theory of toric varieties has built a bridge between algebraic geometry and the combina- torics of these integral polytopes [12]. Triangulations of cones and polytopes occur naturally for example in problems of existence of crepant resolution of singularities $[1,5]$ . The work of the school of $\mathrm{I}.\mathrm{M}$ . Gelfand on secondary polytopes gives a new insight on triangulations, with applications to algebraic geometry and group theory [13]. In statistical physics, random tilings lead to some interesting problems dealing with triangulations of order polytopes $[6,29]$ . With these motivations in mind, we introduce new tools: Generalizations of the Ehrhart polynomial (counting points “modulo congruence”), discrete length between integral points (and studying the geometry associated to it), arithmetic Euler-Poincar\'e formula which gives, in dimension 3, the Ehrhart polynomial in terms of the $\mathrm{f}$-vector of a minimal triangulation of the polytope (Theorem 7). Finally, let us mention the results in dimension 2 of the late Peter Greenberg, they led us to the study of “Arithmetical $\mathrm{P}\mathrm{L}$-topology” which, we believe with M. Gromov, D. Sullivan, and P. Vogel, has not yet revealed all its beauties.
    [Show full text]
  • (W, S) Be a Finite Coxeter System with an Involut
    TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 359, Number 6, June 2007, Pages 2787–2798 S 0002-9947(07)04070-6 Article electronically published on January 26, 2007 THE COMBINATORICS OF TWISTED INVOLUTIONS IN COXETER GROUPS AXEL HULTMAN Abstract. The open intervals in the Bruhat order on twisted involutions in a Coxeter group are shown to be PL spheres. This implies results conjectured by F. Incitti and sharpens the known fact that these posets are Gorenstein∗ over Z2. We also introduce a Boolean cell complex which is an analogue for twisted involutions of the Coxeter complex. Several classical Coxeter complex prop- erties are shared by our complex. When the group is finite, it is a shellable sphere, shelling orders being given by the linear extensions of the weak order on twisted involutions. Furthermore, the h-polynomial of the complex coincides with the polynomial counting twisted involutions by descents. In particular, this gives a type-independent proof that the latter is symmetric. 1. Introduction Let (W, S) be a finite Coxeter system with an involutive automorphism θ.In [25], Springer studied the combinatorics of the twisted involutions I(θ). Together with Richardson, he refined his results in [23, 24] and put them to use in the study of the subposet of the Bruhat order on W induced by I(θ). One of their tools was another partial order on I(θ), which they called the weak order for reasons that will be explained later. Their motivation was an intimate connection between the Bruhat order on I(θ) and Bruhat decompositions of certain symmetric varieties.
    [Show full text]
  • Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone
    Vita BERND STURMFELS Department of Mathematics, University of California, Berkeley, CA 94720 Phone: (510) 642 4687, Fax: (510) 642 8204, [email protected] M.A. [Diplom] TH Darmstadt, Germany, Mathematics and Computer Science, 1985 Ph.D. [Dr. rer. nat.] TH Darmstadt, Germany, Mathematics, 1987 Ph.D. University of Washington, Seattle, Mathematics, 1987 Professional Experience: 1987–1988 Postdoctoral Fellow, I.M.A., University of Minnesota, Minneapolis 1988–1989 Assistant Professor, Research Institute for Symbolic Computation, (RISC-Linz), Linz, Austria 1989–1991 Assistant Professor, Department of Mathematics, Cornell University 1992–1996 Associate Professor, Department of Mathematics, Cornell University 1994–2001 Professor, Department of Mathematics, University of California, Berkeley 2001– Professor, Department of Mathematics and Computer Science, UC Berkeley Academic Honors: 1986 - 1987 Alfred P. Sloan Doctoral Dissertation Fellowship 1991 - 1993 Alfred P. Sloan Research Fellow 1992 - 1997 National Young Investigator (NSF) 1992 - 1997 David and Lucile Packard Fellowship 1999 Lester R. Ford Prize for Expository Writing (MAA) 2000-2001 Miller Research Professorship, UC Berkeley Spring 2003 John von Neumann Professor, Technical University M¨unchen 2003-2004 Hewlett-Packard Research Professor at MSRI Berkeley July 2004 Clay Mathematics Institute Senior Scholar Research Interests: Computational Algebra, Combinatorics, Algebraic Geometry Selected Professional Activities: Visiting Positions: D´epartment de Math´ematiques, Universit´ede Nice, France, Spring 1989 Mathematical Sciences Research Institute, Berkeley, Fall 1992 Courant Institute, New York University, 1994–95 RIMS, Kyoto University, Japan, 1997–98 Current Editorial Board Membership: Journal of the American Mathematical Society, Duke Mathematical Journal, Collecteana Mathematica, Beitr¨agezur Geometrie und Algebra, Order, Discrete and Computational Geometry, Applicable Algebra (AAECC) Journal of Combinatorial Theory (Ser.
    [Show full text]
  • U.S. Team Places Second in International Olympiad
    THE NEWSLETTER OF THE MATHEMATICAL ASSOCIATION OF AMERICA VOLUME 5 NUMBER 4 SEPTEMBER 1985 u.s. Team Places Second in International Olympiad Stephen B. Maurer pearheaded with a first prize finish by Waldemar Hor­ problem. On the other hand, the Eastern Europeans (except wat, a recent U.S. citizen born in Poland, the U.S. team the Romanians) had trouble with a sequence problem which S finished second in the 26th International Mathematical the U.S. team handled easily. Olympiad (IMO), held in early July in Helsinki, Finland. Individually, Horwat, from Hoffman Estates,Illinois, obtained The U.S. team received 180 points out of a possible 252. 35 points. Jeremy Kahn, of New York City, also received a (Each of six students tackled six problems, each worth 7 first prize with 34. All the other team members received points.) Romania was first with 201. Following the U.S. were second prizes: David Grabiner, Claremont, California; Joseph Hungary, 168; Bulgaria, 165; Vietnam, 144; USSR, 140; and Keane, Pittsburgh, Pennsylvania; David Moews, Willimantic, West Germany, 139. Thirty-nine countries participated, up Connecticut; and Bjorn Poonen, Winchester, Massachusetts. from 34 last year. One student from Romania and one from Hungary obtained The exam this year was especially tough. For comparison, perfect scores. The top scorer for the USSR was female; she last year the USSR was first with 235 and the U.S. was tied obtained a first prize with 36 points. Two other young women with Hungary for fourth at 195. The U.S. contestants did very received second prizes. well on every problem this year except a classical geometry The U.S.
    [Show full text]