Matematiska Kollokviets Tidigare Seminarier

Total Page:16

File Type:pdf, Size:1020Kb

Matematiska Kollokviets Tidigare Seminarier Matematiska kollokviet - Linköpings universitet https://liu.se/artikel/matematiska-kollokviet 0nsdag 18 december 2019, Antonio F. Costa, UNED, Madrid, Spanien Titel: Concepts in Geometry and Topology Illustrated Using Decorations of Islamic Art Sammanfattning: Islamic art, because of its abstract character, is particularly well suited to exemplify some mathematical concepts. We'll start by remembering one of the most well- known and controversial subject: the appearance in this art of all possible euclidean planar crystalline symmetry. Other recent discoveries, as the presence of quasi-crystals, and examples of relations with mathematical concepts will also be exhibited. 0nsdag 11 december 2019, Joakim Arnlind, Matematiska institutionen, Linkopings universitet Titel: Projective modules over the noncommutative cylinder Sammanfattning: I will give an introduction to the noncommutative cylinder, which is a simple example of a non-compact noncommutative manifold. Finitely generated projective modules over a noncommutative algebra correspond to vector bundles in classical geometry, and we present explicit projectors generating the so called K-theory of the noncommutative cylinder. Furthermore, as everyone might not be familiar with the basic ideas of noncommutative geometry, I will try to motivate and explain several of the concepts as they appear in this context. 0nsdag 4 december 2019, Hans Lundmark, Matematiska institutionen, Linkopings universitet Titel: Peakon solutions of the Novikov and Geng–Xue equations Sammanfattning: Peakons (short for peaked solitons) are solutions of a particular form admitted by certain integrable partial differential equations. These solutions consist of a train of peak-shaped waves that interact with each other in a nonlinear way. The most well-known of these PDEs with peakon solutions is the Camassa–Holm shallow water equation from 1993, but there are several others, such as the Degasperis–Procesi equation and two of its close mathematical relatives which I will focus on in particular in this talk, namely the Novikov equation and the Geng–Xue equation. All these equations are similar in many respects, but they also have interesting differences, for example regarding how regular the solutions need to be, and how solutions can be continued past a singularity where some kind of breakdown occurs. Explicit formulas for the peakon solutions are known, and with their aid one can for example study in detail the kind of wave-breaking that takes place when a positive-amplitude peakon collides with a negative-amplitude antipeakon. This is particularly interesting for the Novikov equation, whose peakon-antipeakon solutions display a much wider array of behaviours than usual, including the possibility of several peakons and antipeakons travelling together in breather-like clusters. The Geng–Xue equation is interesting in a different way. It is a two-component system, with many possible inequivalent configurations depending on the order in which the peakons appear in the two components. The solution formulas describing an arbitrary configuration are very intricate and have been derived only recently, relying not Matematiska kollokviet - Linköpings universitet https://liu.se/artikel/matematiska-kollokviet only on the usual inverse spectral techniques, but also (crucially) on a certain limiting procedure for turning peakons into “ghostpeakons” with amplitude zero. This talk is based on joint works with Jacek Szmigielski, Marcus Kardell, Budor Shuaib and Andy Hone. Mcindag 25 november 2019, Yasunao Hattori, Shimane University, Japan Titel: Interaction between domain theory and topology Sammanfattning: In the talk, I will give a brief survey on the interaction between domain theory and topology. Recall that the domain theory studies order structures on (continuous) partial ordered sets (posets). A domain (= a continuous directed complete poset) D is called a computational model for a topological space X if the set M(D) of maximal elements of D with the Scott topology is homeomorphic to X . A space X is said to be domain-representable if X has a computational model. In 1981 Weihrauch and Schreiber introduced a set of formal balls for a metric space X , and showed that is a computational model for X if X is complete, i.e. every complete metric space is domain-representable. So I will suggest some results on the domain-representable spaces (in particular, the real line) and show a relationship among several topologies on the sets of (generalized) formal balls for (generalized) metric spaces. 0nsdag 20 november 2019, Mario Natiello, Lunds universitet Titel: Winged promises or biological contamination? Modelling genetic diffusion in the RIDL- SIT technique Sammanfattning: Recently, the RIDL-SIT technology has been field-tested for control of Aedes aegypti. The technique consists of releasing genetically modified mosquitoes carrying a “lethal gene”. In 2016 the World Health Organisation (WHO) and the Pan-American Health Organization (PAHO) recommend to their constituent countries to test the new technologies proposed to control Aedes aegypti populations. However, issues concerning effectiveness and ecological impact have not been thoroughly studied so far. In order to study these issues, we develop an ecological model compatible with the information available as of 2016. It presents an interdependent dynamics of mosquito populations and food in an homogeneous setting. Mosquito populations are described in an stochastic compartmental setup in terms of reaction norms depending on the available food in the environment. The development of the model allows us to indicate some critical biological knowledge that is missing and could (should) be produced. Hybridisation levels, release numbers during and after intervention and population recovery time after the intervention as a function of intervention duration and target are calculated under different hypotheses with regard to the fitness of hybrids and compared with two field studies of actual interventions. The minimal model should serve as a basis for detaile models when the necessary information to construct them is produced. For the time being, the model shows that nature will not clean the non-lethal introgressed genes. Joint work with H.G. Solari, Buenos Aires, Argentina. 0nsdag 13 november 2019, Sara Moad Sasane, Lunds universitet Titel: Monotone smoothing splines with bounds Matematiska kollokviet - Linköpings universitet https://liu.se/artikel/matematiska-kollokviet Sammanfattning: Splines are functions that are used to interpolate between data points. We distinguish between interpolating splines and smoothing splines. Interpolating splines are curves that interpolate between the data points and at the same time are as smooth as possible. The name comes from the drawing tool wooden spline, that was previously used to construct ships and aeroplanes. Smoothing splines are used when there are measuring errors, and it is not desirable to force the curve to pass exactly through the data points. Instead, the aim is to find a smooth curve which comes close to these points while being as little bent as possible (in a sense that wíll be made precise in the talk). Monotone smoothing splines are curves that solve a similar minimization problem but where the feasible set of functions also satisfy a monotonicity condition. I will discuss this problem from a calculus of variations point of view, and show that it can be reformulated as a finite dimensional problem which can be solved with optimization techniques. 0nsdag 30 oktober 2019, Sebastian Reyes Carocca, Universidad de la Frontera CTemucoJ, Chile Titel: On Riemann surfaces and Jacobian varieties with automorphisms Sammanfattning: Let a be an integer greater than 2. A classification of compact Riemann surfaces of genus g with a(g-1) automorphisms is known under the assumption that g-1 is a prime number. In this talk we shall discuss some recent results concerning the same classification problem for a=3 and when g-1 is assumed to be the square of a prime number. We also show interesting relations which induces the corresponding group action on the associated Jacobian varieties. This is a joint work (in progress) with Angel Carocca. 0nsdag 23 oktober 2019, Erik Lindgren, Uppsala universitet Titel: Nonlinear nonlocal equations Sammanfattning: In this talk, I will discuss some classes of nonlocal or fractional partial differential equations. In particular, I will describe recent developments for fractional versions of equations such as the p-Laplace equation. 0nsdag 16 oktober 2019, Marc Mars, University of Salamanca, Spanien Titel: Kerr-de Sitter spacetime and conformal infinity Sammanfattning: In this talk I will present several results concerning the characterization of the Kerr-de Sitter spacetime in terms of the asymptotic data at null infinity. This is relatively recent joint work with Paetz and Senovilla, and partially Simon. The first part of the talk is intended to be introductory: after reviewing the Kerr-de Sitter metric and recalling standard results on the initial value problem in General Relativity, I will discuss the initial value problem at past null infinity for the EFE with positive cosmological constant, as well as the notion of asymptotic Killing initial data. In the second part I will present the characterization results at infinity of Kerr-de Sitter based on a previous local spacetime characterization of this metric. Matematiska kollokviet - Linköpings universitet https://liu.se/artikel/matematiska-kollokviet
Recommended publications
  • Kissing Numbers: Surprises in Dimension Four Günter M
    Kissing numbers: Surprises in Dimension Four Günter M. Ziegler, TU Berlin The “kissing number problem” is a basic geometric problem that got its name from billards: Two balls “kiss” if they touch. The kissing number problem asks how many other balls can touch one given ball at the same time. If you arrange the balls on a pool ta- ble, it is easy to see that the answer is exactly six: Six balls just perfectly surround a given ball. Graphic: Detlev Stalling, ZIB Berlin and at the same time Vladimir I. Levenstein˘ in Russia proved that the correct, exact maximal numbers for the kissing number prob- lem are 240 in dimension 8, and 196560 in dimension 24. This is amazing, because these are also the only two dimensions where one knows a precise answer. It depends on the fact that mathemati- cians know very remarkable configurations in dimensions 8 and 24, which they call the E8 lattice and the Leech lattice, respectively. If, however, you think about this as a three-dimensional problem, So the kissing number problem remained unsolved, in particular, the question “how many balls can touch a given ball at the same for the case of dimension four. The so-called 24-cell, a four- time” becomes much more interesting — and quite complicated. In dimensional “platonic solid” of remarkable beauty (next page), fact, The 17th century scientific genius Sir Isaac Newton and his yields a configuration of 24 balls that would touch a given one in colleague David Gregory had a controversy about this in 1694 — four-dimensional space.
    [Show full text]
  • Gazette Des Mathématiciens
    JUILLET 2018 – No 157 la Gazette des Mathématiciens • Autour du Prix Fermat • Mathématiques – Processus ponctuels déterminantaux • Raconte-moi... le champ libre gaussien • Tribune libre – Quelle(s) application(s) pour le plan Torossian-Villani la GazetteComité de rédaction des Mathématiciens Rédacteur en chef Sébastien Gouëzel Boris Adamczewski Université de Nantes Institut Camille Jordan, Lyon [email protected] [email protected] Sophie Grivaux Rédacteurs Université de Lille [email protected] Thomas Alazard École Normale Supérieure de Paris-Saclay [email protected] Fanny Kassel IHÉS Maxime Bourrigan [email protected] Lycée Saint-Geneviève, Versailles [email protected] Pauline Lafitte Christophe Eckès École Centrale, Paris Archives Henri Poincaré, Nancy [email protected] [email protected] Damien Gayet Romain Tessera Institut Fourier, Grenoble Université Paris-Sud [email protected] [email protected] Secrétariat de rédaction : smf – Claire Ropartz Institut Henri Poincaré 11 rue Pierre et Marie Curie 75231 Paris cedex 05 Tél. : 01 44 27 67 96 – Fax : 01 40 46 90 96 [email protected] – http://smf.emath.fr Directeur de la publication : Stéphane Seuret issn : 0224-8999 À propos de la couverture. Cette image réalisée par Alejandro Rivera (Institut Fourier) est le graphe de la partie positive du champ libre gaussien sur le tore plat 2=(2á2) projeté sur la somme des espaces propres du laplacien de valeur propre plus petite que 500. Les textures et couleurs ajoutées sur le graphe sont pure- ment décoratives. La fonction a été calculée avec C++ comme une somme de polynômes trigonométriques avec des poids aléatoires bien choisis, le graphe a été réalisé sur Python et les textures et couleurs ont été réalisées avec gimp.
    [Show full text]
  • Local Covering Optimality of Lattices: Leech Lattice Versus Root Lattice E8
    Local Covering Optimality of Lattices: Leech Lattice versus Root Lattice E8 Achill Sch¨urmann, Frank Vallentin ∗ 10th November 2004 Abstract We show that the Leech lattice gives a sphere covering which is locally least dense among lattice coverings. We show that a similar result is false for the root lattice E8. For this we construct a less dense covering lattice whose Delone subdivision has a common refinement with the Delone subdivision of E8. The new lattice yields a sphere covering which is more than 12% less dense than the formerly ∗ best known given by the lattice A8. Currently, the Leech lattice is the first and only known example of a locally optimal lattice covering having a non-simplicial Delone subdivision. We hereby in particular answer a question of Dickson posed in 1968. By showing that the Leech lattice is rigid our answer is even strongest possible in a sense. 1 Introduction The Leech lattice is the exceptional lattice in dimension 24. Soon after its discovery by Leech [Lee67] it was conjectured that it is extremal for several geometric problems in R24: the kissing number problem, the sphere packing problem and the sphere covering problem. In 1979, Odlyzko and Sloane and independently Levenshtein solved the kissing number problem in dimension 24 by showing that the Leech lattice gives an optimal solution. Two years later, Bannai and Sloane showed that it gives the unique solution up to isometries (see [CS88], Ch. 13, 14). Unlike the kissing number problem, the other two problems are still open. Recently, Cohn and Kumar [CK04] showed that the Leech lattice gives the unique densest lattice sphere packing in R24.
    [Show full text]
  • The BEST WRITING on MATHEMATICS
    The BEST WRITING on MATHEMATICS 2012 The BEST WRITING on MATHEMATICS 2012 Mircea Pitici, Editor FOREWORD BY DAVID MUMFORD P RI NC E TO N U N IVER S I T Y P RE SS P RI NC E TO N A N D OX FORD Copyright © 2013 by Princeton University Press Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TW press.princeton.edu All Rights Reserved ISBN 978- 0- 691-15655-2 This book has been composed in Perpetua Printed on acid- free paper. ∞ Printed in the United States of America 1 3 5 7 9 10 8 6 4 2 For my parents Contents Foreword: The Synergy of Pure and Applied Mathematics, of the Abstract and the Concrete DAVID MUMFORD ix Introduction MIRCEA PITICI xvii Why Math Works MARIO LIVIO 1 Is Mathematics Discovered or Invented? TIMOTHY GOWERS 8 The Unplanned Impact of Mathematics PETER ROWLETT 21 An Adventure in the Nth Dimension BRIAN HAYES 30 Structure and Randomness in the Prime Numbers TERENCE TAO 43 The Strangest Numbers in String Theory JOHN C. BAEZ AND JOHN HUERTA 50 Mathematics Meets Photography: The Viewable Sphere DAVID SWART AND BRUCE TORRENCE 61 Dancing Mathematics and the Mathematics of Dance SARAH- MARIE BELCASTRO AND KARL SCHAFFER 79 Can One Hear the Sound of a Theorem? ROB SCHNEIDERMAN 93 Flat- Unfoldability and Woven Origami Tessellations ROBERT J. LANG 113 A Continuous Path from High School Calculus to University Analysis TIMOTHY GOWERS 129 viii Contents Mathematics Teachers’ Subtle, Complex Disciplinary Knowledge BRENT DAVIS 135 How to Be a Good Teacher Is an Undecidable Problem ERICA FLAPAN 141 How Your Philosophy of Mathematics Impacts Your Teaching BONNIE GOLD 149 Variables in Mathematics Education SUSANNA S.
    [Show full text]
  • Mathematical Circus & 'Martin Gardner
    MARTIN GARDNE MATHEMATICAL ;MATH EMATICAL ASSOCIATION J OF AMERICA MATHEMATICAL CIRCUS & 'MARTIN GARDNER THE MATHEMATICAL ASSOCIATION OF AMERICA Washington, DC 1992 MATHEMATICAL More Puzzles, Games, Paradoxes, and Other Mathematical Entertainments from Scientific American with a Preface by Donald Knuth, A Postscript, from the Author, and a new Bibliography by Mr. Gardner, Thoughts from Readers, and 105 Drawings and Published in the United States of America by The Mathematical Association of America Copyright O 1968,1969,1970,1971,1979,1981,1992by Martin Gardner. All riglhts reserved under International and Pan-American Copyright Conventions. An MAA Spectrum book This book was updated and revised from the 1981 edition published by Vantage Books, New York. Most of this book originally appeared in slightly different form in Scientific American. Library of Congress Catalog Card Number 92-060996 ISBN 0-88385-506-2 Manufactured in the United States of America For Donald E. Knuth, extraordinary mathematician, computer scientist, writer, musician, humorist, recreational math buff, and much more SPECTRUM SERIES Published by THE MATHEMATICAL ASSOCIATION OF AMERICA Committee on Publications ANDREW STERRETT, JR.,Chairman Spectrum Editorial Board ROGER HORN, Chairman SABRA ANDERSON BART BRADEN UNDERWOOD DUDLEY HUGH M. EDGAR JEANNE LADUKE LESTER H. LANGE MARY PARKER MPP.a (@ SPECTRUM Also by Martin Gardner from The Mathematical Association of America 1529 Eighteenth Street, N.W. Washington, D. C. 20036 (202) 387- 5200 Riddles of the Sphinx and Other Mathematical Puzzle Tales Mathematical Carnival Mathematical Magic Show Contents Preface xi .. Introduction Xlll 1. Optical Illusions 3 Answers on page 14 2. Matches 16 Answers on page 27 3.
    [Show full text]
  • Basic Understanding of Condensed Phases of Matter Via Packing Models S
    Perspective: Basic understanding of condensed phases of matter via packing models S. Torquato Citation: The Journal of Chemical Physics 149, 020901 (2018); doi: 10.1063/1.5036657 View online: https://doi.org/10.1063/1.5036657 View Table of Contents: http://aip.scitation.org/toc/jcp/149/2 Published by the American Institute of Physics Articles you may be interested in Announcement: Top reviewers for The Journal of Chemical Physics 2017 The Journal of Chemical Physics 149, 010201 (2018); 10.1063/1.5043197 Perspective: How to understand electronic friction The Journal of Chemical Physics 148, 230901 (2018); 10.1063/1.5035412 Aqueous solvation from the water perspective The Journal of Chemical Physics 148, 234505 (2018); 10.1063/1.5034225 Perspective: Ring-polymer instanton theory The Journal of Chemical Physics 148, 200901 (2018); 10.1063/1.5028352 Communication: Contact values of pair distribution functions in colloidal hard disks by test-particle insertion The Journal of Chemical Physics 148, 241102 (2018); 10.1063/1.5038668 Adaptive resolution molecular dynamics technique: Down to the essential The Journal of Chemical Physics 149, 024104 (2018); 10.1063/1.5031206 THE JOURNAL OF CHEMICAL PHYSICS 149, 020901 (2018) Perspective: Basic understanding of condensed phases of matter via packing models S. Torquatoa) Department of Chemistry, Department of Physics, Princeton Center for Theoretical Science, Princeton Institute for the Science and Technology of Materials, and Program in Applied and Computational Mathematics, Princeton University, Princeton, New Jersey 08544, USA (Received 17 April 2018; accepted 14 June 2018; published online 10 July 2018) Packing problems have been a source of fascination for millennia and their study has produced a rich literature that spans numerous disciplines.
    [Show full text]
  • Sphere Packing, Lattice Packing, and Related Problems
    Sphere packing, lattice packing, and related problems Abhinav Kumar Stony Brook April 25, 2018 Sphere packings Definition n A sphere packing in R is a collection of spheres/balls of equal size which do not overlap (except for touching). The density of a sphere packing is the volume fraction of space occupied by the balls. ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ ~ In dimension 1, we can achieve density 1 by laying intervals end to end. In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 1, we can achieve density 1 by laying intervals end to end. Sphere packing problem n Problem: Find a/the densest sphere packing(s) in R . In dimension 1, we can achieve density 1 by laying intervals end to end. In dimension 2, the best possible is by using the hexagonal lattice. [Fejes T´oth1940] Sphere packing problem II In dimension 3, the best possible way is to stack layers of the solution in 2 dimensions. This is Kepler's conjecture, now a theorem of Hales and collaborators. mmm m mmm m There are infinitely (in fact, uncountably) many ways of doing this! These are the Barlow packings. Face centered cubic packing Image: Greg A L (Wikipedia), CC BY-SA 3.0 license But (until very recently!) no proofs. In very high dimensions (say ≥ 1000) densest packings are likely to be close to disordered.
    [Show full text]
  • Contemporary Mathematics 442
    CONTEMPORARY MATHEMATICS 442 Lie Algebras, Vertex Operator Algebras and Their Applications International Conference in Honor of James Lepowsky and Robert Wilson on Their Sixtieth Birthdays May 17-21, 2005 North Carolina State University Raleigh, North Carolina Yi-Zhi Huang Kailash C. Misra Editors http://dx.doi.org/10.1090/conm/442 Lie Algebras, Vertex Operator Algebras and Their Applications In honor of James Lepowsky and Robert Wilson on their sixtieth birthdays CoNTEMPORARY MATHEMATICS 442 Lie Algebras, Vertex Operator Algebras and Their Applications International Conference in Honor of James Lepowsky and Robert Wilson on Their Sixtieth Birthdays May 17-21, 2005 North Carolina State University Raleigh, North Carolina Yi-Zhi Huang Kailash C. Misra Editors American Mathematical Society Providence, Rhode Island Editorial Board Dennis DeTurck, managing editor George Andrews Andreas Blass Abel Klein 2000 Mathematics Subject Classification. Primary 17810, 17837, 17850, 17865, 17867, 17868, 17869, 81T40, 82823. Photograph of James Lepowsky and Robert Wilson is courtesy of Yi-Zhi Huang. Library of Congress Cataloging-in-Publication Data Lie algebras, vertex operator algebras and their applications : an international conference in honor of James Lepowsky and Robert L. Wilson on their sixtieth birthdays, May 17-21, 2005, North Carolina State University, Raleigh, North Carolina / Yi-Zhi Huang, Kailash Misra, editors. p. em. ~(Contemporary mathematics, ISSN 0271-4132: v. 442) Includes bibliographical references. ISBN-13: 978-0-8218-3986-7 (alk. paper) ISBN-10: 0-8218-3986-1 (alk. paper) 1. Lie algebras~Congresses. 2. Vertex operator algebras. 3. Representations of algebras~ Congresses. I. Leposwky, J. (James). II. Wilson, Robert L., 1946- III. Huang, Yi-Zhi, 1959- IV.
    [Show full text]
  • New Upper Bounds for Kissing Numbers from Semidefinite Programming
    JOURNAL OF THE AMERICAN MATHEMATICAL SOCIETY Volume 21, Number 3, July 2008, Pages 909–924 S 0894-0347(07)00589-9 Article electronically published on November 29, 2007 NEW UPPER BOUNDS FOR KISSING NUMBERS FROM SEMIDEFINITE PROGRAMMING CHRISTINE BACHOC AND FRANK VALLENTIN 1. Introduction In geometry, the kissing number problem asks for the maximum number τn of unit spheres that can simultaneously touch the unit sphere in n-dimensional Euclidean space without pairwise overlapping. The value of τn is only known for n =1, 2, 3, 4, 8, 24. While its determination for n =1, 2 is trivial, it is not the case for other values of n. The case n = 3 was the object of a famous discussion between Isaac Newton and David Gregory in 1694. For a historical perspective of this discussion we refer to [6]. The first valid proof of the fact “τ3 = 12”, as in the icosahedron configuration, was only given in 1953 by K. Sch¨utte and B.L. van der Waerden in [23]. In the 1970s, P. Delsarte developed a method, initially aimed at bounding codes on finite fields (see [8]) that yields an upper bound for τn as a solution of a linear program and more generally yields an upper bound for the size of spherical codes of given minimal distance. We shall refer to this method as the LP method. With this method, A.M. Odlyzko and N.J.A. Sloane ([16]), and independently V.I. Leven- shtein ([14]), proved τ8 = 240 and τ24 = 196560 which are, respectively, the number of shortest vectors in the root lattice E8 and in the Leech lattice.
    [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]
  • Random Packing of Colloids and Granular Matter
    Random packing of colloids and granular matter ISBN 0 Subject headings: random packing/hard spheres/spherocylinders/cut spheres/spheroids/granular matter/colloids/computer simulation. Random packing of colloids and granular matter Willekeurige stapeling van colloijdenen granulaire materie (met een samenvatting in het Nederlands) Proefschrift ter verkrijging van de graad van doctor aan de Universiteit Utrecht op gezag van de rector magni¯cus, prof. dr. J. C. Stoof, ingevolge het besluit van het college voor promoties in het openbaar te verdedigen op maandag 18 februari 2008 des ochtends te 10.30 uur door Alan Wouterse geboren op 29 december 1978 te Utrecht Promotor: Prof. dr. A.P. Philipse This work is part of the Granular Matter programme of the `Stichting voor Funda- menteel Onderzoek der Materie (FOM)', ¯nancially supported by the `Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)'. Contents Chapter 1. Introduction 1 Chapter 2. Random particle packings: A review 3 2.1. Introduction 3 2.2. Random packing of particles 4 2.3. Random packing of spheres 11 2.4. Theory 14 2.5. Simulations 18 2.6. Summary and conclusions for sphere packings 24 2.7. Non-spherical particles 25 2.8. Theory 28 2.9. Simulations 31 2.10. Methods for non-spherical particles 31 2.11. Summary and conclusions for non-spherical particle packings 34 Chapter 3. On the caging number of two- and three-dimensional hard spheres 37 3.1. Introduction 38 3.2. Caging by uncorrelated contacts 39 3.3. Caging by three hard disks 41 3.4. Caging and parking numbers for hard disks of di®erent size 44 3.5.
    [Show full text]
  • Math.CV] 25 Oct 2010 H 97Bo Frsac Rbescletdadeie Yw Haym W
    Borcea’s variance conjectures on the critical points of polynomials Dmitry Khavinson, Rajesh Pereira, Mihai Putinar, Edward B. Saff and Serguei Shimorin Julius Borcea, in memoriam Abstract. Closely following recent ideas of J. Borcea, we discuss various mod- ifications and relaxations of Sendov’s conjecture about the location of critical points of a polynomial with complex coefficients. The resulting open problems are formulated in terms of matrix theory, mathematical statistics or potential theory. Quite a few links between classical works in the geometry of polynomi- als and recent advances in the location of spectra of small rank perturbations of structured matrices are established. A couple of simple examples provide natural and sometimes sharp bounds for the proposed conjectures. Mathematics Subject Classification (2000). Primary 12D10; Secondary 26C10, 30C10, 15A42, 15B05. Keywords. Sendov conjecture, Hausdorff distance, critical point, differentiator, variance, Chebyshev radius, Cauchy transform. 1. Introduction In 1958, while working as an assistant to Professor N. Obreshkov, Blagovest Sendov raised the following question. Assume that all zeros of a polynomial F with complex coefficients lie in the closed unit disk. Is it true that there exists a critical point in arXiv:1010.5167v1 [math.CV] 25 Oct 2010 every disk of radius one centered at a zero of F ? The conjecture was included in the 1967 book of research problems collected and edited by W. Hayman [32]. The This work was completed with the support of the American Institute of Mathematics, Palo Alto. D. Khavinson, M. Putinar and E. Saff also gratefully acknowledge the support by the National Science Foundation, through the grants DMS-0855597, DMS-1001071 and DMS-0808093, respec- tively.
    [Show full text]