Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC'00, Moscow, Russia, June 2000, Proceedings / Edition 1

Paperback (Print)
Buy New
Buy New from BN.com
$218.11
Used and New from Other Sellers
Used and New from Other Sellers
from $190.67
Usually ships in 1-2 business days
(Save 20%)
Other sellers (Paperback)
  • All (3) from $190.67   
  • New (3) from $190.67   

Overview

This book contains the extended abstracts presented at the 12th International Conference on Power Series and Algebraic Combinatorics (FPSAC '00) that took place at Moscow State University, June 26-30, 2000. These proceedings cover the most recent trends in algebraic and bijective combinatorics, including classical combinatorics, combinatorial computer algebra, combinatorial identities, combinatorics of classical groups, Lie algebra and quantum groups, enumeration, symmetric functions, young tableaux etc...

Read More Show Less

Product Details

  • ISBN-13: 9783642086625
  • Publisher: Springer Berlin Heidelberg
  • Publication date: 12/7/2010
  • Edition description: Softcover reprint of hardcover 1st ed. 2000
  • Edition number: 1
  • Pages: 808
  • Product dimensions: 1.63 (w) x 9.21 (h) x 6.14 (d)

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 Partially Ordered 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.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)