Share
formal power series and algebraic combinatorics: 12th international conference, fpsac '00, moscow, russia, june 2000, proceedings (in English)
Daniel Krob
(Illustrated by)
·
Alexander A. Mikhalev
(Illustrated by)
·
Alexander V. Mikhalev
(Illustrated by)
·
Springer
· Paperback
formal power series and algebraic combinatorics: 12th international conference, fpsac '00, moscow, russia, june 2000, proceedings (in English) - Krob, Daniel ; Mikhalev, Alexander A. ; Mikhalev, Alexander V.
$ 312.62
$ 329.99
You save: $ 17.37
Choose the list to add your product or create one New List
✓ Product added successfully to the Wishlist.
Go to My WishlistsIt will be shipped from our warehouse between
Wednesday, May 29 and
Thursday, May 30.
You will receive it anywhere in United States between 1 and 3 business days after shipment.
Synopsis "formal power series and algebraic combinatorics: 12th international conference, fpsac '00, moscow, russia, june 2000, proceedings (in English)"
SFCA/FPSAC (Series Formelles et Combinatoire Algebrique/Formal Power Se- ries and Algebraic Combinatorics) is a series of international conferences that are held annually since 1988, alternating between Europe and North America. They usually take place at the end of the academic year, between June and July depending on the local organizing constraints. SFCA/FPSAC has now become one of the most important annual inter- national meetings for the algebraic and bijective combinatorics community. The conference is indeed one of the key international exchange place of ideas between all researchers involved in this emerging exciting area. SFCA/FPSAC'OO is the 12th in the series. It will take place in Moscow (Russia) from June 26 to June 30, 2000. Previous SFCA/FPSAC conferences were organized in Lille (88), Paris (90), Bordeaux (91), Montreal (92), Florence (93), Rutgers (94), Marne-la-Vallee (95), Minneapolis (96), Vienna (97), Toronto (98) and Barcelona (99). SFCA/FPSAC'OO is co-organized by the Center of New Information Tech- nologies (CNIT) of Moscow State University, the Laboratoire d'Informatique AI- gorithmique: Fondements et Applications (LIAFA) of University Paris 7 and the Maison de l'Informatique et des Mathematiques Discretes (MIMD). The SFCA/FPSAC'OO conference covers all main areas of algebraic combi- natorics and bijective combinatorics (including asymptotic analysis, all sorts of enumeration, representation theory of classical groups and classical Lie algebras, symmetric functions, etc). A special stress was also put this year on combinato- rial and computer algebra.
