DOCSLIB.ORG

Annual Report 2004-2005

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Annual Report 2004-2005 CORNELL UNIVERSITY DEPARTMENT OF MATHEMATICS ANNUAL REPORT 2004–2005 The Department of Mathematics at Cornell University is known throughout the world for its distinguished faculty and stimulating mathematical atmosphere. There are close to 40 tenured and tenure-track faculty — representing a broad spectrum of current mathematical research — a lively group of postdoctoral fellows and frequent research and teaching visitors. The graduate program includes over 70 graduate students from many different countries. The undergraduate program includes several math major programs, and the department offers a wide selection of courses for all types of users of mathematics. The Cornell Mathematics Department is part of the College of Arts and Sciences, one of the endowed (or private) units of Cornell, which includes 50 departments and programs in the humanities, social sciences, and the physical and natural sciences. There are approximately 19,500 students at Cornell, of which nearly 14,000 are undergraduates. Cornell University is situated on a hill between two spectacular gorges that run down to Cayuga Lake in the beautiful Finger Lakes region of New York state. After 110 years in White Hall, the department moved to newly renovated Malott Hall, in the center of the Cornell campus. Renovation of Malott Hall was completed in 1999 to the specifications of the department. Its amenities include a spacious Mathematics Library, which houses one of the most extensive mathematics collections in the country, seminar rooms, classrooms and lecture rooms of all sizes, state-of-the-art computer facilities, and a large lounge with comfortable furniture and wall-to-wall blackboards. Department Chair: Prof. Kenneth Brown Director of Undergraduate Studies (DUS): Prof. Allen Hatcher Director of Graduate Studies (DGS): Prof. Michael Stillman Director of Teaching Assistant Programs: Dr. Maria Terrell Administrative Manager: Colette Walls Department of Mathematics, 310 Malott Hall, Cornell University, Ithaca, NY 14853-4201 Phone: (607) 255-4013 • Fax: (607) 255-7149 • email: [email protected] August 2, 2005 Dear friends and colleagues, Cornell’s faculty is its most important resource. We are very fortunate to have a distinguished faculty in the Mathematics Department (see the list of recent awards on p. 1), and my highest priority as department chair is to do whatever I can to keep it that way. For this reason, the main thing I want to talk about in this letter is the state of our faculty, especially our hiring efforts. In last year’s annual report, I mentioned the tragic death of José (Chepe) Escobar in January 2004, at the age of 49. This was a great personal loss to those who were close to him. In addition, the loss of Chepe left a big hole in our department. Chepe’s area of research was geometric analysis, in which methods of calculus are applied to geometric problems. This area has become quite prominent recently because of the announced solution by Grigory Perelman of the celebrated Poincaré conjecture, using methods of geometric analysis. We tried very hard this year to hire a replacement for Chepe. We had an outstanding candidate, and we had the support of administrators at the highest level. Unfortunately, she ultimately turned down our offer. We will try again during the coming year. On the other hand, we were successful in recruiting a distinguished young logician, Greg Hjorth, who will be joining our faculty on January 1, 2006. Greg got his Ph.D. at Berkeley in 1993. He won the Sacks prize in 1994 for the best thesis in logic worldwide. After a postdoc at Caltech, Greg moved to UCLA, where he rose quickly, becoming a full professor in 2001. He won a Sloan Fellowship in 1997, was an invited speaker at the International Congress of Mathematicians in 1998 and, with his coauthor Alexander Kechris, won the Karp Prize in 2003. The Karp Prize is given every five years and is the major award in logic. We are delighted that Greg is joining our department. Our other hiring this year also went very well. We hired several new postdocs (non-tenure-track assistant professors), and we hired a new tenure-track assistant professor, Tara Holm. Tara’s area of research is symplectic geometry, and I expect her to interact with many of our existing faculty members. Her appointment started July 1, 2005, but she will take her first year on leave at the University of Connecticut. We look forward to having her here in Ithaca for the 2006–2007 academic year. In addition, we have a new associate professor, Yuri Berest, who was promoted on July 1, 2005. Yuri works in noncommutative algebraic geometry, an emerging area with close ties to mathematical physics. It is a pleasure to welcome Yuri to the tenured faculty. Cliff Earle retired on December 31, 2004, after 39 years in the department, including three as department chair. Cliff has had a distinguished career working in complex analysis, in which he has published over 70 papers so far. I suspect that retirement for him just means that he will be able to spend even more time on his research. Indeed, during the past 7 years when he’s been officially half time (on phased retirement), his research output has been better than ever. I wish him the best of luck in this new phase of his career, as professor emeritus. Eugene Dynkin is also entering a new phase of his long and distinguished career. As of July 1, 2005, he is tapering off to a half-time appointment. Again, we all wish him the best of luck. I also want to send best wishes to Administrative Manager Colette Walls, who is moving to the Department of Romance Studies (see p. 5). Colette has been invaluable to me during my three years as chair. I will miss her sound judgment and her mastery at managing the finances of this complicated department. Colette has been the leader of an outstanding staff; they play a vital role in helping the faculty carry out the teaching, research, and service missions of the department. Colette is being replaced by Bill Gilligan. Bill has been at Cornell since 1986 in various jobs related to finance and budget, and he has served as director of finance and budget for the Arts College for the past 5 years. Having worked closely with managers in departments across campus, Bill has a clear idea of the issues facing a large, complex department like ours. I look forward to working with him. I have to report some very sad news about an alumnus, Raju Chelluri, who graduated in 1999 and died tragically in August 2004 at the age of 26. My heart goes out to his family and friends. I would like to thank them on behalf of the department for generously endowing the Chelluri Lecture Series in Raju's honor (see p. 6). We expect the first Chelluri Lecture to take place in spring 2006. I initially signed on for a three-year term as department chair. I have found the job very rewarding, and I am grateful that my colleagues are giving me the opportunity to serve a fourth year. Dan Barbasch will take over as chair in July 2006. As far as I know, this is the first time we have ever had a “chair elect” a year in advance. Dan and I will work together in the coming year to ensure a smooth transition. I could not do this job without help from a large number of people. I’ve already mentioned the staff support. Many faculty members have also made enormous efforts on behalf of the department. I'd like to single out a few in particular: • Maria Terrell, senior lecturer and director of teaching assistant programs, is a constant source of new ideas. Some of her experimental teaching innovations are described on pp. 16–17. This year her efforts on behalf of our teaching program were recognized by the Arts College, which gave her a Russell Distinguished Teaching Award (p. 16). • Rick Durrett has completed his fifth year as VIGRE director. He worked extremely hard on our unsuccessful attempt to get a new 5-year VIGRE grant (see p. 7). He also ran the Math Explorer’s Club (p. 46), which he revitalized last year. Rick will continue to lead the way as we apply again for a new VIGRE grant this fall. • Allen Hatcher has completed his first year as director of undergraduate studies. He brings new ideas and energy to the job, and it has been a pleasure to work with him. • Mike Stillman has completed his third year as director of graduate studies. Mike works hard on behalf of our graduate program, and I am very happy to say that he has agreed to serve a fourth year. Finally, I would like to wish former Cornell President Jeff Lehman the best of luck in whatever comes next for him. Jeff is an alumnus of the department, having graduated as a math major in 1977. I was as shocked as everyone else when he announced his resignation on June 11, after only two years as president. I had high hopes for his presidency, and I appreciated his accessibility to the faculty. Whatever his disagreements with the Board of Trustees might have been, this loss of a president after two years is a sad situation for Cornell. Sincerely yours, Ken Brown Table of Contents AWARDS AND HONORS 1 MATHEMATICS DEPARTMENT DIRECTORY 2004–2005 2 FACULTY, STAFF, AND GRADUATE STUDENT CHANGES FOR 2005–2006 4 GIFTS AND ENDOWMENTS 6 FACULTY RESEARCH AND PROFESSIONAL ACTIVITIES 7 Grants • VIGRE • The Jahrbuch Project • Faculty Editorships • 2004–2005 Faculty Publications TEACHING PROGRAM 13 Visiting Program • Summer Session 2004 Course Enrollment Statistics • Academic Year Course Enrollment Statistics • Teaching Awards • Writing Prize • Curriculum Changes • Instructional Technology Support • Mathematics Support Center
Load more

Recommended publications
  • Object Oriented Programming
    No. 52 March-A pril'1990 $3.95 T H E M TEe H CAL J 0 URN A L COPIA Object Oriented Programming First it was BASIC, then it was structures, now it's objects. C++ afi<;ionados feel, of course, that objects are so powerful, so encompassing that anything could be so defined. I hope they're not placing bets, because if they are, money's no object. C++ 2.0 page 8 An objective view of the newest C++. Training A Neural Network Now that you have a neural network what do you do with it? Part two of a fascinating series. Debugging C page 21 Pointers Using MEM Keep C fro111 (C)rashing your system. An AT Keyboard Interface Use an AT keyboard with your latest project. And More ... Understanding Logic Families EPROM Programming Speeding Up Your AT Keyboard ((CHAOS MADE TO ORDER~ Explore the Magnificent and Infinite World of Fractals with FRAC LS™ AN ELECTRONIC KALEIDOSCOPE OF NATURES GEOMETRYTM With FracTools, you can modify and play with any of the included images, or easily create new ones by marking a region in an existing image or entering the coordinates directly. Filter out areas of the display, change colors in any area, and animate the fractal to create gorgeous and mesmerizing images. Special effects include Strobe, Kaleidoscope, Stained Glass, Horizontal, Vertical and Diagonal Panning, and Mouse Movies. The most spectacular application is the creation of self-running Slide Shows. Include any PCX file from any of the popular "paint" programs. FracTools also includes a Slide Show Programming Language, to bring a higher degree of control to your shows.
    [Show full text]
  • Computability of Fraïssé Limits
    COMPUTABILITY OF FRA¨ISSE´ LIMITS BARBARA F. CSIMA, VALENTINA S. HARIZANOV, RUSSELL MILLER, AND ANTONIO MONTALBAN´ Abstract. Fra¨ıss´estudied countable structures S through analysis of the age of S, i.e., the set of all finitely generated substructures of S. We investigate the effectiveness of his analysis, considering effectively presented lists of finitely generated structures and asking when such a list is the age of a computable structure. We focus particularly on the Fra¨ıss´elimit. We also show that degree spectra of relations on a sufficiently nice Fra¨ıss´elimit are always upward closed unless the relation is definable by a quantifier-free formula. We give some sufficient or necessary conditions for a Fra¨ıss´elimit to be spectrally universal. As an application, we prove that the computable atomless Boolean algebra is spectrally universal. Contents 1. Introduction1 1.1. Classical results about Fra¨ıss´elimits and background definitions4 2. Computable Ages5 3. Computable Fra¨ıss´elimits8 3.1. Computable properties of Fra¨ıss´elimits8 3.2. Existence of computable Fra¨ıss´elimits9 4. Examples 15 5. Upward closure of degree spectra of relations 18 6. Necessary conditions for spectral universality 20 6.1. Local finiteness 20 6.2. Finite realizability 21 7. A sufficient condition for spectral universality 22 7.1. The countable atomless Boolean algebra 23 References 24 1. Introduction Computable model theory studies the algorithmic complexity of countable structures, of their isomorphisms, and of relations on such structures. Since algorithmic properties often depend on data presentation, in computable model theory classically isomorphic structures can have different computability-theoretic properties.
    [Show full text]
  • A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
    A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons Eric Berberich, Arno Eigenwillig, Michael Hemmer Susan Hert, Kurt Mehlhorn, and Elmar Schomer¨ [eric|arno|hemmer|hert|mehlhorn|schoemer]@mpi-sb.mpg.de Max-Planck-Institut fur¨ Informatik, Stuhlsatzenhausweg 85 66123 Saarbruck¨ en, Germany Abstract. We give an exact geometry kernel for conic arcs, algorithms for ex- act computation with low-degree algebraic numbers, and an algorithm for com- puting the arrangement of conic arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be obtained from linear or conic halfspaces (= the set of points where a linear or quadratic function is non-negative) by regularized boolean operations. The algorithm and its implementation are complete (they can handle all cases), exact (they give the mathematically correct result), and efficient (they can handle inputs with several hundred primitives). 1 Introduction We give an exact geometry kernel for conic arcs, algorithms for exact computation with low-degree algebraic numbers, and a sweep-line algorithm for computing arrangements of curved arcs that immediately leads to a realization of regularized boolean operations on conic polygons. A conic polygon, or polygon for short, is anything that can be ob- tained from linear or conic halfspaces (= the set of points where a linear or quadratic function is non-negative) by regularized boolean operations (Figure 1). A regularized boolean operation is a standard boolean operation (union, intersection, complement) followed by regularization. Regularization replaces a set by the closure of its interior and eliminates dangling low-dimensional features.
    [Show full text]
  • Average-Case Analysis of Algorithms and Data Structures L’Analyse En Moyenne Des Algorithmes Et Des Structures De DonnEes
    (page i) Average-Case Analysis of Algorithms and Data Structures L'analyse en moyenne des algorithmes et des structures de donn¶ees Je®rey Scott Vitter 1 and Philippe Flajolet 2 Abstract. This report is a contributed chapter to the Handbook of Theoretical Computer Science (North-Holland, 1990). Its aim is to describe the main mathematical methods and applications in the average-case analysis of algorithms and data structures. It comprises two parts: First, we present basic combinatorial enumerations based on symbolic methods and asymptotic methods with emphasis on complex analysis techniques (such as singularity analysis, saddle point, Mellin transforms). Next, we show how to apply these general methods to the analysis of sorting, searching, tree data structures, hashing, and dynamic algorithms. The emphasis is on algorithms for which exact \analytic models" can be derived. R¶esum¶e. Ce rapport est un chapitre qui para^³t dans le Handbook of Theoretical Com- puter Science (North-Holland, 1990). Son but est de d¶ecrire les principales m¶ethodes et applications de l'analyse de complexit¶e en moyenne des algorithmes. Il comprend deux parties. Tout d'abord, nous donnons une pr¶esentation des m¶ethodes de d¶enombrements combinatoires qui repose sur l'utilisation de m¶ethodes symboliques, ainsi que des tech- niques asymptotiques fond¶ees sur l'analyse complexe (analyse de singularit¶es, m¶ethode du col, transformation de Mellin). Ensuite, nous d¶ecrivons l'application de ces m¶ethodes g¶enerales a l'analyse du tri, de la recherche, de la manipulation d'arbres, du hachage et des algorithmes dynamiques.
    [Show full text]
  • The Beauty, Power and Future of Mathematics I Am Thrilled and at The
    The Beauty, Power and Future of Mathematics I am thrilled and at the same time humble to be honored by the Doctor Honoris Causa of the University Politehnica of Bucharest. Romania is a country with a very excellent tradition of mathematics at the very best. When I was in high school in Hong Kong, I read with care an elementary book by Popa with lucid explanation and colorful illustrations of basic mathematical concepts. During my undergraduate studies at Sir George Williams University in Montreal, a professor introduced me to Barbu’s works on nonlinear differential and integral equations. I should also mention that he introduced me to the book on linear partial differential operators by Hörmander. When I was a graduate student at the University of Toronto working under the supervision of Professor Atkinson, I learned Fredholm operators from him and the works of Foias and Voiculescu from the operator theory group. I was also influenced by the school of harmonic analysts led by E. M. Stein at Princeton. When I was a visiting professor at the University of California at Irvine, I learned from Martin Schechter of the works of Foias on nonlinear partial differential equations. This education path of mine points clearly to the influence of Romanian mathematics on me, the importance of knowing in depth different but related fields and my life‐long works on pseudo‐differential operators and related topics in mathematics and quantum physics. I chose to specialize in mathematics when I was in grade 10 at Kowloon Technical School in Hong Kong dated back to 1967, not least inspired by an inspiring teacher.
    [Show full text]
  • 31 Summary of Computability Theory
    CS:4330 Theory of Computation Spring 2018 Computability Theory Summary Haniel Barbosa Readings for this lecture Chapters 3-5 and Section 6.2 of [Sipser 1996], 3rd edition. A hierachy of languages n m B Regular: a b n n B Deterministic Context-free: a b n n n 2n B Context-free: a b [ a b n n n B Turing decidable: a b c B Turing recognizable: ATM 1 / 12 Why TMs? B In 1900: Hilbert posed 23 “challenge problems” in Mathematics The 10th problem: Devise a process according to which it can be decided by a finite number of operations if a given polynomial has an integral root. It became necessary to have a formal definition of “algorithms” to define their expressivity. 2 / 12 Church-Turing Thesis B In 1936 Church and Turing independently defined “algorithm”: I λ-calculus I Turing machines B Intuitive notion of algorithms = Turing machine algorithms B “Any process which could be naturally called an effective procedure can be realized by a Turing machine” th B We now know: Hilbert’s 10 problem is undecidable! 3 / 12 Algorithm as Turing Machine Definition (Algorithm) An algorithm is a decider TM in the standard representation. B The input to a TM is always a string. B If we want an object other than a string as input, we must first represent that object as a string. B Strings can easily represent polynomials, graphs, grammars, automata, and any combination of these objects. 4 / 12 How to determine decidability / Turing-recognizability? B Decidable / Turing-recognizable: I Present a TM that decides (recognizes) the language I If A is mapping reducible to
    [Show full text]
  • Design and Analysis of Algorithms Credits and Contact Hours: 3 Credits
    Course number and name: CS 07340: Design and Analysis of Algorithms Credits and contact hours: 3 credits. / 3 contact hours Faculty Coordinator: Andrea Lobo Text book, title, author, and year: The Design and Analysis of Algorithms, Anany Levitin, 2012. Specific course information Catalog description: In this course, students will learn to design and analyze efficient algorithms for sorting, searching, graphs, sets, matrices, and other applications. Students will also learn to recognize and prove NP- Completeness. Prerequisites: CS07210 Foundations of Computer Science and CS04222 Data Structures and Algorithms Type of Course: ☒ Required ☐ Elective ☐ Selected Elective Specific goals for the course 1. algorithm complexity. Students have analyzed the worst-case runtime complexity of algorithms including the quantification of resources required for computation of basic problems. o ABET (j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices 2. algorithm design. Students have applied multiple algorithm design strategies. o ABET (j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices 3. classic algorithms. Students have demonstrated understanding of algorithms for several well-known computer science problems o ABET (j) An ability to apply mathematical foundations, algorithmic principles, and computer science theory in the modeling and design of computer-based systems in a way that demonstrates comprehension of the tradeoffs involved in design choices and are able to implement these algorithms.
    [Show full text]
  • Issue 73 ISSN 1027-488X
    NEWSLETTER OF THE EUROPEAN MATHEMATICAL SOCIETY Feature History Interview ERCOM Hedgehogs Richard von Mises Mikhail Gromov IHP p. 11 p. 31 p. 19 p. 35 September 2009 Issue 73 ISSN 1027-488X S E European M M Mathematical E S Society Geometric Mechanics and Symmetry Oxford University Press is pleased to From Finite to Infinite Dimensions announce that all EMS members can benefit from a 20% discount on a large range of our Darryl D. Holm, Tanya Schmah, and Cristina Stoica Mathematics books. A graduate level text based partly on For more information please visit: lectures in geometry, mechanics, and symmetry given at Imperial College www.oup.co.uk/sale/science/ems London, this book links traditional classical mechanics texts and advanced modern mathematical treatments of the FORTHCOMING subject. Differential Equations with Linear 2009 | 460 pp Algebra Paperback | 978-0-19-921291-0 | £29.50 Matthew R. Boelkins, Jack L Goldberg, Hardback | 978-0-19-921290-3 | £65.00 and Merle C. Potter Explores the interplaybetween linear FORTHCOMING algebra and differential equations by Thermoelasticity with Finite Wave examining fundamental problems in elementary differential equations. This Speeds text is accessible to students who have Józef Ignaczak and Martin completed multivariable calculus and is appropriate for Ostoja-Starzewski courses in mathematics and engineering that study Extensively covers the mathematics of systems of differential equations. two leading theories of hyperbolic October 2009 | 464 pp thermoelasticity: the Lord-Shulman Hardback | 978-0-19-538586-1 | £52.00 theory, and the Green-Lindsay theory. Oxford Mathematical Monographs Introduction to Metric and October 2009 | 432 pp Topological Spaces Hardback | 978-0-19-954164-5 | £70.00 Second Edition Wilson A.
    [Show full text]
  • Language and Automata Theory and Applications
    LANGUAGE AND AUTOMATA THEORY AND APPLICATIONS Carlos Martín-Vide Characterization • It deals with the description of properties of sequences of symbols • Such an abstract characterization explains the interdisciplinary flavour of the field • The theory grew with the need of formalizing and describing the processes linked with the use of computers and communication devices, but its origins are within mathematical logic and linguistics A bit of history • Early roots in the work of logicians at the beginning of the XXth century: Emil Post, Alonzo Church, Alan Turing Developments motivated by the search for the foundations of the notion of proof in mathematics (Hilbert) • After the II World War: Claude Shannon, Stephen Kleene, John von Neumann Development of computers and telecommunications Interest in exploring the functions of the human brain • Late 50s XXth century: Noam Chomsky Formal methods to describe natural languages • Last decades Molecular biology considers the sequences of molecules formed by genomes as sequences of symbols on the alphabet of basic elements Interest in describing properties like repetitions of occurrences or similarity between sequences Chomsky hierarchy of languages • Finite-state or regular • Context-free • Context-sensitive • Recursively enumerable REG ⊂ CF ⊂ CS ⊂ RE Finite automata: origins • Warren McCulloch & Walter Pitts. A logical calculus of the ideas immanent in nervous activity. Bulletin of Mathematical Biophysics, 5:115-133, 1943 • Stephen C. Kleene. Representation of events in nerve nets and
    [Show full text]
  • Project-Team Virtual Plants Modeling Plant Morphogenesis from Genes To
    INSTITUT NATIONAL DE RECHERCHE EN INFORMATIQUE ET EN AUTOMATIQUE Project-Team Virtual Plants Modeling plant morphogenesis from genes to phenotype Sophia Antipolis THEME BIO c t i v it y ep o r t 2005 Table of contents 1. Team 1 2. Overall Objectives 2 2.1. Overall Objectives 2 3. Scientific Foundations 2 3.1. Analysis of structures resulting from meristem activity 2 3.2. Meristem functioning and development 3 3.3. A software platform for plant modeling 4 4. New Results 4 4.1. Analysis of structures resulting from meristem activity 4 4.1.1. Analysis of longitudinal count data and underdispersion 4 4.1.2. Growth synchronism between Aerial and Root Systems 4 4.1.3. Changes in branching structures within the whole plants 5 4.1.4. Growth components in trees 5 4.1.5. Markov switching models 5 4.1.6. Diagnostic tools for hidden Markovian models 5 4.1.7. Hidden Markov tree models for investigating physiological age within plants 6 4.1.8. Branching processes for plant development analysis 6 4.1.9. Self-similarity in plants 6 4.1.10. Reconstruction of plant foliage density from photographs 6 4.1.11. Fractal analysis of plant geometry 6 4.1.12. Light interception by canopy 7 4.1.13. Heritability of architectural traits 7 4.2. Meristem functioning and development 8 4.2.1. 3D surface reconstruction and cell lineage detection in shoot meristems 8 4.2.2. Simulation of auxin fluxes in the mersitem 8 4.2.3. Dynamic model of phyllotaxy based on auxin fluxes 8 4.2.4.
    [Show full text]
  • On Combinatorial Approximation Algorithms in Geometry Bruno Jartoux
    On combinatorial approximation algorithms in geometry Bruno Jartoux To cite this version: Bruno Jartoux. On combinatorial approximation algorithms in geometry. Distributed, Parallel, and Cluster Computing [cs.DC]. Université Paris-Est, 2018. English. NNT : 2018PESC1078. tel- 02066140 HAL Id: tel-02066140 https://pastel.archives-ouvertes.fr/tel-02066140 Submitted on 13 Mar 2019 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. Université Paris-Est École doctorale MSTIC On Combinatorial Sur les algorithmes d’approximation Approximation combinatoires Algorithms en géométrie in Geometry Bruno Jartoux Thèse de doctorat en informatique soutenue le 12 septembre 2018. Composition du jury : Lilian Buzer ESIEE Paris Jean Cardinal Université libre de Bruxelles président du jury Guilherme Dias da Fonseca Université Clermont Auvergne rapporteur Jesús A. de Loera University of California, Davis rapporteur Frédéric Meunier École nationale des ponts et chaussées Nabil H. Mustafa ESIEE Paris directeur Vera Sacristán Universitat Politècnica de Catalunya Kasturi R. Varadarajan The University of Iowa rapporteur Last revised 16th December 2018. Thèse préparée au laboratoire d’informatique Gaspard-Monge (LIGM), équipe A3SI, dans les locaux d’ESIEE Paris. LIGM UMR 8049 ESIEE Paris Cité Descartes, bâtiment Copernic Département IT 5, boulevard Descartes Cité Descartes Champs-sur-Marne 2, boulevard Blaise-Pascal 77454 Marne-la-Vallée Cedex 2 93162 Noisy-le-Grand Cedex Bruno Jartoux 2018.
    [Show full text]
  • A Gallery of De Rham Curves
    A Gallery of de Rham Curves Linas Vepstas <[email protected]> 20 August 2006 Abstract The de Rham curves are a set of fairly generic fractal curves exhibiting dyadic symmetry. Described by Georges de Rham in 1957[3], this set includes a number of the famous classical fractals, including the Koch snowflake, the Peano space- filling curve, the Cesàro-Faber curves, the Takagi-Landsberg[4] or blancmange curve, and the Lévy C-curve. This paper gives a brief review of the construction of these curves, demonstrates that the complete collection of linear affine deRham curves is a five-dimensional space, and then presents a collection of four dozen images exploring this space. These curves are interesting because they exhibit dyadic symmetry, with the dyadic symmetry monoid being an interesting subset of the group GL(2,Z). This is a companion article to several others[5][6] exploring the nature of this monoid in greater detail. 1 Introduction In a classic 1957 paper[3], Georges de Rham constructs a class of curves, and proves that these curves are everywhere continuous but are nowhere differentiable (more pre- cisely, are not differentiable at the rationals). In addition, he shows how the curves may be parameterized by a real number in the unit interval. The construction is simple. This section illustrates some of these curves. 2 2 2 2 Consider a pair of contracting maps of the plane d0 : R → R and d1 : R → R . By the Banach fixed point theorem, such contracting maps should have fixed points p0 and p1. Assume that each fixed point lies in the basin of attraction of the other map, and furthermore, that the one map applied to the fixed point of the other yields the same point, that is, d1(p0) = d0(p1) (1) These maps can then be used to construct a certain continuous curve between p0and p1.
    [Show full text]