DOCSLIB.ORG

Mathematics People

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Mathematics People Mathematics People V. Soucek (Czech Republic), S. Staples (United States), and Eelbode Awarded Clifford F. Brackx (Belgium, nonvoting secretary). Prize —Fred Brackx, Ghent University, Belgium David Eelbode of the University of Antwerp has been selected as the recipient of the second W. K. Clifford Prize “for his outstanding mathematical research achievements Spohn Awarded Cantor Medal in the fields of harmonic and Clifford analysis with ap- Herbert Spohn of the Technical University of Munich plications in theoretical physics.” According to the prize (TUM) has been awarded the 2014 Cantor Medal of the citation, he has “a beautiful and remarkable publishing German Mathematical Society (DMV). According to the record with papers in pure mathematics and theoretical prize citation, Spohn’s insights have had a decisive impact physics journals. Often cooperating with mathematics on the development of stochastic analysis and the theory centers of excellence around the world, he is a real ambas- of kinetic equations and on mathematical physics. He sador for mathematics through Clifford algebra, Clifford received his Ph.D. in 1975 from the University of Munich analysis and group representation theory. His chief contri- and is currently professor of applied probability theory bution has to be situated within the subject of higher spin at TUM. He was awarded the Dannie Heineman Prize operators: these are generalizations of the classical Dirac for Mathematical Physics in 2011. The Cantor Medal is operator from quantum mechanics, which can be used to awarded at most every two years and carries a cash award model the equations describing higher spin elementary of 4,000 euros (approximately US$5,400). particles. The use of Clifford analysis techniques hereby —From a DMV announcement has the advantage that the resulting function theory can be studied in orthogonal spaces of any dimension and any signature. This topic is also intimately connected to the 2014 Gödel Prize Awarded representation theory for both the conformal Lie algebra Three researchers in computer science have been awarded and certain transvector algebras.” Eelbode received his the 2014 Gödel Prize of the Association for Computing Ph.D. from Ghent University with a thesis titled “Clifford Machinery (ACM) Special Interest Group on Algorithms analysis on the hyperbolic unit ball.” He will deliver the and Computation Theory (SIGACT), together with the W. K. Clifford Prize Lecture at the University College Lon- European Association for Theoretical Computer Science don in November 2014. (EATCS). Ronald Fagin of IBM Research, Amnon Lotem, The International Conference on Clifford Algebras and an algorithms and technologies expert in the Israeli high- Their Applications in Mathematical Physics (ICCA) awards tech industry, and Moni Naor of the Weizmann Institute the Clifford Prize for excellence in research in theoreti- of Science were honored for their paper “Optimal ag- cal and applied Clifford algebras and their analysis and gregation algorithms for middleware”, which introduced geometry. The ICCA international conferences, organized the powerful “threshold algorithm” that is widely used in alternately in Europe and the Americas, are intended to applications and systems that demand optimal results for bring together the leading scientists and young research- gathering multisourced information. The prize citation ers in the field of Clifford algebras and their various reads: “Their paper provides a framework to design and applications in mathematics, physics, engineering, and analyze algorithms where aggregation of information from other applied sciences. W. K. Clifford is best remembered multiple data sources is needed, such as in information for what is now termed geometric algebra, a special case retrieval and machine learning. The threshold algorithm’s of the Clifford algebras named in his honor, but he also elegant mathematical properties and simplicity are par- contributed significantly to other branches of mathemat- ticularly suitable for use in middleware, software that is ics, especially geometry. The prize is intended for young often used to augment computer operating systems that researchers up to age thirty-five and carries a cash award support complex, distributed applications. The authors of 1,000 euros (approximately US$1,450). The first Clifford also introduced the notion of instance optimality, an Prize was awarded to Hendrik De Bie, Ghent University. extremely strong guarantee of performance, and showed The international W. K. Clifford Prize Committee that the threshold algorithm is instance optimal. The pa- included V. Abramov (Estonia), P. Anglès (France), per’s groundbreaking results have built a foundation for E. Bayro-Corrochano (Mexico), R. Da Rocha (Brazil), much follow-on research.” H. De Bie (Belgium), K. Gürlebeck (Germany), D. Hilden- The Gödel Prize includes an award of US$5,000 and is brand (Germany), T. Qian (China), I. Sabadini (Italy), named in honor of Kurt Gödel, who was born in Austria- SEPTEMBER 2014 NOTICES OF THE AMS 907 Mathematics People Hungary (now the Czech Republic) in 1906. Gödel’s work nine through twelve from more than seventy countries, has had immense impact upon scientific and philosophical regions, and territories participated in the world’s larg- thinking in the twentieth century. The award recognizes est precollege science research competition. The first fair his major contributions to mathematical logic and the was held in Philadelphia in 1950. In 1958, the fair became foundations of computer science. international when Japan, Canada, and Germany joined the competition. —From an ACM announcement Student finalists who competed at this year’s ISEF went through a multistep process to qualify and won all-ex- penses-paid trips to the fair. They qualify by winning local, Mkrtchyan Awarded Emil Artin regional, and state fairs in the United States or national sci- Junior Prize ence fairs abroad. In addition to numerous grand awards presented by the ISEF, more than sixty federal agencies Sevak Mkrtchyan of Carnegie Mellon University has been and professional and educational organizations, including awarded the 2014 Emil Artin Junior Prize in Mathematics. the American Mathematical Society (AMS), participated by Mkrtchyan was chosen for his paper “Entropy of Schur– giving special awards. Prizes given by the AMS included Weyl measures,” Annales de l’Institut Henri Poincaré, cash, certificates, AMS tote bags, and a booklet about Karl Probabilités et Statistiques 50 (2014), 678–713. Established Menger given to each award winner. in 2001, the Emil Artin Junior Prize in Mathematics car- For the AMS this was the twenty-sixth year of participa- ries a cash award of US$1,000 and is presented usually tion, and it was the twenty-fourth year of the presentation every year to a student or former student of an Armenian of the Karl Menger Awards. The Menger Awards Commit- educational institution under the age of thirty-five for tee consisted of Mihai Stoiciu, Williams College (Chair), outstanding contributions to algebra, geometry, topology, John Milton, The Claremont Colleges, and Daniel Dugger, and number theory—the fields in which Emil Artin made University of Oregon. The judges initially reviewed all proj- major contributions. The prize committee consisted of ects in mathematics, as well as a number of mathemati- A. Basmajian, Y. Movsisyan, and V. Pambuccian. cally oriented projects in computer science, physics, and engineering. From these entries they selected a subset of —Victor Pambuccian, New College, students who were interviewed for further consideration Arizona State University for Menger Prizes. The AMS gave awards to one first-place winner, two second-place winners, four third-place win- EMS Monograph Award ners, and honorable mentions to five others. Announced The Karl Menger Memorial Prize winners for 2014 are listed below, along with each student’s high school and The European Mathematical Society (EMS) has instituted project title. the EMS Monograph Award, to be given every two years to First Place Award (US$1,000): Nitya Mani, Harker the author(s) of a monograph in any area of mathematics School, San Jose, California, “Characterizing the n-division that is judged by the selection committee to be an out- points of genus–0 curves through straightedge and com- standing contribution to its field. In the inaugural year pass constructions.” of 2014, the recipients of the EMS Monograph Awards Second Place Awards (US$500): Kevin K. Lee, Univer- are Patrick Dehornoy (Université de Caen), Fran- sity High School, Irvine, California, “Strongly coupling the çois Digne (Université de Picardie Jules-Verne), Eddy electrical and mechanical dynamics of the heartbeat in a Godelle (Université de Caen), Daan Krammer (University diffuse interface model”; Sarah L. Shader, Laramie High of Warwick), and Jean Michel (Université Denis Diderot, School, Laramie, Wyoming, “Weighted Catalan numbers Paris 7) for their joint work “Foundations of Garside and their divisibility properties.” Theory” and to Augusto C. Ponce (Université Catholique Third Place Awards (US$250): Shahar Silberstein, de Louvain) for his work “Elliptic PDEs, Measures and Makif Alef, Be’er Sheva, Israel, “Hidden secrets in Cevian Capacities: From the Poisson Equation to Nonlinear triangles”; Ritesh N. Ragavender, South Brunswick High Thomas–Fermi Problems.” The prize carries a cash award School, Monmouth Junction, New Jersey, “Odd Dunkl of 10,000 euros (approximately US$13,600). The winning
Load more

Recommended publications
  • 500 Natural Sciences and Mathematics
    500 500 Natural sciences and mathematics Natural sciences: sciences that deal with matter and energy, or with objects and processes observable in nature Class here interdisciplinary works on natural and applied sciences Class natural history in 508. Class scientific principles of a subject with the subject, plus notation 01 from Table 1, e.g., scientific principles of photography 770.1 For government policy on science, see 338.9; for applied sciences, see 600 See Manual at 231.7 vs. 213, 500, 576.8; also at 338.9 vs. 352.7, 500; also at 500 vs. 001 SUMMARY 500.2–.8 [Physical sciences, space sciences, groups of people] 501–509 Standard subdivisions and natural history 510 Mathematics 520 Astronomy and allied sciences 530 Physics 540 Chemistry and allied sciences 550 Earth sciences 560 Paleontology 570 Biology 580 Plants 590 Animals .2 Physical sciences For astronomy and allied sciences, see 520; for physics, see 530; for chemistry and allied sciences, see 540; for earth sciences, see 550 .5 Space sciences For astronomy, see 520; for earth sciences in other worlds, see 550. For space sciences aspects of a specific subject, see the subject, plus notation 091 from Table 1, e.g., chemical reactions in space 541.390919 See Manual at 520 vs. 500.5, 523.1, 530.1, 919.9 .8 Groups of people Add to base number 500.8 the numbers following —08 in notation 081–089 from Table 1, e.g., women in science 500.82 501 Philosophy and theory Class scientific method as a general research technique in 001.4; class scientific method applied in the natural sciences in 507.2 502 Miscellany 577 502 Dewey Decimal Classification 502 .8 Auxiliary techniques and procedures; apparatus, equipment, materials Including microscopy; microscopes; interdisciplinary works on microscopy Class stereology with compound microscopes, stereology with electron microscopes in 502; class interdisciplinary works on photomicrography in 778.3 For manufacture of microscopes, see 681.
    [Show full text]
  • Math 788M: Computational Number Theory (Instructor’S Notes)
    Math 788M: Computational Number Theory (Instructor’s Notes) The Very Beginning: • A positive integer n can be written in n steps. • The role of numerals (now O(log n) steps) • Can we do better? (Example: The largest known prime contains 258716 digits and doesn’t take long to write down. It’s 2859433 − 1.) Running Time of Algorithms: • A positive integer n in base b contains [logb n] + 1 digits. • Big-Oh & Little-Oh Notation (as well as , , ∼, ) Examples 1: log (1 + (1/n)) = O(1/n) Examples 2: [logb n] + 1 log n Examples 3: 1 + 2 + ··· + n n2 These notes are for a course taught by Michael Filaseta in the Spring of 1996 and being updated for Fall of 2007. Computational Number Theory Notes 2 Examples 4: f a polynomial of degree k =⇒ f(n) = O(nk) Examples 5: (r + 1)π ∼ rπ • We will want algorithms to run quickly (in a small number of steps) in comparison to the length of the input. For example, we may ask, “How quickly can we factor a positive integer n?” One considers the length of the input n to be of order log n (corresponding to the number of binary digits n has). An algorithm runs in polynomial time if the number of steps it takes is bounded above by a polynomial in the length of the input. An algorithm to factor n in polynomial time would require that it take O (log n)k steps (and that it factor n). Addition and Subtraction (of n and m): • We are taught how to do binary addition and subtraction in O(log n + log m) steps.
    [Show full text]
  • Number Theory
    “mcs-ftl” — 2010/9/8 — 0:40 — page 81 — #87 4 Number Theory Number theory is the study of the integers. Why anyone would want to study the integers is not immediately obvious. First of all, what’s to know? There’s 0, there’s 1, 2, 3, and so on, and, oh yeah, -1, -2, . Which one don’t you understand? Sec- ond, what practical value is there in it? The mathematician G. H. Hardy expressed pleasure in its impracticality when he wrote: [Number theorists] may be justified in rejoicing that there is one sci- ence, at any rate, and that their own, whose very remoteness from or- dinary human activities should keep it gentle and clean. Hardy was specially concerned that number theory not be used in warfare; he was a pacifist. You may applaud his sentiments, but he got it wrong: Number Theory underlies modern cryptography, which is what makes secure online communication possible. Secure communication is of course crucial in war—which may leave poor Hardy spinning in his grave. It’s also central to online commerce. Every time you buy a book from Amazon, check your grades on WebSIS, or use a PayPal account, you are relying on number theoretic algorithms. Number theory also provides an excellent environment for us to practice and apply the proof techniques that we developed in Chapters 2 and 3. Since we’ll be focusing on properties of the integers, we’ll adopt the default convention in this chapter that variables range over the set of integers, Z. 4.1 Divisibility The nature of number theory emerges as soon as we consider the divides relation a divides b iff ak b for some k: D The notation, a b, is an abbreviation for “a divides b.” If a b, then we also j j say that b is a multiple of a.
    [Show full text]
  • A Taste of Set Theory for Philosophers
    Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. A taste of set theory for philosophers Jouko Va¨an¨ anen¨ ∗ Department of Mathematics and Statistics University of Helsinki and Institute for Logic, Language and Computation University of Amsterdam November 17, 2010 Contents 1 Introduction 1 2 Elementary set theory 2 3 Cardinal and ordinal numbers 3 3.1 Equipollence . 4 3.2 Countable sets . 6 3.3 Ordinals . 7 3.4 Cardinals . 8 4 Axiomatic set theory 9 5 Axiom of Choice 12 6 Independence results 13 7 Some recent work 14 7.1 Descriptive Set Theory . 14 7.2 Non well-founded set theory . 14 7.3 Constructive set theory . 15 8 Historical Remarks and Further Reading 15 ∗Research partially supported by grant 40734 of the Academy of Finland and by the EUROCORES LogICCC LINT programme. I Journal of the Indian Council of Philosophical Research, Vol. XXVII, No. 2. A Special Issue on "Logic and Philosophy Today", 143-163, 2010. Reprinted in "Logic and Philosophy Today" (edited by A. Gupta ans J.v.Benthem), College Publications vol 29, 141-162, 2011. 1 Introduction Originally set theory was a theory of infinity, an attempt to understand infinity in ex- act terms. Later it became a universal language for mathematics and an attempt to give a foundation for all of mathematics, and thereby to all sciences that are based on mathematics.
    [Show full text]
  • Complexity Theory
    Complexity Theory Course Notes Sebastiaan A. Terwijn Radboud University Nijmegen Department of Mathematics P.O. Box 9010 6500 GL Nijmegen the Netherlands [email protected] Copyright c 2010 by Sebastiaan A. Terwijn Version: December 2017 ii Contents 1 Introduction 1 1.1 Complexity theory . .1 1.2 Preliminaries . .1 1.3 Turing machines . .2 1.4 Big O and small o .........................3 1.5 Logic . .3 1.6 Number theory . .4 1.7 Exercises . .5 2 Basics 6 2.1 Time and space bounds . .6 2.2 Inclusions between classes . .7 2.3 Hierarchy theorems . .8 2.4 Central complexity classes . 10 2.5 Problems from logic, algebra, and graph theory . 11 2.6 The Immerman-Szelepcs´enyi Theorem . 12 2.7 Exercises . 14 3 Reductions and completeness 16 3.1 Many-one reductions . 16 3.2 NP-complete problems . 18 3.3 More decision problems from logic . 19 3.4 Completeness of Hamilton path and TSP . 22 3.5 Exercises . 24 4 Relativized computation and the polynomial hierarchy 27 4.1 Relativized computation . 27 4.2 The Polynomial Hierarchy . 28 4.3 Relativization . 31 4.4 Exercises . 32 iii 5 Diagonalization 34 5.1 The Halting Problem . 34 5.2 Intermediate sets . 34 5.3 Oracle separations . 36 5.4 Many-one versus Turing reductions . 38 5.5 Sparse sets . 38 5.6 The Gap Theorem . 40 5.7 The Speed-Up Theorem . 41 5.8 Exercises . 43 6 Randomized computation 45 6.1 Probabilistic classes . 45 6.2 More about BPP . 48 6.3 The classes RP and ZPP .
    [Show full text]
  • Representation Theory* Its Rise and Its Role in Number Theory
    Representation Theory* Its Rise and Its Role in Number Theory Introduction By representation theory we understand the representation of a group by linear transformations of a vector space. Initially, the group is finite, as in the researches of Dedekind and Frobenius, two of the founders of the subject, or a compact Lie group, as in the theory of invariants and the researches of Hurwitz and Schur, and the vector space finite-dimensional, so that the group is being represented as a group of matrices. Under the combined influences of relativity theory and quantum mechanics, in the context of relativistic field theories in the nineteen-thirties, the Lie group ceased to be compact and the space to be finite-dimensional, and the study of infinite-dimensional representations of Lie groups began. It never became, so far as I can judge, of any importance to physics, but it was continued by mathematicians, with strictly mathematical, even somewhat narrow, goals, and led, largely in the hands of Harish-Chandra, to a profound and unexpectedly elegant theory that, we now appreciate, suggests solutions to classical problems in domains, especially the theory of numbers, far removed from the concerns of Dirac and Wigner, in whose papers the notion first appears. Physicists continue to offer mathematicians new notions, even within representation theory, the Virasoro algebra and its representations being one of the most recent, that may be as fecund. Predictions are out of place, but it is well to remind ourselves that the representation theory of noncompact Lie groups revealed its force and its true lines only after an enormous effort, over two decades and by one of the very best mathematical minds of our time, to establish rigorously and in general the elements of what appeared to be a somewhat peripheral subject.
    [Show full text]
  • Interactions of Computational Complexity Theory and Mathematics
    Interactions of Computational Complexity Theory and Mathematics Avi Wigderson October 22, 2017 Abstract [This paper is a (self contained) chapter in a new book on computational complexity theory, called Mathematics and Computation, whose draft is available at https://www.math.ias.edu/avi/book]. We survey some concrete interaction areas between computational complexity theory and different fields of mathematics. We hope to demonstrate here that hardly any area of modern mathematics is untouched by the computational connection (which in some cases is completely natural and in others may seem quite surprising). In my view, the breadth, depth, beauty and novelty of these connections is inspiring, and speaks to a great potential of future interactions (which indeed, are quickly expanding). We aim for variety. We give short, simple descriptions (without proofs or much technical detail) of ideas, motivations, results and connections; this will hopefully entice the reader to dig deeper. Each vignette focuses only on a single topic within a large mathematical filed. We cover the following: • Number Theory: Primality testing • Combinatorial Geometry: Point-line incidences • Operator Theory: The Kadison-Singer problem • Metric Geometry: Distortion of embeddings • Group Theory: Generation and random generation • Statistical Physics: Monte-Carlo Markov chains • Analysis and Probability: Noise stability • Lattice Theory: Short vectors • Invariant Theory: Actions on matrix tuples 1 1 introduction The Theory of Computation (ToC) lays out the mathematical foundations of computer science. I am often asked if ToC is a branch of Mathematics, or of Computer Science. The answer is easy: it is clearly both (and in fact, much more). Ever since Turing's 1936 definition of the Turing machine, we have had a formal mathematical model of computation that enables the rigorous mathematical study of computational tasks, algorithms to solve them, and the resources these require.
    [Show full text]
  • On Bell's Arithmetic of Boolean Algebra*
    ON BELL'S ARITHMETIC OF BOOLEAN ALGEBRA* BY WALLIE ABRAHAM HURWITZ 1. Introduction. Bellf has constructed an arithmetic for an algebra of logic or (following the terminology of Shefferî) a Boolean algebra, which presents gratifying analogies to the arithmetics of rational and other fields. In only one detail is the similarity less close than seems appropriate to the difference in the structures of the algebras themselves—namely, in the properties of the concept congruence. In this note I shall show that a slightly more general definition retains all the properties of the congruence given by Bell and restores several analogies to rational arithmetic lost by the Bell definition. All the notation and terminology of the paper of Bell (to which reference should be made for results not here repeated) other than those relating to congruence are followed in the present treatment. In particular, we utilize the two (dual) interpretations of arithmetic operations and relations in ?: Name Symbol Interpretation I Interpretation II (s) Arithmetic sum: asß: a+ß, aß; (p) Arithmetic product: apß: aß, ct+ß; (g) G. CD.: agß: a+ß, aß; (l) L. C. M.: alß: aß, a+ß; (f) Arithmetic zero: f: <o, e; (v) Arithmetic unity: v. t, «; (d) a divides/3: adß: a\ß, ß\a. 2. Residuals. It will be convenient to amplify slightly Bell's treatment of residuals. By the residual of b with respect to a in Si, bra, is meant the quotient of a by the G. C. D. of a and b. Transforming this into a form equivalent for 21and suitable, by the non-appearance of the concept quotient, for analogy in ?, Bell uses for 2 substantially the following: ßra is the G.
    [Show full text]
  • The Linbox Project for Linear Algebra Computation a Practical Tutorial
    The LinBox Project for Linear Algebra Computation A Practical Tutorial Daniel S. Roche Symbolic Computation Group School of Computer Science University of Waterloo MOCAA 2008 University of Western Ontario 8 May 2008 Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 1/30 Goals for Today I want to convince you that LinBox is. the tool for exact linear algebra easy to install and use (if you want it to be) worth getting involved with Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 2/30 1 Foundations History Major Contributors Mathematical Background 2 Design Middleware Heirarchy Genericity 3 Practicalities Levels of Use Details 4 Conclusions Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 3/30 Foundations History Significant Publications 1986 Wiedemann: Solving sparse linear equations over finite fields 1991 Kaltofen & Saunders: On Wiedemann’s Algorithm 1993 Coppersmith: Block Lanczos, Block Wiedemann 1995 Montgomery: Implementation of Block Lanczos 1997 Villard: Analysis of Block Wiedemann 2001 Giesbrecht; Dumas, Saunders, & Villard: Smith forms 2001 Chen, Eberly, Kaltofen, Saunders, Turner, Villard: Efficient Matrix Preconditioners for Black Box Linear Algebra 2002 Dumas, Gautier, Giesbrecht, Giorgi, Hovinen, Kaltofen, Saunders, Turner, Villard: Linbox: A Generic Library For Exact Linear Algebra 2002 Dumas, Gautier, Pernet: FFLAS: Finite Field Linear Algebra Subroutines Dan Roche (U. Waterloo) LinBox Tutorial MOCAA2008 4/30 Foundations History LinBox Milestones 2000 Initial design meetings 2002 World Scientific paper 2004 BLAS is thoroughly integrated 2005 LinBox 1.0 Released JGD gives tutorial at ISSAC in Beijing LinBox included in open-source computer algebra CD 2006 Maple interface and web computation server 2007 SAGE integration 2008 Linbox 1.5 Dan Roche (U.
    [Show full text]
  • Cryptology and Computational Number Theory (Boulder, Colorado, August 1989) 41 R
    http://dx.doi.org/10.1090/psapm/042 Other Titles in This Series 50 Robert Calderbank, editor, Different aspects of coding theory (San Francisco, California, January 1995) 49 Robert L. Devaney, editor, Complex dynamical systems: The mathematics behind the Mandlebrot and Julia sets (Cincinnati, Ohio, January 1994) 48 Walter Gautschi, editor, Mathematics of Computation 1943-1993: A half century of computational mathematics (Vancouver, British Columbia, August 1993) 47 Ingrid Daubechies, editor, Different perspectives on wavelets (San Antonio, Texas, January 1993) 46 Stefan A. Burr, editor, The unreasonable effectiveness of number theory (Orono, Maine, August 1991) 45 De Witt L. Sumners, editor, New scientific applications of geometry and topology (Baltimore, Maryland, January 1992) 44 Bela Bollobas, editor, Probabilistic combinatorics and its applications (San Francisco, California, January 1991) 43 Richard K. Guy, editor, Combinatorial games (Columbus, Ohio, August 1990) 42 C. Pomerance, editor, Cryptology and computational number theory (Boulder, Colorado, August 1989) 41 R. W. Brockett, editor, Robotics (Louisville, Kentucky, January 1990) 40 Charles R. Johnson, editor, Matrix theory and applications (Phoenix, Arizona, January 1989) 39 Robert L. Devaney and Linda Keen, editors, Chaos and fractals: The mathematics behind the computer graphics (Providence, Rhode Island, August 1988) 38 Juris Hartmanis, editor, Computational complexity theory (Atlanta, Georgia, January 1988) 37 Henry J. Landau, editor, Moments in mathematics (San Antonio, Texas, January 1987) 36 Carl de Boor, editor, Approximation theory (New Orleans, Louisiana, January 1986) 35 Harry H. Panjer, editor, Actuarial mathematics (Laramie, Wyoming, August 1985) 34 Michael Anshel and William Gewirtz, editors, Mathematics of information processing (Louisville, Kentucky, January 1984) 33 H. Peyton Young, editor, Fair allocation (Anaheim, California, January 1985) 32 R.
    [Show full text]
  • History of Modern Bulgarian Literature
    The History ol , v:i IL Illlllf iM %.m:.:A Iiiil,;l|iBif| M283h UNIVERSITY OF FLORIDA LIBRARIES COLLEGE LIBRARY Digitized by the Internet Archive in 2012 with funding from LYRASIS Members and Sloan Foundation http://archive.org/details/historyofmodernbOOmann Modern Bulgarian Literature The History of Modern Bulgarian Literature by CLARENCE A. MANNING and ROMAN SMAL-STOCKI BOOKMAN ASSOCIATES :: New York Copyright © 1960 by Bookman Associates Library of Congress Catalog Card Number: 60-8549 MANUFACTURED IN THE UNITED STATES OF AMERICA BY UNITED PRINTING SERVICES, INC. NEW HAVEN, CONN. Foreword This outline of modern Bulgarian literature is the result of an exchange of memories of Bulgaria between the authors some years ago in New York. We both have visited Bulgaria many times, we have had many personal friends among its scholars and statesmen, and we feel a deep sympathy for the tragic plight of this long-suffering Slavic nation with its industrious and hard-working people. We both feel also that it is an injustice to Bulgaria and a loss to American Slavic scholarship that, in spite of the importance of Bulgaria for the Slavic world, so little attention is paid to the country's cultural contributions. This is the more deplorable for American influence in Bulgaria was great, even before World War I. Many Bulgarians were educated in Robert Col- lege in Constantinople and after World War I in the American College in Sofia, one of the institutions supported by the Near East Foundation. Many Bulgarian professors have visited the United States in happier times. So it seems unfair that Ameri- cans and American universities have ignored so completely the development of the Bulgarian genius and culture during the past century.
    [Show full text]
  • COLLECTIVE COMPLAINT No. 31/2005 European Roma Rights Center V. Bulgaria
    EUROPEAN COMMITTEE OF SOCIAL RIGHTS COMITE EUROPEEN DES DROITS SOCIAUX 25 May 2005 Case Document No. 1 COLLECTIVE COMPLAINT No. 31/2005 European Roma Rights Center v. Bulgaria registered at the Secretariat on 22 April 2005 EUROPEAN ROMA RIGHTS CENTRE 1386 Budapest 62, P.O. Box 906/93, Hungary Phone: (36-1) 413-2200; Fax: (36-1) 413-2201 E-mail: [email protected] http://errc.org 21 April 2005 Secretariat of the European Social Charter Directorate General of Human Rights – DG II Council of Europe F-67075 Strasbourg CEDEX France Collective Complaint European Roma Rights Centre v. Bulgaria Table of Contents I. Admissibility I.1. State Party I.2. Articles Concerned I.3. Standing of the European Roma Rights Centre II. Subject Matter of the Complaint II.1. Article 16, Article E, and the Right to Adequate Housing II.2. The Factual Profile of Bulgaria’s Violation of Article 16 Independent of and/or in Conjunction with the Article E Ban on Discrimination II.2.A. Failure to Recognise the Right to Adequate Housing under Bulgarian Domestic Law II.2.B. Aggravated Residential Conditions of Romani Neighborhoods II.2.C. Factual Denial on a Massive Scale of Legal Recognition of Romani Housing II.2.D. Systemic Threats of and/or Actual Implementation of Forced Evictions. Planned and Realised Wholesale Destruction of Romani Neighbourhoods II.2.E. Government Housing Policy III. Conclusions I. Admissibility I.1. State Party I.1.01. Bulgaria: High Contracting Party to the Revised European Social Charter (hereafter “RESC”) since August 1, 2000; and accepted supervision under the collective complaints procedure provided for in Part IV, Article D, paragraph 2 of the Charter in accordance with the Additional Protocol to the ESC providing for a system of collective complaints from 9 November 1995.
    [Show full text]