Open main menu

Wikipedia β

Gunnar E. Carlsson (born August 22, 1952 in Stockholm, Sweden) is an American mathematician, working in Algebraic Topology. He is known for his work on Segal's Burnside Ring conjecture, and for his work on applied algebraic topology, especially Topological Data Analysis (topology and the study of shape). He is a Professor Emeritus in the Department of Mathematics at Stanford University.[1] He is the founder and president of the predictive technology company Ayasdi.[2]

Gunnar E. Carlsson
Gunnar Carlsson.jpg
Born (1952-08-22) 22 August 1952 (age 65)
Stockholm, Sweden
Nationality Swedish American
Alma mater Stanford University
Harvard University
Known for Segal conjecture
Topological data analysis
Awards Alfred P. Sloan fellow
Scientific career
Fields Mathematics
Institutions Stanford University
University of Chicago
University of California, San Diego
Princeton University
Doctoral advisor R. James (Richard) Milgram
Doctoral students Reza Zadeh

Contents

BiographyEdit

Carlsson was born in Sweden and was educated in the United States. He graduated from Redwood High School (Larkspur, California) in 1969. He received a Ph.D. from Stanford University in 1976, with a dissertation written under the supervision of R. J. Milgram. He was a Dickson Assistant Professor at the University of Chicago (1976-1978) and Professor at the University of California, San Diego (1978–86), Princeton University (1986-1991), and Stanford University (1991–2015) where he held the Anne and Bill Swindells Professorship and was Chair of the Department of Mathematics from 1995 to 1998.[1]

He has been an Ordway Visiting Professor at the University of Minnesota (May–June 1991) and held a Sloan Foundation Research Fellowship (1984-1986).[1] He has delivered an invited address at the International Congress of Mathematicians in Berkeley, California, in 1986;[3] a plenary address at the annual meeting of the American Mathematical Society (1984);[4] the Whittaker Colloquium at the University of Edinburgh (2011);[5] the Rademacher Lectures at the University of Pennsylvania (2011);[6] and an invited plenary address at the annual meeting of the Society of Industrial and Applied Mathematics (2012).[7] He was elected as a member of the 2017 class of Fellows of the American Mathematical Society "for contributions to algebraic topology, particularly equivariant stable homotopy theory, algebraic K-theory, and applied algebraic topology".[8]

In 2008, Carlsson cofounded Ayasdi, a predictive technology based on big data, machine learning and artificial intelligence.[9]

WorkEdit

Carlsson's work within topology encompasses three areas.

Equivariant methods in homotopy theoryEdit

Segal's Burnside conjecture provides a description of the stable cohomotopy theory of the classifying space of a finite group. It is the analogue for cohomotopy of the work of Michael Atiyah and Graeme Segal on the K-theory of these classifying spaces. Building on earlier work by J.F. Adams, J.H.C. Gunawardena, H. Miller, J.P. May, J. McClure, and G. Lewis, Carlsson proved this conjecture in 1982. He also adapted the techniques to provide a proof of Sullivan's fixed point conjecture, which was also proved simultaneously and independently by H. Miller and J. Lannes.

Algebraic K-theoryEdit

Algebraic K-theory is a topological construction that assigns spaces (ultimately spectra) to rings, schemes, and other non-topological input. It has connections with important questions in high-dimensional topology, notably the conjectures of Novikov and Borel. Carlsson has proved, jointly with E. Pedersen and B. Goldfarb Novikov's conjecture for large classes of groups.

Applied and computational topologyEdit

Carlsson has worked in computational topology, especially as it applies to the analysis of high dimensional and complex data sets. In collaboration with others, he has demonstrated the utility of both persistent homology and the Mapper methodology in a series of papers. This work is central to the development of tools by Ayasdi, Inc, for analyzing massive and complex data sets across multiple application domains. In January 2016, he published a topological data analysis on the Donald Trump presidential campaign, 2016 and was able to outline the reach potential of Trump's messages in the mind of skeptical voters.[10]

Private lifeEdit

Carlsson is married and has three children.[2]

ReferencesEdit

  1. ^ a b c "Gunnar E. Carlsson" (PDF). Math.stanford.edu. Retrieved 2 April 2018. 
  2. ^ a b "Executive team: Gunnar Carlsson". Ayasdi.com. Retrieved 2 April 2018. 
  3. ^ Contents of ICM 1986 proceedings, Volume I, retrieved 2013-10-07.[dead link]
  4. ^ Invited Address, "Segal's Burnside Ring Conjecture", 90th American Mathematical Society Annual Meeting, Louisville, Kentucky, January 1984. Abstracts of Papers Presented to the American Mathematical Society, AMS (1984), p.100.
  5. ^ University of Edinburgh news retrieved on 12 November 2012[dead link]
  6. ^ Rademacher Lectures list retrieved on 12 November 2012[dead link]
  7. ^ "On the Shape of Data". Pathlms.com. Retrieved 2 April 2018. 
  8. ^ "2017 Class of the Fellows of the AMS 2017" (PDF). Ams.org. 2017. Retrieved 2 April 2018. 
  9. ^ "Board of trustees". Ams.org. Retrieved 2 April 2018. 
  10. ^ Gunnar Carlsson (25 January 2016). "The Secret of His Success? How Topological Data Analysis provides a glimpse into what may be powering the Trump engine". Ayasdi.com. Retrieved 2 April 2018.