tailieunhanh - Báo cáo toán học: " ASYMPTOTICS OF THE NUMBER OF k-WORDS WITH AN -DESCENT"

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: ASYMPTOTICS OF THE NUMBER OF k-WORDS WITH AN -DESCENT. | ASYMPTOTICS OF THE NUMBER OF fc-WORDS WITH AN -DESCENT Amitai Regev Department of Mathematics The Pennsylvania State University University Park PA 16802 E-mail regev@ and Department of Theoretical Mathematics The Weizmann Institute of Science Rehovot 76100 Israel E-mail regev@ Submitted December 1997 Accepted February 25 1998 Abstract. The number of words w W1 wn 1 wi k for which there are 1 i1 i n and wir wie is given by the Schensted-Knuth correspondence in terms of standard and semi-standard Young tableaux. When n 1 the asymptotics of the number of such words is calculated. Work partially supported by . Grant No. DMS-94-01197. Typeset by AM 8-TeX 1 THE ELECTRONIC JOURNAL OF COMBINATORICS 3 1998 11 15 2 The Main Results. Let k n 0 be integers and let W k n w1 wn I 1 wi k for all 1 i n denote the set of words of length n on the alphabet 1 kg. A word w w1 wn 2 W k n is said to have a descent of length if there exist indices 1 i1 i n such that wi1 wie trivially such words exist if and only if k . Let W k n denote the set of words in W k n having descent and denote w k n W k n . Thus W k n W k k n and w k k n kn. Recall given two sequences ang and bng of real numbers we denote an bn or simply an bn if lim an 1. nn bn The main result here is Theorem 1. Let 1 k then . 1 2 - 1 w k rn n i k - k - 1 1 X k- ỉ . n k . n n where m f 1 2 m 1 Remark. k- t- fell k- Standard and Semistandard Tableaux. n dx Let A h n . A is a partition of n . A tableau of shape A filled with 1 is standard if the numbers in it are increasing both in rows and in columns. Let denote the number of such tableaux. It is well known that dx deg xx where Xx is the corresponding irreducible character of the symmetric group Sn. A k-tableau of shape A is a tableau filled with 1 k possibly with repetitions it is semi-standard if the numbers are weakly increasing in rows and strictly increasing in columns. Let sk A denote the number of such k-tableaux. It is well

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.