www.unsw.edu.au
Mathematician solves algebra’s oldest problem using intriguing new number sequences
A UNSW mathematician has built an algebraic solution to an equation that was once believed impossible to solve.
#Combinatorics is an active hashtag on Bluesky. In the last 30 days, 16 people shared 24 posts with it — around 1 a day. Activity is up 550% versus the previous week, peaking on Sep 19 with 6 posts.
Tags most often used together with #Combinatorics.
www.unsw.edu.au
Mathematician solves algebra’s oldest problem using intriguing new number sequences
A UNSW mathematician has built an algebraic solution to an equation that was once believed impossible to solve.
ecajournal.haifa.ac.il
Interview with Karim Adiprasito
Karim Adiprasito completed his undergraduate studies at TU Dortmund in 2010. He obtained a Ph.D. from Free University Berlin in 2013, under the supervision of Gunter M. Ziegler. He has been an Assistant Professor at the Einstein Institute for Mathematics Hebrew University of Jerusalem since 2015, promoted to full professor in 2018. Professor Adiprasito has given numerous invited talks in conferences and seminars. He received several prizes, for example, European Prize in Combinatorics, in 2015, for his work in discrete geometry; New Horizons Prize for Early-Career Achievement in Mathematics, associated with the Breakthrough Prize in Mathematics, in 2019; Prize of the European Mathematical Society in 2020, and is the 2021 Hadamard Lecturer.
voxmeditantis.com
Sister Mary Celine Fasenmyer: She Wrote the Algorithm Before Computers Existed to Run It
Sister Mary Celine Fasenmyer shares how a quiet nun in mid-century Pennsylvania conceived the algorithm behind today’s computer algebra, decades before computers arrived – her method’s erasur…
ecajournal.haifa.ac.il
Interview with Richard P. Stanley
Richard P. Stanley received a B.S. in mathematics from Caltech in 1966 and a Ph.D. in mathematics from Harvard in 1971 under the supervision of Gian-Carlo Rota. Professor Stanley’s research concerns problems in algebraic combinatorics, and his distinctions include the 1975 SIAM P´olya Prize in Applied Combinatorics, membership in the National Academy of Sciences since 1995, the 2001 Leroy P. Steele Prize for mathematical exposition, the 2003 Rolf Schock Prize in Mathematics, a plenary lecture at the International Congress of Mathematicians in 2006, and election as a fellow of the American Mathematical Society in 2012.
ecajournal.haifa.ac.il
Interview with Donald Knuth
Donald E. Knuth completed his undergraduate studies at Case Institute of Technology in 1960. He obtained a Ph.D. at California Institute of Technology in 1963, under the direction of Marshall Hall, Jr. He joined Stanford University as Professor of Computer Science in 1968. In 1993 he became Professor Emeritus of The Art of Computer Programming, at Stanford University. Professor Knuth has held visiting positions at the University of Oslo (1972–1973) and the University of Oxford (2002–2017). He has spoken at many conferences, including an invited talk at the International Congress of Mathematicians in Nice in 1970; the American Mathematical Society’s Gibbs Lecture in 1978; the SIAM von Neumann Lecture in 2016. Professor Knuth has received several awards, including the ACM A.M. Turing Award in 1974, the Medal of Science from President Carter in 1979, the American Mathematical Society’s Steele Prize for expository writing in 1986, the Benjamin Franklin Medal in 1988, the Adelskold Medal from the Swedish Academy of Sciences in 1994, the Harvey Prize from the Technion in 1995, the IEEE’s John von Neumann Medal in 1995, the Kyoto Prize for Advanced Technology in 1996, the 2010 Frontiers of Knowledge Award in Information and Communication Technologies, and the IET’s Michael Faraday Medal in 2011. Knuth was elected to the National Academy of Sciences in 1975, the National Academy of Engineering in 1981, and the American Philosophical Society in 2012.
Posts are pulled live from Bluesky and cached briefly. Posts with content labels are hidden.