Sagan, Bruce E. The symmetric group. Representations, combinatorial algorithms, and symmetric functions. Second edition. Graduate Texts in Mathematics, 203. Springer-Verlag, New York, 2001. xvi+238 pp. ISBN: 0-387-95067-2 05E10 (05E05 20C30)
Dixon, John D.; Mortimer, Brian Permutation groups. Graduate Texts in Mathematics, 163. Springer-Verlag, New York, 1996. xii+346 pp. ISBN: 0-387-94599-7 (Reviewer: Martin W. Liebeck) 20B05 (20-01
Cameron, Peter J. Permutation groups. London Mathematical Society Student Texts, 45. Cambridge University Press, Cambridge, 1999. x+220 pp. ISBN: 0-521-65302-9; 0-521-65378-9 (Reviewer: Miguel Ã. Borges-Trenard) 20B4020B07)
Goulden, I. P.; Jackson, D. M. Combinatorial enumeration. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons, Inc., New York, 1983. xxiv+569 pp. ISBN: 0-471-86654- 7
Fomin, Sergey Prof Department of Mathematics University of Michigan 525 E University Avenue Ann Arbor, MI 48109-1109 Phone: Office: 734-764-6297 Email: fomin@umich.edu Url: http://www.math.lsa.umich.edu/~fomin/
no subject
Date: 2002-10-05 01:46 am (UTC)Sagan, Bruce E. The symmetric group.
Representations, combinatorial algorithms, and symmetric functions.
Second edition. Graduate Texts in Mathematics, 203. Springer-Verlag, New York, 2001. xvi+238 pp. ISBN: 0-387-95067-2 05E10 (05E05 20C30)
Dixon, John D.; Mortimer, Brian Permutation groups.
Graduate Texts in Mathematics, 163. Springer-Verlag, New York, 1996. xii+346 pp. ISBN: 0-387-94599-7 (Reviewer: Martin W. Liebeck) 20B05 (20-01
Cameron, Peter J. Permutation groups.
London Mathematical Society Student Texts, 45. Cambridge University Press, Cambridge, 1999. x+220 pp. ISBN: 0-521-65302-9; 0-521-65378-9 (Reviewer: Miguel Ã. Borges-Trenard) 20B4020B07)
no subject
Date: 2002-10-05 09:52 am (UTC)Ðне нÑжно ÑÑо-нибÑÐ´Ñ Ð½Ð° ÑемÑ: Ð´Ð°Ð½Ñ Ð´Ð²Ðµ пеÑеÑÑановки Ð, Ð Ñ Ð¸Ð·Ð²ÐµÑÑной пÑоÑÑой ÑÑÑÑкÑÑÑой Ñиклов (много Ð¼ÐµÐ»ÐºÐ¸Ñ Ñиклов, или Ð´Ð»Ð¸Ð½Ñ Ñиклов -- какие-нибÑÐ´Ñ Ð¾ÑобеннÑе ÑиÑла). ЧÑо можно ÑказаÑÑ Ð¾ ÑÑÑÑкÑÑÑе Ñиклов пÑÐ¾Ð¸Ð·Ð²ÐµÐ´ÐµÐ½Ð¸Ñ ÐÐ. ÐÑÑкие ÑаÑпÑÐµÐ´ÐµÐ½Ð¸Ñ Ð´Ð»Ð¸Ð½ Ñиклов и дÑÑгие оÑобенноÑÑи Ñикловой ÑÑÑÑкÑÑÑÑ. Ðде Ð±Ñ Ð¾Ð± ÑÑом можно бÑло поÑиÑаÑÑ?
no subject
Date: 2002-10-05 12:41 pm (UTC)еÑÑÑ Ð²
Goulden, I. P.; Jackson, D. M. Combinatorial enumeration.
Wiley-Interscience Series in Discrete Mathematics.
John Wiley & Sons, Inc., New York, 1983. xxiv+569 pp. ISBN: 0-471-86654- 7
но, боÑÑÑ, ÐÐ°Ñ Ð²Ð¾Ð¿ÑÐ¾Ñ Ñам не полÑÑÐ¸Ñ Ð¿Ð¾Ð»Ð½Ð¾Ð³Ð¾ оÑвеÑа. Такими ÑÑÑками ÑейÑÐ°Ñ Ð·Ð°Ð½Ð¸Ð¼Ð°ÑÑÑÑ Ñ ÑазнÑÑ ÑоÑек зÑениÑ. ÐÑÑÑе вÑего ÑпÑоÑиÑÑ Ñ ÑпеÑиалиÑÑа. ÐапÑимеÑ, СеÑежа Фомин должен владеÑÑ ÑовÑеменнÑм ÑоÑÑоÑнием ÑÐ°ÐºÐ¸Ñ Ð²Ð¾Ð¿ÑоÑов:
Fomin, Sergey
Prof
Department of Mathematics
University of Michigan
525 E University Avenue
Ann Arbor, MI 48109-1109
Phone: Office: 734-764-6297
Email: fomin@umich.edu
Url: http://www.math.lsa.umich.edu/~fomin/
no subject
Date: 2002-10-06 04:28 pm (UTC)