Related Research Articles
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures. It is closely related to many other areas of mathematics and has many applications ranging from logic to statistical physics and from evolutionary biology to computer science.
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
In mathematics, tropical geometry is the study of polynomials and their geometric properties when addition is replaced with minimization and multiplication is replaced with ordinary addition:
The Fulkerson Prize for outstanding papers in the area of discrete mathematics is sponsored jointly by the Mathematical Optimization Society (MOS) and the American Mathematical Society (AMS). Up to three awards of $1,500 each are presented at each (triennial) International Symposium of the MOS. Originally, the prizes were paid out of a memorial fund administered by the AMS that was established by friends of the late Delbert Ray Fulkerson to encourage mathematical excellence in the fields of research exemplified by his work. The prizes are now funded by an endowment administered by MPS.
Richard Peter Stanley is an Emeritus Professor of Mathematics at the Massachusetts Institute of Technology, in Cambridge, Massachusetts. From 2000 to 2010, he was the Norman Levinson Professor of Applied Mathematics. He received his Ph.D. at Harvard University in 1971 under the supervision of Gian-Carlo Rota. He is an expert in the field of combinatorics and its applications to other mathematical disciplines.
The Faculty of Mathematics is one of six faculties of the University of Waterloo in Waterloo, Ontario, offering more than 500 courses in mathematics, statistics and computer science. The faculty also houses the David R. Cheriton School of Computer Science, formerly the faculty's computer science department. There are more than 31,000 alumni.
David M.R. Jackson is a professor at the University of Waterloo in the department of combinatorics and optimization. He graduated from Cambridge University in 1969. Jackson has been responsible for many developments in enumerative combinatorics in his career, as well as being a mathematical consultant to the Oxford English Dictionary Project.
Algebraic combinatorics is an area of mathematics that employs methods of abstract algebra, notably group theory and representation theory, in various combinatorial contexts and, conversely, applies combinatorial techniques to problems in algebra.
The mathematical disciplines of combinatorics and dynamical systems interact in a number of ways. The ergodic theory of dynamical systems has recently been used to prove combinatorial theorems about number theory which has given rise to the field of arithmetic combinatorics. Also dynamical systems theory is heavily involved in the relatively recent field of combinatorics on words. Also combinatorial aspects of dynamical systems are studied. Dynamical systems can be defined on combinatorial objects; see for example graph dynamical system.
In the study of permutation patterns, there has been considerable interest in enumerating specific permutation classes, especially those with relatively few basis elements. This area of study has turned up unexpected instances of Wilf equivalence, where two seemingly-unrelated permutation classes have the same numbers of permutations of each length.
Károly Bezdek is a Hungarian-Canadian mathematician. He is a professor as well as a Canada Research Chair of mathematics and the director of the Centre for Computational and Discrete Geometry at the University of Calgary in Calgary, Alberta, Canada. Also he is a professor of mathematics at the University of Pannonia in Veszprém, Hungary. His main research interests are in geometry in particular, in combinatorial, computational, convex, and discrete geometry. He has authored 3 books and more than 130 research papers. He is a founding Editor-in-Chief of the e-journal Contributions to Discrete Mathematics (CDM).
In algebra and in particular in algebraic combinatorics, a quasisymmetric function is any element in the ring of quasisymmetric functions which is in turn a subring of the formal power series ring with a countable number of variables. This ring generalizes the ring of symmetric functions. This ring can be realized as a specific limit of the rings of quasisymmetric polynomials in n variables, as n goes to infinity. This ring serves as universal structure in which relations between quasisymmetric polynomials can be expressed in a way independent of the number n of variables.
Michael Jeffrey Larsen is an American mathematician, a distinguished professor of mathematics at Indiana University Bloomington.
Lauren Kiyomi Williams is an American mathematician known for her work on cluster algebras, tropical geometry, algebraic combinatorics, amplituhedra, and the positive Grassmannian. She is Dwight Parker Robinson Professor of Mathematics at Harvard University.
Mark William Gross is an American mathematician, specializing in differential geometry, algebraic geometry, and mirror symmetry.
Bruce Reznick is an American mathematician long on the faculty at the University of Illinois at Urbana–Champaign. He is a prolific researcher noted for his contributions to number theory and the combinatorial-algebraic-analytic investigations of polynomials. In July 2019, to mark his 66th birthday, a day long symposium "Bruce Reznick 66 fest: A mensch of Combinatorial-Algebraic Mathematics" was held at the University of Bern, Switzerland.
Henry Howland Crapo was an American-Canadian mathematician who worked in algebraic combinatorics. Over the course of his career, he held positions at several universities and research institutes in Canada and France. He is noted for his work in matroid theory and lattice theory.
Mohamed Omar is a mathematician interested in combinatorics, and algebra. Omar is currently an Associate Professor of Mathematics and the Joseph B. Platt Chair in Effective Teaching at Harvey Mudd College.
Neil J. Calkin is a professor at Clemson University in the Algebra and Discrete Mathematics group of the School of Mathematical and Statistical Sciences. His interests are in combinatorial and probabilistic methods, mainly as applied to number theory.
References
- ↑ "Faculty of Mathematics Deans". University of Waterloo website. 24 November 2016.
- ↑ "'Math nerd' now at the faculty's helm". University of Waterloo website.
- ↑ "University of Waterloo Distinguished Teaching Award Winners". University of Waterloo website. 20 April 2015.
- ↑ "University of Waterloo Alumni Gold Medal Winners". University of Waterloo website. 2 March 2012.
- ↑ "Review: Combinatorial Enumeration by Ian P. Goulden and David M. Jackson" (PDF).
- ↑ Whitehead, Jr (1984). "Combinatorial Enumeration by Ian P. Goulden and David M. Jackson". SIAM Review. ACM Digital Library. 26 (4): 599. doi:10.1137/1026127.
- ↑ "Ian P. Goulden Publications". University of Waterloo. 5 December 2014.
