Nominations for President
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
The Materiality & Ontology of Digital Subjectivity
THE MATERIALITY & ONTOLOGY OF DIGITAL SUBJECTIVITY: GRIGORI “GRISHA” PERELMAN AS A CASE STUDY IN DIGITAL SUBJECTIVITY A Thesis Submitted to the Committee on Graduate Studies in Partial Fulfillment of the Requirements for the Degree of Master of Arts in the Faculty of Arts and Science TRENT UNIVERSITY Peterborough, Ontario, Canada Copyright Gary Larsen 2015 Theory, Culture, and Politics M.A. Graduate Program September 2015 Abstract THE MATERIALITY & ONTOLOGY OF DIGITAL SUBJECTIVITY: GRIGORI “GRISHA” PERELMAN AS A CASE STUDY IN DIGITAL SUBJECTIVITY Gary Larsen New conditions of materiality are emerging from fundamental changes in our ontological order. Digital subjectivity represents an emergent mode of subjectivity that is the effect of a more profound ontological drift that has taken place, and this bears significant repercussions for the practice and understanding of the political. This thesis pivots around mathematician Grigori ‘Grisha’ Perelman, most famous for his refusal to accept numerous prestigious prizes resulting from his proof of the Poincaré conjecture. The thesis shows the Perelman affair to be a fascinating instance of the rise of digital subjectivity as it strives to actualize a new hegemonic order. By tracing first the production of aesthetic works that represent Grigori Perelman in legacy media, the thesis demonstrates that there is a cultural imperative to represent Perelman as an abject figure. Additionally, his peculiar abjection is seen to arise from a challenge to the order of materiality defended by those with a vested interest in maintaining the stability of a hegemony identified with the normative regulatory power of the heteronormative matrix sustaining social relations in late capitalism. -
Group Knowledge and Mathematical Collaboration: a Philosophical Examination of the Classification of Finite Simple Groups
Group Knowledge and Mathematical Collaboration: A Philosophical Examination of the Classification of Finite Simple Groups Joshua Habgood-Coote and Fenner Stanley Tanswell Forthcoming in Episteme, please refer to final version. Abstract In this paper we apply social epistemology to mathematical proofs and their role in mathematical knowledge. The most famous modern collaborative mathematical proof effort is the Classification of Finite Simple Groups. The history and sociology of this proof have been well-documented by Alma Steingart (2012), who highlights a number of surprising and unusual features of this collaborative endeavour that set it apart from smaller-scale pieces of mathematics. These features raise a number of interesting philosophical issues, but have received very little attention. In this paper, we will consider the philosophical tensions that Steingart uncovers, and use them to argue that the best account of the epistemic status of the Classification Theorem will be essentially and ineliminably social. This forms part of the broader argument that in order to understand mathematical proofs, we must appreciate their social aspects. 1 Introduction Popular conceptions of mathematics are gripped by the myth of the ‘lone genius’. This myth is inspired by famous figures like Andrew Wiles, Grigori Perelman, and Srinivasa Ramanujan whose individual efforts are taken to be both representative and exemplary. In this paper, we push back against this individualistic view of how mathematics is and should be practiced, examining the significance of social and group level features of mathematical practices. In particular, we will discuss the epistemology of mathematics, and argue that in order to understand mathematics and its epistemology, we need to pay attention to collaboration, group knowledge, and other social factors. -
Fundamental Theorems in Mathematics
SOME FUNDAMENTAL THEOREMS IN MATHEMATICS OLIVER KNILL Abstract. An expository hitchhikers guide to some theorems in mathematics. Criteria for the current list of 243 theorems are whether the result can be formulated elegantly, whether it is beautiful or useful and whether it could serve as a guide [6] without leading to panic. The order is not a ranking but ordered along a time-line when things were writ- ten down. Since [556] stated “a mathematical theorem only becomes beautiful if presented as a crown jewel within a context" we try sometimes to give some context. Of course, any such list of theorems is a matter of personal preferences, taste and limitations. The num- ber of theorems is arbitrary, the initial obvious goal was 42 but that number got eventually surpassed as it is hard to stop, once started. As a compensation, there are 42 “tweetable" theorems with included proofs. More comments on the choice of the theorems is included in an epilogue. For literature on general mathematics, see [193, 189, 29, 235, 254, 619, 412, 138], for history [217, 625, 376, 73, 46, 208, 379, 365, 690, 113, 618, 79, 259, 341], for popular, beautiful or elegant things [12, 529, 201, 182, 17, 672, 673, 44, 204, 190, 245, 446, 616, 303, 201, 2, 127, 146, 128, 502, 261, 172]. For comprehensive overviews in large parts of math- ematics, [74, 165, 166, 51, 593] or predictions on developments [47]. For reflections about mathematics in general [145, 455, 45, 306, 439, 99, 561]. Encyclopedic source examples are [188, 705, 670, 102, 192, 152, 221, 191, 111, 635]. -
Alexander Grothendieck Heng Li
Alexander Grothendieck Heng Li Alexander Grothendieck's life Alexander Grothendieck was a German born French mathematician. Grothendieck was born on March 28, 1928 in Berlin. His parents were Johanna Grothendieck and Alexander Schapiro. When he was five years old, Hitler became the Chancellor of the German Reich, and called to boycott all Jewish businesses, and ordered civil servants who were not of the Aryan race to retire. Grothendieck's father was a Russian Jew and at that time, he used the name Tanaroff to hide his Jewish Identity. Even with a Russian name it is still too dangerous for Jewish people to stay in Berlin. In May 1933, his father, Alexander Schapiro, left to Paris because the rise of Nazism. In December of the same year, his mother left Grothendieck with a foster family Heydorns in Hamburg, and joined Schapiro in Paris. While Alexander Grothendieck was with his foster family, Grothendieck's parents went to Spain and partici- pated in the Spanish Civil War. After the Spanish Civil War, Johanna(Hanka) Grothendieck and Alexander Schapiro returned to France. In Hamburg, Alexander Grothendieck attended to elementary schools and stud- ied at the Gymnasium (a secondary school). The Heydorns family are a part of the resistance against Hitler; they consider that it was too dangerous for young Grothendieck to stay in Germany, so in 1939 the Heydorns sent him to France to join his parents. However, because of the outbreak of World War II all German in France were required by law to be sent to special internment camps. Grothendieck and his parents were arrested and sent to the camp, but fortunately young Alexander Grothendieck was allowed to continue his education at a village school that was a few miles away from the camp. -
Applications at the International Congress by Marty Golubitsky
From SIAM News, Volume 39, Number 10, December 2006 Applications at the International Congress By Marty Golubitsky Grigori Perelman’s decision to decline the Fields Medal, coupled with the speculations surrounding this decision, propelled the 2006 Fields Medals to international prominence. Stories about the medals and the award ceremony at the International Congress of Mathematicians in Madrid this summer appeared in many influential news outlets (The New York Times, BBC, ABC, . .) and even in popular magazines (The New Yorker). In Madrid, the topologist John Morgan gave an excellent account of the history of the Poincaré conjecture and the ideas of Richard Hamilton and Perelman that led to the proof that the three-dimensional conjecture is correct. As Morgan pointed out, proofs of the Poincaré con- jecture and its direct generalizations have led to four Fields Medals: to Stephen Smale (1966), William Thurston (1982), Michael Freedman (1986), and now Grigori Perelman. The 2006 ICM was held in the Palacio Municipal de Congressos, a modern convention center on the outskirts of Madrid, which easily accommodated the 3600 or so participants. The interior of the convention center has a number of intriguing views—my favorite, shown below, is from the top of the three-floor-long descending escalator. Alfio Quarteroni’s plenary lecture on cardiovascular mathematics was among the many ses- The opening ceremony included a welcome sions of interest to applied mathematicians. from Juan Carlos, King of Spain, as well as the official announcement of the prize recipients—not only the four Fields Medals but also the Nevanlinna Prize and the (newly established) Gauss Prize. -
Prize Is Awarded Every Three Years at the Joint Mathematics Meetings
AMERICAN MATHEMATICAL SOCIETY LEVI L. CONANT PRIZE This prize was established in 2000 in honor of Levi L. Conant to recognize the best expository paper published in either the Notices of the AMS or the Bulletin of the AMS in the preceding fi ve years. Levi L. Conant (1857–1916) was a math- ematician who taught at Dakota School of Mines for three years and at Worcester Polytechnic Institute for twenty-fi ve years. His will included a bequest to the AMS effective upon his wife’s death, which occurred sixty years after his own demise. Citation Persi Diaconis The Levi L. Conant Prize for 2012 is awarded to Persi Diaconis for his article, “The Markov chain Monte Carlo revolution” (Bulletin Amer. Math. Soc. 46 (2009), no. 2, 179–205). This wonderful article is a lively and engaging overview of modern methods in probability and statistics, and their applications. It opens with a fascinating real- life example: a prison psychologist turns up at Stanford University with encoded messages written by prisoners, and Marc Coram uses the Metropolis algorithm to decrypt them. From there, the article gets even more compelling! After a highly accessible description of Markov chains from fi rst principles, Diaconis colorfully illustrates many of the applications and venues of these ideas. Along the way, he points to some very interesting mathematics and some fascinating open questions, especially about the running time in concrete situ- ations of the Metropolis algorithm, which is a specifi c Monte Carlo method for constructing Markov chains. The article also highlights the use of spectral methods to deduce estimates for the length of the chain needed to achieve mixing. -
Curriculum Vitae Í
CNRS, Université de Paris Jeremy Lovejoy Case 7014, 75205 Paris Cedex 13, FRANCE T +33 (0)1 57 27 92 49 B [email protected] Curriculum Vitae Í http://lovejoy.perso.math.cnrs.fr/ Personal Date of birth March 7, 1972 Place of birth Escanaba, Michigan, USA Citizenship American Education August 2000 PhD, Mathematics, The Pennsylvania State University. Advisors: George E. Andrews and Ken Ono Professional Positions 2017–2019 Visitor, Department of Mathematics, University of California, Berkeley. 2006–current Researcher, CNRS, Université de Paris. 2003–2006 Researcher, Centre National de la Recherche Scientifique (CNRS), Université Bordeaux 1. 2000-2003 VIGRE/Van Vleck Assistant Professor, Department of Mathematics, University of Wisconsin. Research interests { Partitions and q-series { Combinatorics { Modular forms and number theory { Quantum knot theory Publications 1. Ramanujan Type Congruences for Three-Colored Frobenius Partitions, J. Number Theory 86 (2000), 283-290. 2. The Divisibility and Distribution of Partitions into Distinct Parts, Adv. Math. 158 (2001), 253-263. 3. 3-regular Partitions and a Modular K3 Surface (with David Penniston), Contemp. Math. 291 (2001), 177-182. 4. The Arithmetic of the Number of Partitions into Distinct Parts (with Scott Ahlgren), Mathematika 48 (2001) 203-211. 1/13 5. Frobenius Partitions and the Combinatorics of Ramanujan’s 1ψ1 summation (with Sylvie Corteel), J. Combin. Theory Ser. A 97 (2002), 177-183. 6. Extension of Ramanujan’s Congruences for the Partition Function Modulo Powers of 5 (with Ken Ono), J. reine angew. math. 542 (2002), 123-132. 7. Lacunary Partition Functions, Math. Res. Lett. 9 (2002), 191-198. 8. Partitions with Designated Summands (with George Andrews and Richard Lewis), Acta Arithmetica 105 (2002), 51-66. -
Vitae Ken Ono Citizenship
Vitae Ken Ono Citizenship: USA Date of Birth: March 20,1968 Place of Birth: Philadelphia, Pennsylvania Education: • Ph.D., Pure Mathematics, University of California at Los Angeles, March 1993 Thesis Title: Congruences on the Fourier coefficients of modular forms on Γ0(N) with number theoretic applications • M.A., Pure Mathematics, University of California at Los Angeles, March 1990 • B.A., Pure Mathematics, University of Chicago, June 1989 Research Interests: • Automorphic and Modular Forms • Algebraic Number Theory • Theory of Partitions with applications to Representation Theory • Elliptic curves • Combinatorics Publications: 1. Shimura sums related to quadratic imaginary fields Proceedings of the Japan Academy of Sciences, 70 (A), No. 5, 1994, pages 146-151. 2. Congruences on the Fourier coefficeints of modular forms on Γ0(N), Contemporary Mathematics 166, 1994, pages 93-105., The Rademacher Legacy to Mathe- matics. 3. On the positivity of the number of partitions that are t-cores, Acta Arithmetica 66, No. 3, 1994, pages 221-228. 4. Superlacunary cusp forms, (Co-author: Sinai Robins), Proceedings of the American Mathematical Society 123, No. 4, 1995, pages 1021-1029. 5. Parity of the partition function, 1 2 Electronic Research Annoucements of the American Mathematical Society, 1, No. 1, 1995, pages 35-42 6. On the representation of integers as sums of triangular numbers Aequationes Mathematica (Co-authors: Sinai Robins and Patrick Wahl) 50, 1995, pages 73-94. 7. A note on the number of t-core partitions The Rocky Mountain Journal of Mathematics 25, 3, 1995, pages 1165-1169. 8. A note on the Shimura correspondence and the Ramanujan τ(n)-function, Utilitas Mathematica 47, 1995, pages 153-160. -
Freeman Dyson, the Mathematician∗
GENERAL ARTICLE Freeman Dyson, the Mathematician∗ B Sury A mathematician of the highest rank with ideas ever-brimming with a full tank. He designed special lenses to ‘see’ Ramanujan’s congruences partitioned through the yet-invisible crank! The one person who comes closest to the legacy of Hermann B Sury is with the Indian Weyl was Freeman Dyson, who contributed enormously to Statistical Institute in Bengaluru. He is the National both Physics and Mathematics. His books and talks are tes- Co-ordinator for the taments to his prolificity in writing widely on the world at Mathematics Olympiad large and on science and mathematics in particular. To name Programme in India, and also a few of his books, he has (talked and) written on ‘Bombs and the President of the Indian Mathematical Society. Poetry’, ‘Imagined Worlds’, ‘Origins of Life’ and ‘Birds and Frogs’. Remarkably, Dyson contributed handsomely to what is termed ‘pure mathematics’. One would expect a physicist- mathematician to interest himself mainly in problems of an ‘applied’ nature. Here, we take a necessarily brief peek into some of his ‘purely mathematical’ work. The suggested read- ing at the end can be referred to for more details. 1. Statistical Mechanics – Dyson’s Conjecture In an enormously influential paper, ‘Statistical theory of energy Keywords levels of complex systems’, I. J. Math. Phys., 3:140–156, 1962, Congruences for partitions, rank and crank, random matrix the- Dyson proposed a new type of ensemble transforming the whole ory, Riemann zeta function, Dyson subject into purely group-theoretic language. In the paper, Dyson transform, quasi-crystals. -
What Is the Crank of a Partition? Daniel Glasscock, July 2014
What is the crank of a partition? Daniel Glasscock, July 2014 These notes complement a talk given for the What is ... ? seminar at the Ohio State University. Introduction The crank of an integer partition is an integer statistic which yields a combinatorial explanation of Ramanujan's three famous congruences for the partition function. The existence of such a statistic was conjectured by Freeman Dyson in 1944 and realized 44 years later by George Andrews and Frank Gravan. Since then, groundbreaking work by Ken Ono, Karl Mahlburg, and others tells us that not only are there infinitely many congruences for the partition function, but infinitely many of them are explained by the crank. In this note, we will introduce the partition function, define the crank of a partition, and show how the crank underlies congruences of the partition function. Along the way, we will recount the fascinating history behind the crank and its older brother, the rank. This exposition ends with the recent work of Karl Mahlburg on crank function congruences. Andrews and Ono [3] have a good quick survey from which to begin. The partition function The partition function p(n) counts the number of distinct partitions of a positive integer n, where a partition of n is a way of writing n as a sum of positive integers. For example, p(4) = 5 since 4 may be written as the sum of positive integers in 5 essentially different ways: 4, 3 + 1, 2 + 2, 2 + 1 + 1, and 1 + 1 + 1 + 1. The numbers comprising a partition are called parts of the partition, thus 2 + 1 + 1 has three parts, two of which are odd, and is not composed of distinct parts (since the 1 repeats). -
Qnas with Karl Mahlburg
QnAs QnAs with Karl Mahlburg with Karl Mahlburg n April 2006, PNAS awarded its first Paper of the Year prize to Karl Mahlburg, a mathematics graduate student studying with number theo- Irist Ken Ono at the University of Wiscon- sin, Madison. Mahlburg’s work (1) ‘‘adds a lustrous chapter,’’ as mathematician George E. Andrews said in a Commen- tary, to the study of a long-standing prob- lem involving partition theory and the crank function—all of which began with an observation by the famed Indian math- ematician Srinivasa Ramanujan in 1920. Mahlburg, who was funded by a National Science Foundation fellowship and will start the C. L. E. Moore Instructorship at Massachusetts Institute of Technology (Cambridge, MA) in the fall, took a break from writing his thesis to talk with PNAS. PNAS: Why did you choose PNAS to publish your paper? Mahlburg: PNAS certainly doesn’t publish a lot of mathematics papers. I was aware of Karl Mahlburg at the spring PNAS Editorial Board Meeting, 2006. Photograph by Mark Finkenstaedt that, but because of my contact with George © 2006. All rights reserved. Andrews, who was quite interested in my work, he offered to submit it. He recently was elected to the Academy. Once that partitions of 14. You may notice that the that you pick, you could find a divisibility came up, it did seem like a wonderful idea. number of partitions are all multiples of 5. pattern in the partitions. It opened up new PNAS is, of course, a highly respected Ramanujan found these congruences, or horizons in the area. -
Dyson's Ranks and Maass Forms
ANNALS OF MATHEMATICS Dyson’s ranks and Maass forms By Kathrin Bringmann and Ken Ono SECOND SERIES, VOL. 171, NO. 1 January, 2010 anmaah Annals of Mathematics, 171 (2010), 419–449 Dyson’s ranks and Maass forms By KATHRIN BRINGMANN and KEN ONO For Jean-Pierre Serre in celebration of his 80th birthday. Abstract Motivated by work of Ramanujan, Freeman Dyson defined the rank of an inte- ger partition to be its largest part minus its number of parts. If N.m; n/ denotes the number of partitions of n with rank m, then it turns out that n2 X1 X1 X1 q R.w q/ 1 N.m; n/wmqn 1 : I WD C D C Qn .1 .w w 1/qj q2j / n 1 m n 1 j 1 D D1 D D C C We show that if 1 is a root of unity, then R. q/ is essentially the holomorphic ¤ I part of a weight 1=2 weak Maass form on a subgroup of SL2.Z/. For integers 0 Ä r < t, we use this result to determine the modularity of the generating function for N.r; t n/, the number of partitions of n whose rank is congruent to r .mod t/. We I extend the modularity above to construct an infinite family of vector valued weight 1=2 forms for the full modular group SL2.Z/, a result which is of independent interest. 1. Introduction and statement of results The mock theta-functions give us tantalizing hints of a grand synthe- sis still to be discovered.