American Mathematical Society TranslationsAmerican Mathematical Soc., Apr 10, 2001 The articles in this collection present new results in combinatorics, algebra, algebraic geometry, dynamical systems, analysis, and probability. Of particular interest is the survey article by A. N. Kirillov devoted to combinatorics of Young diagrams and related problems of representation theory. Also included are articles devoted to the eightieth birthday of renowned Russian mathematician, V. A. Rokhlin, ``Remembrances of V. A. Rokhlin'', by I. R. Shafarevich, and ``An Unfinished Project of V.A. Rokhlin'', by V. N. Sudakov. The results, ideas, and methods given in the book will be of interest to a broad range of specialists. |
Contents
| 1 | |
Combinatorics of Young Tableaux and Configurations | 17 |
On Integral Models of Affine Toric Varieties | 99 |
Biorthogonal Wavelet Bases with Rational Masks | 147 |
QPseudodifference Universal DrinfeldSokolov Reduction | 169 |
Effective Construction of Local Parameters of Irreducible Components of | 201 |
From the Editorial Board | 233 |
Common terms and phrases
admissible configuration algebraic variety algorithm Ao-function assertion asymptotic Bethe bijection biorthogonal pair block combinatorial computation condition configuration of type Consequently Consider partitions construction corresponding defined definition Denote elements embedding English transl equal equation example exists filters finite formula gl(n H₁ Heisenberg highest weight homogeneous polynomials inequality integer introduce irreducible components irreducible representation isomorphic K(Na k[Xo kernel Kostka polynomials Kostka-Foulkes polynomials large deviations Lemma Lie algebra Math Mathematical matrix measurable partitions Mises functionals multiresolution multiresolution analysis notation obtain operator P-sequence Part(X partition lattice Poisson bracket prime ideal problem proved q-analog q-binomial coefficients r-matrix rigged configurations right-hand side Rokhlin satisfying Schur functions Section sequence solutions space STY(A subset subspace symmetric tableau Theorem 3.1 theory topology U-statistics unimodality variables Young diagrams Young tableaux zero Zs+1
Popular passages
Page 3 - A set is said to be finite if it contains a finite number of elements otherwise, it is infinite. The size of a finite set is the number of elements in it, this is denoted by | S |. 1.2.8 Power Set The set of all subsets of a set 'S' is called the power set of 'S