Formal Power Series and Algebraic Combinatorics
Home > Mathematics and Science Textbooks > Mathematics > Combinatorics and graph theory > Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings
Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings

Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings

|
     0     
5
4
3
2
1




International Edition


About the Book

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.

Table of Contents:
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.


Best Sellers


Product Details
  • ISBN-13: 9783540672470
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 234 mm
  • No of Pages: 808
  • Returnable: Y
  • Width: 156 mm
  • ISBN-10: 3540672478
  • Publisher Date: 26 May 2000
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Sub Title: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, Proceedings

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!