 |
The International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC) is an annual academic conference in the areas of algebraic and enumerative combinatorics and their applications and relations with other areas of mathematics, physics, biology and computer science. [1]
FPSAC was first held in 1988 and has been held annually since 1990, typically in June or July. [2]
The most recent conference in the series, FPSAC 2024, was held in July 2024 at Ruhr-Universität Bochum in Bochum, Germany. [3] The next conference is slated to take place at Hokkaido University in Sapporo, Japan on July 21-25, 2025. [4]
The proceedings of conferences in the series have appeared variously as books published by the American Mathematical Society [5] and Springer, [6] and as issues in the journals Discrete Mathematics, [7] Discrete Mathematics and Theoretical Computer Science, [8] and Séminaire Lotharingien de Combinatoire. [9]
Invited speakers at previous FPSAC conferences include Fields Medalist June Huh, Shaw Prize and Wolf Prize recipient Noga Alon, and Steele Prize recipient Richard Stanley. [10]
Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to 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.
Discrete mathematics is the study of mathematical structures that can be considered "discrete" rather than "continuous". Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry. Discrete objects can often be enumerated by integers; more formally, discrete mathematics has been characterized as the branch of mathematics dealing with countable sets. However, there is no exact definition of the term "discrete mathematics".
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
Endre Szemerédi is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science at Rutgers University since 1986. He also holds a professor emeritus status at the Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences.
Marcel-Paul "Marco" Schützenberger was a French mathematician and Doctor of Medicine. He worked in the fields of formal language, combinatorics, and information theory. In addition to his formal results in mathematics, he was "deeply involved in [a] struggle against the votaries of [neo-]Darwinism", a stance which has resulted in some mixed reactions from his peers and from critics of his stance on evolution. Several notable theorems and objects in mathematics as well as computer science bear his name. Paul Schützenberger was his great-grandfather.
Noga Alon is an Israeli mathematician and a professor of mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers.
Michael Stewart Paterson, is a British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007, and chair of the department of computer science in 2005.
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.
Combinatorial physics or physical combinatorics is the area of interaction between physics and combinatorics.
Louis Joseph Billera is a Professor of Mathematics at Cornell University.
In combinatorial mathematics and theoretical computer science, a (classical) permutation pattern is a sub-permutation of a longer permutation. Any permutation may be written in one-line notation as a sequence of entries representing the result of applying the permutation to the sequence 123...; for instance the sequence 213 represents the permutation on three elements that swaps elements 1 and 2. If π and σ are two permutations represented in this way, then π is said to contain σ as a pattern if some subsequence of the entries of π has the same relative order as all of the entries of σ.
Dominique Foata is a mathematician who works in enumerative combinatorics. With Pierre Cartier and Marcel-Paul Schützenberger he pioneered the modern approach to classical combinatorics, that lead, in part, to the current blossoming of algebraic combinatorics. His pioneering work on permutation statistics, and his combinatorial approach to special functions, are especially notable.
Fred Stephen Roberts is an American mathematician, a professor of mathematics at Rutgers University, and a former director of DIMACS.
In combinatorial mathematics, a Baxter permutation is a permutation which satisfies the following generalized pattern avoidance property:
Sergey Kitaev is a Professor of Mathematics at the University of Strathclyde, Glasgow, Scotland. He obtained his Ph.D. in mathematics from the University of Gothenburg in 2003 under the supervision of Einar Steingrímsson. Kitaev's research interests concern aspects of combinatorics and graph theory.
Greta Cvetanova Panova is a Bulgarian-American mathematician. She is a professor of mathematics and Gabilan Distinguished Professor in Science and Engineering at the University of Southern California in Los Angeles. Her research interests include combinatorics, probability and theoretical computer science.
The Philippe Flajolet Lecture Prize is awarded to for contributions to analytic combinatorics and analysis of algorithms, in the fields of theoretical computer science. This prize is named in memory of Philippe Flajolet.
In mathematics, a chord diagram consists of a cyclic order on a set of objects, together with a one-to-one pairing of those objects. Chord diagrams are conventionally visualized by arranging the objects in their order around a circle, and drawing the pairs of the matching as chords of the circle.
 | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |