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.
Les mer
Exact Asymptotics of Meander Numbers.- Algorithms of Integral Representation of Combinatorial Sums and Their Applications.- Quasi-Symmetric Functions.- Equations over Free and Fully Residually Free Groups.- Recurring Sequences.- On Modules Supported in the Nullcone.- Towards Topological Classification of Univariate Complex Polynomials.- Applicability of Zeilberger’s Algorithm to Rational Functions.- Bases explicites et conjecture n!.- A Generalized Cover Time for Random Walks on Graphs.- On the Square Root of Languages.- A General Cyclic Lemma for Multiset Permutation Inversions.- Enumeration of Some Labelled Trees.- On Aperiodic and Star-free Formal Power Series in Partially Commuting Variables.- Some Generalizations of Quasi-symmetric Functions and Noncommutative Symmetric Functions.- The Skeleton of a Reduced Word and a Correspondence of Edelman and Greene.- Analytic Combinatorics of Chord Diagrams.- Specifying 2-trees.- About the Dynamics of Some Systems Based on Integer Partitions and Compositions.- Hecke Algebras of Type A at q = 0 and Quasi-differential Operators.- Central Characters and Conjugacy Classes of the Symmetric Group.- The Füredi-Hajnal Conjecture Implies the Stanley-Wilf Conjecture.- Generalized Integer Partitions, Tilings of Zonotopes and Lattices.- Topology of Colors.- The Number of Subgroups in the Fundamental Groups of Some Non-orientable 3-Manifolds.- Unranking of Labelled Combinatorial Structures.- On Gelfand-Tsetlin Bases for Representations of Classical Lie Algebras.- A Common Asymptotic Behavior for Different Classes of Sparse Labelled Graphs with Given Number of Vertices and Edges.- On Functions Which are Limits of Domino Tilings.- Jeux de tableaux.- The Kronecker Product of Schur Functions Indexed by Two-Row Shapes or Hook Shapes.-Special Formal Series Solutions of Linear Ordinary Differential Equations.- New Expressions for Level-restricted Kostka Polynomials.- A Combinatorial Interpretation of the Quotient-Difference Algorithm.- Regular Unicellular Dessins d’Enfants and Weil Curves.- Quantum Division Ring.- On the Integer Models of Plane Trees.- Congruences Compatible with the Shuffle Product.- Arithmetical Properties of [pk]-Series Associated to p-Typical Formal Group Laws and Applications.- A Note on Linear Preservers of a Certain Matrix Partial Order.- Trees of Diameter 4.- The Makar-Limanov’s Construction of Algebraically Closed Skew Field via Mal’cev—Newmann Series.- About Nilpotency of Engel Algebras.- Belyi Functions Related to Plane Graphs: Multiplicities and Parasitic Solutions.- Construction of the Annihilator of a Linear Recurring Sequence over Finite Module with the help of the Berlekamp—Massey Algorithm.- Polylinear Recurring Sequences over a Bimodule.- An Improved Version of Standard Bases.- Effective Matrix Methods in Commutative Domains.- Polylinear Shift Registers and Standard Bases.- Burnside Matrices and Subgroup Embeddings in Finite Groups.- Distribution of Elements on Cycles of Linear Recurrences over Galois Field.- On Witt’s Formula and Invariants for Free Lie Superalgebras.- Gröbner-Shirshov Bases for Kac-Moody Algebras An(1) and Bn(1).- On Some Classes of Linear Representable Matroids.- On a Class of Families of Belyi Functions.- Finite Basis Property of S-Ideals of Finite Dimensional Forms.- Peak Reduction Technique in Commutative Algebra.- On Algebraic Degrees and Multiplicities for Parameters of Some Finite Group Rings.- Some Ring and Module Properties of Skew Power Series.- Some Ring and Module Properties of Skew Laurent Series.- Extending a PartiallyOrdered Set: Links with its Lattice of Ideals.- From Rational Functions to Regular Languages.- Proving a Class of Hypergeometric Identities by Means of Generating Functions.- Séries génératrices exponentielles pour les ECO-systèmes signés.- New Statistics on Non-crossing Trees.- Expected Number of Inversions After a Sequence of Random Adjacent Transpositions.- The Variety of Associative Rings, Which Satisfy the Identity x32 = 0, is Not Specht.- Polynomials of Bounded Tree Width.- Permutations Containing and Avoiding Certain Patterns.- On the Center of the Quantum Pseudoplactic Algebra.- ECO-Approximation of Algebraic Functions.- Methods for Computing the Concurrency Degree of Commutation Monoids.- An Application of Dumont’s Statistic.- On Wohlfahrt Formula for Finite Abelian Groups.- Induction and Auslander-Reiten Sequences Over Crossed Products.- On Acceleration of Multiprecision Computation of Products and Sums of Products of Rational Numbers.- Combinatorial Aspects of Capelli Identities and Structure of Algebras.- Generators and the Template Method Pattern. A Paradigm for Combinatorial Experimentation.- A Software to Solve Strip Tiling Problems.- Author Index.
Les mer
Includes supplementary material: sn.pub/extras

Produktdetaljer

ISBN
9783540672470
Publisert
2000-05-26
Utgiver
Vendor
Springer-Verlag Berlin and Heidelberg GmbH & Co. K
Høyde
234 mm
Bredde
156 mm
Aldersnivå
Research, G, UU, 01, 05
Språk
Product language
Engelsk
Format
Product format
Innbundet