DOCSLIB.ORG

Interview with Karim Adiprasito Toufik Mansour

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Interview with Karim Adiprasito Toufik Mansour numerative ombinatorics A pplications Enumerative Combinatorics and Applications ECA 2:2 (2022) Interview #S3I6 ecajournal.haifa.ac.il Interview with Karim Adiprasito Toufik Mansour Karim Adiprasito completed his undergraduate studies at TU Dortmund in 2010. He obtained a Ph.D. from Free University Berlin in 2013, under the supervision of G¨unter M. Ziegler. He has been an Assistant Professor at the Einstein Institute for Mathematics Hebrew University of Jerusalem since 2015, promoted to full professor in 2018. Professor Adiprasito has given numerous invited talks in conferences and seminars. He received several prizes, for example, European Prize in Combi- natorics, in 2015, for his work in discrete geometry; New Hori- zons Prize for Early-Career Achievement in Mathematics, as- sociated with the Breakthrough Prize in Mathematics, in 2019; Prize of the European Mathematical Society in 2020, and is the 2021 Hadamard Lecturer. Mansour: Professor Adiprasito, first of all, we torics and the rest of mathematics? would like to thank you for accepting this in- Adiprasito: I am not a fan of isolated combi- terview. Would you tell us broadly what com- natorics as a field or any field for that matter. binatorics is? It is to be primarily a place to meet and discuss Adiprasito: In my perspective, combinatorics mathematical problems from various areas. I is a common ground in mathematics. It is a do not feel I am particularly talented in math- place where everything comes together, which ematics overall, so translating a problem to a has limitless applications to other fields, as well combinatorial one is always helpful to me to as being the playground for other fields. What grasp it for myself, and then hopefully to solve is most fascinating to me though is its ubiq- it. uity in everything in daily life, as our lives are Mansour: What have been some of the main naturally discrete. As such, when we speak of goals of your research? a continuous process, we often mean a really Adiprasito: Good question (in the sense that large discrete one, and so the discrete and the I needed to think about it for a bit). I was singular is really the germane issue to look at always more guided by cool ideas rather than when we want to find out the limits of our rea- goals, and I am rather impulsive at that. So soning. if I find some interesting idea, have an inter- Combinatorics is also just how we like to esting thought, then I would just try it out. think, how we like to order things in our minds. But I am not someone that sits and broods It was always fascinating to me that the an- over a specific problem for a long time unless cient Greeks chose polyhedra to model nature, he sees a crack in the wall. I have a collection pointy and unwieldy shapes, instead of the cir- of problems in the back of my head, but I con- cle. sider this collection more as a playground to Mansour: What do you think about the de- test ideas on. velopment of the relations between combina- Mansour: We would like to ask you about The authors: Released under the CC BY-ND license (International 4.0), Published: June 18, 2021 Toufik Mansour is a professor of mathematics at the University of Haifa, Israel. His email address is [email protected] Interview with Karim Adiprasito your formative years. What were your early Also, it has remained as my favorite book. experiences with mathematics? Did that hap- Mansour: What was the reason you chose the pen under the influence of your family or some Free University Berlin for your Ph.D. and your other people? advisor G¨unter M. Ziegler? Adiprasito: I think the earliest encounter Adiprasito: I was honestly supposed to go to with mathematics is from riddles my grandfa- the United States for graduate school (I had ther asked me. I must say, I never liked riddles. several offers, but ultimately hoped to work It always feels annoying to be put on the spot, with Gromov at Courant). But, for personal and be asked to come up with an idea right reasons, I decided to stay in Germany, so I con- there and then. It always feels more like a test tacted Guenter M. Ziegler while I was vacation- than an invitation to think. ing in Berlin. We talked about some work we So I think the first time I actually liked did, and to be honest, I think I selected him mathematics was when I discovered it myself. out of personal compatibility just as much as One instance from school I remember vividly I was interested in polytopes. He let me do was not actually in a mathematics class (which research mostly on my own terms, but we had I found to be mostly average and boring, es- some nice projects together as well. pecially towards the final years. The teachers Mansour: What was the problem you worked were just not competent) but from social sci- on in your thesis? ence class (or rather, the first course in eco- Adiprasito: Several, actually. First, there nomics) where I learned, though in a hidden was a postdoc present there in my first year, way, about the connection between economic Bruno Benedetti, with whom I met out of prin- (or rather, game-theoretic) equilibria and fixed ciple in some Italian restaurant in Berlin in- point theorems. stead of the office. This was quite convenient, Mansour: Were there specific problems that as I was honestly not a good office student, and made you first interested in combinatorics? never became one. Anyway, we worked on vari- Adiprasito: I think the first encounter with ous questions in geometric topology, mostly re- combinatorics that made me go \huh" was lated to the question of how difficult geometric reading about spaces of bounded curvature, in triangulations can be. One cute fact that came relation to hyperbolic groups and Alexandrov's out of that was that at some point I realized 4 5 curvature notions1. That does not seem com- how to prove the Hirsch conjecture for flag binatorial at first, but the remarkable thing complexes using Gromov's work. was that Gromov2 really turned a geometric And then I studied a problem concerning ar- property into a combinatorial one, what he rangement theory that had been looked at by called the no-triangle condition (graph theo- Salvetti before, describing complements of ar- rists would call it the clique complex). That rangements. Essentially, I wanted to show that stuck with me for a long time, because it was in they are minimal in a homotopic sense. I real- geometry textbooks and contexts that I really ized that there was a simple way to do it via encountered the first (specifically, Gromov's combinatorial trick and in particular proved6 textbook3 on Metric Structures on Riemannian the minimality of some arrangement comple- and Non-Riemannian spaces). I noticed for ments. myself that Gromov was really being a com- And then finally, the \magnum opus" was binatorialist at heart when he wrote this, and something that came out of a discussion with I found the connection immensely impressive. G¨unter Ziegler, where we studied a very old 1 A. D. Alexandrov, V. N. Berestovskii and I. G. Nikolaev, Generalized Riemannian spaces, Russian Math. Surveys 41 (1986), 1{54. 2M. Gromov, Hyperbolic groups, In S. Gersten, editor, Essays in Group Theory, Volume 8 of Mathematical Sciences Research Institute Publications, 75{263, Springer, New York, 1987. 3M. Gromov, Metric structures for Riemannian and non-Riemannian spaces, Progress in Mathematics 152, Birkh¨auser,Boston, 1999. 4K. A. Adiprasito and B. Benedetti, The Hirsch conjecture holds for normal flag complexes, Mathematics of Operations Re- search 39:4 (2014), 1340{1348. 5G. B. Dantzig, Linear Programming and Extensions, Princeton University Press, Princeton, N.J., 1963. 6K. A. Adiprasito, Combinatorial stratifications and minimality of 2-arrangements, J. Topology 7:4 (2014), 1200{1220. 7E. Steinitz, Polyeder und Raumeinteilungen, Encyklop¨adieder mathematischen Wissenschaften, Dritter Band: Geometrie, III.1.2., Heft 9, Kapitel III A B 12 (W. Fr. Meyer and H. Mohrmann, eds.), B. G. Teubner, Leipzig, 1922, 1{139. xi, 53. ECA 2:2 (2022) Interview #S3I6 2 Interview with Karim Adiprasito conjecture of Legendre and Steinitz7 on the sures of complexity for hypergraphs. It is one dimension of deformation space of polytopes. aspect of the story of high-dimensional expan- The construction is a \Berlin" one, in the sense sion that I find very fascinating, and it master- that we realized that certain discretizations fully uses rather difficult geometric arguments of partial differential equations (used for in- to achieve it. stance in architecture) could be used to solve 3. I very much love Sabitov's proof11 of Bel- the problem for us. low's conjecture, that is, that the volume of a Mansour: What would guide you in your re- flexible polyhedron is constant. It is a very search?, a general theoretical question or a spe- beautiful result connecting geometry, algebra, cific problem? and combinatorics, and several questions re- Adiprasito: I mostly said this already: nei- main open. It is elegant and uses several inter- ther. It is mostly a neat idea that I obsess esting ideas masterfully. over, and it can be motivated by either gen- Mansour: What are the top three open ques- eral or specific problems. Having understood tions in your list? something about the inner workings though is Adiprasito: I am very much interested at what is leads my research. the moment in the Hopf conjecture, that de- Mansour: When you are working on a prob- scribes the Euler characteristic of aspherical lem, do you feel that something is true even manifolds.
Load more

Recommended publications
  • 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.
    [Show full text]
  • 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).
    [Show full text]
  • 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.
    [Show full text]
  • Arxiv:Math/0403494V1
    ONE-POINT SUSPENSIONS AND WREATH PRODUCTS OF POLYTOPES AND SPHERES MICHAEL JOSWIG AND FRANK H. LUTZ Abstract. It is known that the suspension of a simplicial complex can be realized with only one additional point. Suitable iterations of this construction generate highly symmetric simplicial complexes with various interesting combinatorial and topological properties. In particular, infinitely many non-PL spheres as well as contractible simplicial complexes with a vertex-transitive group of automorphisms can be obtained in this way. 1. Introduction McMullen [34] constructed projectively unique convex polytopes as the joint convex hulls of polytopes in mutually skew affine subspaces which are attached to the vertices of yet another polytope. It is immediate that if the polytopes attached are pairwise isomorphic one can obtain polytopes with a large group of automorphisms. In fact, if the polytopes attached are simplices, then the resulting polytope can be obtained by successive wedging (or rather its dual operation). This dual wedge, first introduced and exploited by Adler and Dantzig [1] in 1974 for the study of the Hirsch conjecture of linear programming, is essentially the same as the one-point suspension in combinatorial topology. It is striking that this simple construction makes several appearances in the literature, while it seems that never before it had been the focus of research for its own sake. The purpose of this paper is to collect what is known (for the polytopal as well as the combinatorial constructions) and to fill in several gaps, most notably by introducing wreath products of simplicial complexes. In particular, we give a detailed analysis of wreath products in order to provide explicit descriptions of highly symmetric polytopes which previously had been implicit in McMullen’s construction.
    [Show full text]
  • Program of the Sessions San Diego, California, January 9–12, 2013
    Program of the Sessions San Diego, California, January 9–12, 2013 AMS Short Course on Random Matrices, Part Monday, January 7 I MAA Short Course on Conceptual Climate Models, Part I 9:00 AM –3:45PM Room 4, Upper Level, San Diego Convention Center 8:30 AM –5:30PM Room 5B, Upper Level, San Diego Convention Center Organizer: Van Vu,YaleUniversity Organizers: Esther Widiasih,University of Arizona 8:00AM Registration outside Room 5A, SDCC Mary Lou Zeeman,Bowdoin upper level. College 9:00AM Random Matrices: The Universality James Walsh, Oberlin (5) phenomenon for Wigner ensemble. College Preliminary report. 7:30AM Registration outside Room 5A, SDCC Terence Tao, University of California Los upper level. Angles 8:30AM Zero-dimensional energy balance models. 10:45AM Universality of random matrices and (1) Hans Kaper, Georgetown University (6) Dyson Brownian Motion. Preliminary 10:30AM Hands-on Session: Dynamics of energy report. (2) balance models, I. Laszlo Erdos, LMU, Munich Anna Barry*, Institute for Math and Its Applications, and Samantha 2:30PM Free probability and Random matrices. Oestreicher*, University of Minnesota (7) Preliminary report. Alice Guionnet, Massachusetts Institute 2:00PM One-dimensional energy balance models. of Technology (3) Hans Kaper, Georgetown University 4:00PM Hands-on Session: Dynamics of energy NSF-EHR Grant Proposal Writing Workshop (4) balance models, II. Anna Barry*, Institute for Math and Its Applications, and Samantha 3:00 PM –6:00PM Marina Ballroom Oestreicher*, University of Minnesota F, 3rd Floor, Marriott The time limit for each AMS contributed paper in the sessions meeting will be found in Volume 34, Issue 1 of Abstracts is ten minutes.
    [Show full text]
  • Hodge Theory in Combinatorics
    BULLETIN (New Series) OF THE AMERICAN MATHEMATICAL SOCIETY Volume 55, Number 1, January 2018, Pages 57–80 http://dx.doi.org/10.1090/bull/1599 Article electronically published on September 11, 2017 HODGE THEORY IN COMBINATORICS MATTHEW BAKER Abstract. If G is a finite graph, a proper coloring of G is a way to color the vertices of the graph using n colors so that no two vertices connected by an edge have the same color. (The celebrated four-color theorem asserts that if G is planar, then there is at least one proper coloring of G with four colors.) By a classical result of Birkhoff, the number of proper colorings of G with n colors is a polynomial in n, called the chromatic polynomial of G.Read conjectured in 1968 that for any graph G, the sequence of absolute values of coefficients of the chromatic polynomial is unimodal: it goes up, hits a peak, and then goes down. Read’s conjecture was proved by June Huh in a 2012 paper making heavy use of methods from algebraic geometry. Huh’s result was subsequently refined and generalized by Huh and Katz (also in 2012), again using substantial doses of algebraic geometry. Both papers in fact establish log-concavity of the coefficients, which is stronger than unimodality. The breakthroughs of the Huh and Huh–Katz papers left open the more general Rota–Welsh conjecture, where graphs are generalized to (not neces- sarily representable) matroids, and the chromatic polynomial of a graph is replaced by the characteristic polynomial of a matroid. The Huh and Huh– Katz techniques are not applicable in this level of generality, since there is no underlying algebraic geometry to which to relate the problem.
    [Show full text]
  • Notices of the American Mathematical Society Karim Adiprasito Karim Adiprasito January 2017 Karim Adiprasito FEATURES
    THE AUTHORS THE AUTHORS THE AUTHORS Notices of the American Mathematical Society Karim Adiprasito Karim Adiprasito January 2017 Karim Adiprasito FEATURES June Huh June Huh 8 32 2626 June Huh JMM 2017 Lecture Sampler The Graduate Student Hodge Theory of Barry Simon, Alice Silverberg, Lisa Section Matroids Jeffrey, Gigliola Staffilani, Anna Interview with Arthur Benjamin Karim Adiprasito, June Huh, and Wienhard, Donald St. P. Richards, by Alexander Diaz-Lopez Eric Katz Tobias Holck Colding, Wilfrid Gangbo, and Ingrid Daubechies WHAT IS?...a Complex Symmetric Operator by Stephan Ramon Garcia Graduate Student Blog Enjoy the Joint Mathematics Meetings from near or afar through our lecture sampler and our feature on Hodge Theory, the subject of a JMM Current Events Bulletin Lecture. This month's Graduate Student Section includes an interview Eric Katz Eric Katz with Arthur Benjamin, "WHAT IS...a Complex Symmetric Operator?" and the latest "Lego Graduate Student" craze. Eric Katz The BackPage announces the October caption contest winner and presents a new caption contest for January. As always, comments are welcome on our webpage. And if you're not already a member of the AMS, I hope you'll consider joining, not just because you will receive each issue of these Notices but because you believe in our goal of supporting and opening up mathematics. —Frank Morgan, Editor-in-Chief ALSO IN THIS ISSUE 40 My Year as an AMS Congressional Fellow Anthony J. Macula 44 AMS Trjitzinsky Awards Program Celebrates Its Twenty-Fifth Year 47 Origins of Mathematical Words A Review by Andrew I. Dale 54 Aleksander (Olek) Pelczynski, 1932–2012 Edited by Joe Diestel 73 2017 Annual Meeting of the American Association for the Advancement of Science Matroids (top) and Dispersion in a Prism (bottom), from this month's contributed features; see pages 8 and 26.
    [Show full text]
  • ADDENDUM the Following Remarks Were Added in Proof (November 1966). Page 67. an Easy Modification of Exercise 4.8.25 Establishes
    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(~) .
    [Show full text]
  • Ten Problems in Geometry
    Ten Problems in Geometry Moritz W. Schmitt G¨unter M. Ziegler∗ Institut f¨urMathematik Institut f¨urMathematik Freie Universit¨atBerlin Freie Universit¨atBerlin Arnimallee 2 Arnimallee 2 14195 Berlin, Germany 14195 Berlin, Germany [email protected] [email protected] May 1, 2011 Abstract We describe ten problems that wait to be solved. Introduction Geometry is a field of knowledge, but it is at the same time an active field of research | our understanding of space, about shapes, about geometric structures develops in a lively dialog, where problems arise, new questions are asked every day. Some of the problems are settled nearly immediately, some of them need years of careful study by many authors, still others remain as challenges for decades. Contents 1 Unfolding polytopes 2 2 Almost disjoint triangles 4 3 Representing polytopes with small coordinates 6 4 Polyhedra that tile space 8 5 Fatness 10 6 The Hirsch conjecture 12 7 Unimodality for cyclic polytopes 14 8 Decompositions of the cube 16 9 A problem concerning the ball and the cube 19 10 The 3d conjecture 21 ∗Partially supported by DFG, Research Training Group \Methods for Discrete Structures" 1 1 Unfolding polytopes In 1525 Albrecht D¨urer'sfamous geometry masterpiece \Underweysung der Messung mit dem Zirckel und Richtscheyt"1 was published in Nuremberg. Its fourth part contains many drawings of nets of 3-dimensional polytopes. Implicitly it contains the following conjecture: Every 3-dimensional convex polytope can be cut open along a spanning tree of its graph and then unfolded into the plane without creating overlaps.
    [Show full text]
  • Interview with Gil Kalai Toufik Mansour
    numerative ombinatorics A pplications Enumerative Combinatorics and Applications ECA 2:2 (2022) Interview #S3I7 ecajournal.haifa.ac.il Interview with Gil Kalai Toufik Mansour Gil Kalai received his Ph.D. at the Einstein Institute of the Hebrew University in 1983, under the supervi- sion of Micha A. Perles. After a postdoctoral position at the Massachusetts Institute of Technology (MIT), he joined the Hebrew University in 1985, (Professor Emeritus since 2018) and he holds the Henry and Manya Noskwith Chair. Since 2018, Kalai is a Pro- fessor of Computer Science at the Efi Arazi School of Computer Science in IDC, Herzliya. Since 2004, he has Photo by Muli Safra also been an Adjunct Professor at the Departments of Mathematics and Computer Science, Yale University. He has held visiting positions at MIT, Cornell, the Institute of Advanced Studies in Prince- ton, the Royal Institute of Technology in Stockholm, and in the research centers of IBM and Microsoft. Professor Gil Kalai has made significant contributions to the fields of discrete math- ematics and theoretical computer science. Two breakthrough contributions include his work in understanding randomized simplex algorithms and disproving Borsuk's famous conjecture of 1933. In recognition of his contributions, professor Kalai has received several awards in- cluding the P´olya Prize in 1992, the Erd}osPrize of the Israel Mathematical Society in 1993, the Fulkerson Prize in 1994, and the Rothschild Prize in mathematics in 2012. He has given lectures and talks at many conferences, including a plenary talk at the International Congress of Mathematicians in 2018. From 1995 to 2001, he was the Editor-in-Chief of the Israel Journal of Mathematics.
    [Show full text]
  • Focm 2017 Foundations of Computational Mathematics Barcelona, July 10Th-19Th, 2017 Organized in Partnership With
    FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th-19th, 2017 http://www.ub.edu/focm2017 Organized in partnership with Workshops Approximation Theory Computational Algebraic Geometry Computational Dynamics Computational Harmonic Analysis and Compressive Sensing Computational Mathematical Biology with emphasis on the Genome Computational Number Theory Computational Geometry and Topology Continuous Optimization Foundations of Numerical PDEs Geometric Integration and Computational Mechanics Graph Theory and Combinatorics Information-Based Complexity Learning Theory Plenary Speakers Mathematical Foundations of Data Assimilation and Inverse Problems Multiresolution and Adaptivity in Numerical PDEs Numerical Linear Algebra Karim Adiprasito Random Matrices Jean-David Benamou Real-Number Complexity Alexei Borodin Special Functions and Orthogonal Polynomials Mireille Bousquet-Mélou Stochastic Computation Symbolic Analysis Mark Braverman Claudio Canuto Martin Hairer Pierre Lairez Monique Laurent Melvin Leok Lek-Heng Lim Gábor Lugosi Bruno Salvy Sylvia Serfaty Steve Smale Andrew Stuart Joel Tropp Sponsors Shmuel Weinberger 2 FoCM 2017 Foundations of Computational Mathematics Barcelona, July 10th{19th, 2017 Books of abstracts 4 FoCM 2017 Contents Presentation . .7 Governance of FoCM . .9 Local Organizing Committee . .9 Administrative and logistic support . .9 Technical support . 10 Volunteers . 10 Workshops Committee . 10 Plenary Speakers Committee . 10 Smale Prize Committee . 11 Funding Committee . 11 Plenary talks . 13 Workshops . 21 A1 { Approximation Theory Organizers: Albert Cohen { Ron Devore { Peter Binev . 21 A2 { Computational Algebraic Geometry Organizers: Marta Casanellas { Agnes Szanto { Thorsten Theobald . 36 A3 { Computational Number Theory Organizers: Christophe Ritzenhaler { Enric Nart { Tanja Lange . 50 A4 { Computational Geometry and Topology Organizers: Joel Hass { Herbert Edelsbrunner { Gunnar Carlsson . 56 A5 { Geometric Integration and Computational Mechanics Organizers: Fernando Casas { Elena Celledoni { David Martin de Diego .
    [Show full text]
  • Nonsimplicities and the Perturbed Wedge
    NONSIMPLICITIES AND THE PERTURBED WEDGE FRED B. HOLT Abstract. In producing a counterexample to the Hirsch Conjecture, Francisco Santos has described a new construction, the perturbed wedge. Santos starts in dimension 5 with a counterexample to the nonrevisiting conjecture. If this counterexample were a simple polytope, we could repeatedly apply wedging in order to produce a counterexample to the Hirsch conjecture. However, the 5-dimensional polytope is not simple, so we need a different way to proceed - thus the perturbed wedge. In the perturbed wedge, we take the wedge over one facet of a non- simple polytope and then perturb one or more of the facets of the wedge to move the resulting polytope closer to simplicity. In this paper, we examine some of the technical underpinnings of the perturbed wedge, using Santos and Weibel's counterexample to the Hirsch conjecture as the guiding example. Introduction Coincidence in high dimensions is a delicate issue. Using nonsimple poly- topes and introducing the perturbed wedge construction, Santos [9] has produced a counterexample to the Hirsch conjecture. As a complement to Santos' exposition, we take the specific counterexample in dimension 20 provided by Matschke, Santos, and Weibel [10, 8], and study some of the mechanics behind its construction. We show first that the 5-dimensional polytope with which Santos begins his construction is a counterexample to the nonrevisiting conjecture [7, 6]. If Santos and Weibel's counterexamples were simple, then repeated wedging arXiv:1501.02517v2 [math.CO] 1 Mar 2015 would produce a corresponding counterexample to the Hirsch conjecture [7]. Since the counterexample to the nonrevisiting conjecture is not simple, we need an alternate method to produce the corresponding counterexample to the Hirsch conjecture, and the perturbed wedge provides this method.
    [Show full text]