tailieunhanh - Báo cáo toán học: " ON NONCROSSING AND NONNESTING PARTITIONS FOR CLASSICAL REFLECTION GROUPS."

Tuyển tập các báo cáo nghiên cứu khoa học hay nhất của tạp chí toán học quốc tế đề tài: ON NONCROSSING AND NONNESTING PARTITIONS FOR CLASSICAL REFLECTION GROUPS. | ON NONCROSSING AND NONNESTING PARTITIONS FOR CLASSICAL REFLECTION GROUPS CHRISTOS A. ATHANASIADIS Abstract. The number of noncrossing partitions of 1 2 . n with hxed block sizes has a simple closed form given by Kreweras and coincides with the corresponding number for nonnesting partitions. We show that a similar statement is true for the analogues of such partitions for root systems B and C dehned recently by Reiner in the noncrossing case and Postnikov in the nonnesting case. Some of our tools come from the theory of hyperplane arrangements. Submitted January 30 1998 Accepted September 10 1998 1. Introduction A noncrossing partition of the set n 1 2 . n is a set partition K of n such that if a b c d and a c are contained in a block B of K while b d are contained in a block B0 of K then B B . Noncrossing partitions are classical combinatorial objects with an extensive literature see 7 9 11 12 13 17 18 19 22 . Natural analogues of noncrossing partitions for the classical reflection groups of type B C and D were introduced by Reiner 16 and were shown to have similar enumerative and structural properties with those of the noncrossing partitions which are associated to the reflection groups of type A. Nonnesting partitions were recently defined by Postnikov see 16 Remark 2 in a uniform way for all irreducible root systems associated to Weyl groups. Let be such a root system and be a choice of positive roots. Define the root order on by a 3 if a ft 2 and ft a is a linear combination of positive roots with nonnegative coefficients. A nonnesting partition on is simply an antichain in the root order of . Postnikov observed that the nonnesting partitions on are in bijection with certain regions of an affine hyperplane arrangement related to the Coxeter arrangement associated to . For An-1 nonnesting partitions are naturally in bijection with set partitions K of n such that if a b c d and a d are consecutive elements of a block B of K then b c are not both contained in a .

TÀI LIỆU LIÊN QUAN
TỪ KHÓA LIÊN QUAN
crossorigin="anonymous">
Đã phát hiện trình chặn quảng cáo AdBlock
Trang web này phụ thuộc vào doanh thu từ số lần hiển thị quảng cáo để tồn tại. Vui lòng tắt trình chặn quảng cáo của bạn hoặc tạm dừng tính năng chặn quảng cáo cho trang web này.