cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A384062 Number of maximal antichains in the Bruhat order of type A_n.

This page as a plain text file.
%I A384062 #9 May 22 2025 20:56:31
%S A384062 2,4,43,183667
%N A384062 Number of maximal antichains in the Bruhat order of type A_n.
%C A384062 The number of maximal antichains in the Bruhat order of the Weyl group A_n (isomorphic to the symmetric group S_{n+1}).
%D A384062 A. Bjorner, F. Brenti, Combinatorics of Coxeter Groups, Springer, 2009, 27-64.
%D A384062 V. V. Deodhar, On Bruhat ordering and weight-lattice ordering for a Weyl group, Indagationes Mathematicae, vol. 81, 1 (1978), 423-435.
%e A384062 For n=1 the elements are 1 (identity) and s1, the order contains pair (1, s1). The maximal antichains are {1} and {s1}.
%e A384062 For n=2 the line (Hasse) diagram is below.
%e A384062        s1*s2*s1
%e A384062         /   \
%e A384062       s2*s1 s1*s2
%e A384062        |  X  |
%e A384062        s2    s1
%e A384062         \   /
%e A384062           1
%e A384062 The set of maximal antichains is {{1}, {s2, s1}, {s2*s1, s1*s2}, {s1*s2*s1}}.
%Y A384062 Cf. A000142 (the order size), A005130 (the size of Dedekind-MacNeille completion), A384061.
%K A384062 nonn,hard,more
%O A384062 1,1
%A A384062 _Dmitry I. Ignatov_, May 18 2025