|
Dave Bayer
David Allen Bayer (born November 29, 1955) is an American mathematician known for his contributions in algebra and symbolic computation and for his consulting work in the movie industry. He is a professor of mathematics at Barnard College, Columbia University. Education and career Bayer was educated at Swarthmore College as an undergraduate, where he attended a course on combinatorial algorithms given by Herbert Wilf. During that semester, Bayer related several original ideas to Wilf on the subject. These contributions were later incorporated into the second edition of Wilf and Albert Nijenhuis' influential book ''Combinatorial Algorithms'', with a detailed acknowledgement by its authors. Bayer subsequently earned his Ph.D. at Harvard University in 1982 under the direction of Heisuke Hironaka with a dissertation entitled ''The Division Algorithm and the Hilbert Scheme''. He joined Columbia University thereafter. Bayer is the son of Bryce Bayer, the inventor of the Bayer filter. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Oberwolfach Research Institute For Mathematics
The Oberwolfach Research Institute for Mathematics (german: Mathematisches Forschungsinstitut Oberwolfach) is a center for mathematical research in Oberwolfach, Germany. It was founded by mathematician Wilhelm Süss in 1944. It organizes weekly workshops on diverse topics where mathematicians and scientists from all over the world come to do interdisciplinary, collaborative research. The Institute is a member of the Leibniz Association, funded mainly by the Federal Ministry of Education and Research (Germany), German Federal Ministry of Education and Research and by the state of Baden-Württemberg. It also receives substantial funding from the ''Friends of Oberwolfach'' foundation, from the ''Oberwolfach Foundation'' and from numerous donors. History The Oberwolfach Research Institute for Mathematics (MFO) was founded as the ''Reich Institute of Mathematics'' (German: ''Reichsinstitut für Mathematik'') on 1 September 1944. It was one of several research institutes founded ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bryce Bayer
Bryce Edward Bayer (/ˈbaɪər/; pronounced BYE-er, August 15, 1929 – November 13, 2012) was an American scientist who invented the Bayer filter, which is used in most modern digital cameras. He has been called "the maestro without whom photography as we know wouldn't have been the same." Without his filter, Larry Scarff, a former chairman of the Camera Phone Image Quality Standards Group, told ''The New York Times'' after Bayer's death, "we'd still be getting only black-and-white pictures from our digital cameras." Early life and education Bryce Edward Bayer was born in Portland, Maine, on August 15, 1929, to Alton and Marguerite Willard Bayer. As a boy he tinkered with Brownie (camera), Brownies and other cameras. He graduated in 1947 from Deering High School in Portland, where he spent a good deal of time in the school darkroom. "He, in fact, processed all of the pictures for his high school yearbook," his son David told ''The New York Times'' following Bayer's death. After ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stuart Haber
Stuart Haber is an American cryptographer and computer scientist, known for his contributions in cryptography and privacy-preserving technologies and widely recognized as the co-inventor of the blockchain. His 1991 paper "How to Time-Stamp a Digital Document”, co-authored with W. Scott Stornetta, won the 1992 Discover Award for Computer Software and is considered to be one of the most important papers in the development of cryptocurrencies. Education Haber studied at Harvard University, graduating magna cum laude in 1978 with a B.A. in Mathematics. Haber earned his PhD at Columbia University in 1987 under the advisement of Zvi Galil with a thesis titled ''Provably Secure Multi-party Cryptographic Computation: Techniques and Applications''. Career In 1987, Haber joined Bell Communications Research (Bellcore) as a research scientist. In 1989, Haber met W. Scott Stornetta, his future scientific partner and collaborator, when Stornetta joined Bellcore. In 1994, Haber and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bitcoin
Bitcoin (abbreviation: BTC; sign: ₿) is a decentralized digital currency that can be transferred on the peer-to-peer bitcoin network. Bitcoin transactions are verified by network nodes through cryptography and recorded in a public distributed ledger called a blockchain. The cryptocurrency was invented in 2008 by an unknown person or group of people using the name Satoshi Nakamoto. The currency began use in 2009, when its implementation was released as open-source software. The word "''bitcoin''" was defined in a white paper published on October 31, 2008. It is a compound of the words ''bit'' and ''coin''. The legality of bitcoin varies by region. Nine countries have fully banned bitcoin use, while a further fifteen have implicitly banned it. A few governments have used bitcoin in some capacity. El Salvador has adopted Bitcoin as legal tender, although use by merchants remains low. Ukraine has accepted cryptocurrency donations to fund the resistance to the 2022 Rus ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Satoshi Nakamoto
Satoshi Nakamoto is the name used by the presumed pseudonymous person or persons who developed bitcoin, authored the bitcoin white paper, and created and deployed bitcoin's original reference implementation. As part of the implementation, Nakamoto also devised the first blockchain database. Nakamoto was active in the development of bitcoin up until December 2010. There has been widespread speculation about Satoshi Nakamoto's true identity, with a variety of people posited as the person or persons behind the name. Though Nakamoto's name is Japanese, and he stated in 2012 that he was a man living in Japan, most of the speculation has involved software and cryptography experts in the United States or Europe. Development of bitcoin Nakamoto stated that work on the writing of the code for Bitcoin began in 2007. On 18 August 2008, he or a colleague registered the domain name bitcoin.org, and created a web site at that address. On 31 October, Nakamoto published a white paper on the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
David Eisenbud
David Eisenbud (born 8 April 1947 in New York City) is an American mathematician. He is a professor of mathematics at the University of California, Berkeley and Director of the Mathematical Sciences Research Institute (MSRI); he previously served as Director of MSRI from 1997 to 2007. Biography Eisenbud is the son of mathematical physicist Leonard Eisenbud, who was a student and collaborator of the renowned physicist Eugene Wigner. Eisenbud received his Ph.D. in 1970 from the University of Chicago, where he was a student of Saunders Mac Lane and, unofficially, James Christopher Robson. He then taught at Brandeis University from 1970 to 1997, during which time he had visiting positions at Harvard University, Institut des Hautes Études Scientifiques (IHÉS), University of Bonn, and Centre national de la recherche scientifique (CNRS). He joined the staff at MSRI in 1997, and took a position at Berkeley at the same time. From 2003 to 2005 Eisenbud was President of the Americ ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Irena Peeva
Irena Vassileva Peeva is a professor of mathematics at Cornell University, specializing in commutative algebra. She disproved the Eisenbud–Goto regularity conjecture jointly with Jason McCullough. Education and career Peeva did her graduate studies at Brandeis University, earning a Ph.D. in 1995 under the supervision of David Eisenbud with a thesis entitled ''Free Resolutions''. She was a postdoctoral researcher at the University of California, Berkeley and a C. L. E. Moore instructor at the Massachusetts Institute of Technology before joining the Cornell Department of Mathematics faculty in 1998. Peeva is an editor of the Transactions of AMS. Books Peeva is the author of: * ''Graded Syzygies'' (Springer, 2011). * ''Minimal Free Resolutions over Complete Intersections'' (with David Eisenbud, Springer, 2016). Recognition In 2014 Peeva was elected as a fellow of the American Mathematical Society "for contributions to commutative algebra and its applications." In 2019/2020 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Persi Diaconis
Persi Warren Diaconis (; born January 31, 1945) is an American mathematician of Greek descent and former professional magician. He is the Mary V. Sunseri Professor of Statistics and Mathematics at Stanford University. He is particularly known for tackling mathematical problems involving randomness and randomization, such as coin flipping and shuffling playing cards. Biography Diaconis left home at 14 to travel with sleight-of-hand legend Dai Vernon, and dropped out of high school, returning to school at age 24 to learn math, motivated to read William Feller's famous two-volume treatise on probability theory, ''An Introduction to Probability Theory and Its Applications''. He attended the City College of New York for his undergraduate work, graduating in 1971, and then obtained a Ph.D. in Mathematical Statistics from Harvard University in 1974), learned to read Feller, and became a mathematical probabilist.Jeffrey R. Young, "The Magical Mind of Persi Diaconis" ''Chronicle of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Jeffrey Lagarias
Jeffrey Clark Lagarias (born November 16, 1949 in Pittsburgh, Pennsylvania, United States) is a mathematician and professor at the University of Michigan. Education While in high school in 1966, Lagarias studied astronomy at the Summer Science Program. He completed an S.B. and S.M. in Mathematics at the Massachusetts Institute of Technology in 1972. The title of his thesis was "Evaluation of certain character sums". He was a Putnam Fellow at MIT in 1970. He received his Ph.D. in Mathematics from MIT for his thesis "The 4-part of the class group of a quadratic field", in 1974. His advisor for both his masters and Ph.D was Harold Stark. Career In 1975, he joined AT&T Bell Laboratories and eventually became Distinguished Member of Technical Staff. Since 1995, he has been a Technology Consultant at AT&T Research Laboratories. In 2002, he moved to Michigan to work at the University and settle down with his family. While his recent work has been in theoretical computer science, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bernd Sturmfels
Bernd Sturmfels (born March 28, 1962 in Kassel, West Germany) is a Professor of Mathematics and Computer Science at the University of California, Berkeley and is a director of the Max Planck Institute for Mathematics in the Sciences in Leipzig since 2017. Education and career He received his PhD in 1987 from the University of Washington and the Technische Universität Darmstadt. After two postdoctoral years at the Institute for Mathematics and its Applications in Minneapolis, Minnesota, and the Research Institute for Symbolic Computation in Linz, Austria, he taught at Cornell University, before joining University of California, Berkeley in 1995. His Ph.D. students include Melody Chan, Jesús A. De Loera, Mike Develin, Diane Maclagan, Rekha R. Thomas, Caroline Uhler, and Cynthia Vinzant. Contributions Bernd Sturmfels has made contributions to a variety of areas of mathematics, including algebraic geometry, commutative algebra, discrete geometry, Gröbner bases, toric vari ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Programming
Linear programming (LP), also called linear optimization, is a method to achieve the best outcome (such as maximum profit or lowest cost) in a mathematical model whose requirements are represented by linear relationships. Linear programming is a special case of mathematical programming (also known as mathematical optimization). More formally, linear programming is a technique for the optimization of a linear objective function, subject to linear equality and linear inequality constraints. Its feasible region is a convex polytope, which is a set defined as the intersection of finitely many half spaces, each of which is defined by a linear inequality. Its objective function is a real-valued affine (linear) function defined on this polyhedron. A linear programming algorithm finds a point in the polytope where this function has the smallest (or largest) value if such a point exists. Linear programs are problems that can be expressed in canonical form as : \begin & \t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Betti Number
In algebraic topology, the Betti numbers are used to distinguish topological spaces based on the connectivity of ''n''-dimensional simplicial complexes. For the most reasonable finite-dimensional spaces (such as compact manifolds, finite simplicial complexes or CW complexes), the sequence of Betti numbers is 0 from some point onward (Betti numbers vanish above the dimension of a space), and they are all finite. The ''n''th Betti number represents the rank of the ''n''th homology group, denoted ''H''''n'', which tells us the maximum number of cuts that can be made before separating a surface into two pieces or 0-cycles, 1-cycles, etc. For example, if H_n(X) \cong 0 then b_n(X) = 0, if H_n(X) \cong \mathbb then b_n(X) = 1, if H_n(X) \cong \mathbb \oplus \mathbb then b_n(X) = 2, if H_n(X) \cong \mathbb \oplus \mathbb\oplus \mathbb then b_n(X) = 3, etc. Note that only the ranks of infinite groups are considered, so for example if H_n(X) \cong \mathbb^k \oplus \mathbb/(2) , where \m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Irena Peeva")
