Formal Power Series and Algebraic Combinatorics: 12th International Conference, FPSAC’00, Moscow, Russia, June 2000, ProceedingsDaniel Krob, Alexander A. Mikhalev, Alexander V. Mikhalev Springer Science & Business Media, 9. mar. 2013 - 808 sider 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... |
Indhold
| 16 | |
| 30 | |
Equations over Free and Fully Residually Free Groups | 45 |
On Modules Supported in the Nullcone | 67 |
Bases explicites et conjecture n | 103 |
On the Square Root of Languages | 125 |
Enumeration of Some Labelled Trees | 146 |
On Functions Which are Limits of Domino Tilings | 320 |
Regular Unicellular Dessins dEnfants and Weil Curves | 393 |
On the Integer Models of Plane Trees | 414 |
Arithmetical Properties of pSeries Associated to pTypical Formal Group | 432 |
Trees of Diameter 4 | 447 |
About Nilpotency of Engel Algebras | 461 |
Induction and AuslanderReiten Sequences Over Crossed Products | 765 |
Combinatorial Aspects of Capelli Identities and Structure of Algebras | 785 |
A Software to Solve Strip Tiling Problems | 801 |
The Kronecker Product of Schur Functions Indexed by TwoRow Shapes | 344 |
New Expressions for Levelrestricted Kostka Polynomials | 367 |
Andre udgaver - Se alle
Formal Power Series and Algebraic Combinatorics: 12th International ... Daniel Krob Begrænset visning - 2000 |
Formal Power Series and Algebraic Combinatorics Daniel Krob,Alexander A. Mikhalev Ingen forhåndsvisning - 2014 |
Almindelige termer og sætninger
2-trees a₁ algorithm aperiodic apply Artinian Artinian ring asymptotic automorphism bijection braid group called Cayley trees coefficients combinatorial complex compute conjecture consider construction Corollary corresponding defined definition degree denote dessin diagram edges elements equal equation equivalent example exists factor Ferrer diagram field finite formal power series formula free group given graph Hopf algebra hypergeometric term ideal idempotent identity integer inversion irreducible isomorphic Kostka polynomials labelled lattice Lemma linear M₁ Math matrix matroid module monic monic polynomial monoid monomials multiplication nilpotent noncommutative nonzero notation obtain operator pair partition permutation polynomial problem proof properties Proposition prove quasi-symmetric functions rational function recurrence representation result ring root satisfies semiring sequence skew solution subgroup submodule subset symmetric functions tableaux Theorem theory tiling trace monoids variables vector vertex vertices words Z-pair zero