Computation of the Dedekind–MacNeille Completion for the Bruhat Order of the Weyl Group $\boldsymbol{W(B_{6})}$ with Concept Lattices
- 1 June 2026
- journal article
- research article
- Published by Pleiades Publishing Ltd in Lobachevskii Journal of Mathematics
- Vol. 47 (6) , 2966-2978
Abstract
This paper presents the computation of the Dedekind–MacNeille completion for the Bruhat order of the Weyl group \(B_{6}\) using concept lattices (also known as Galois lattices). We extend the associated sequence A378072 in the OEIS by providing the value for \(n=6\), which equals 142343254. Our approach leverages Formal Concept Analysis and the NextClosure algorithm to efficiently compute the completion. We also present additional results for other Weyl groups (infinite families up to computationally reasonable \(n\), \(A_{n}\), \(D_{n}\), and special ones, \(G_{2}\), \(F_{4}\), \(E_{6}\)) and analyze lattice properties, including the number of chains and (maximal) antichains, as well as lattice height, width, and breadth. The repository with data, code and selected results is available on GitHub https://github.com/dimachine/BruhatCompletion.
Keywords
This publication has 12 references indexed in Scilit:
- Formal Concept Analysis2024
- A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions2023
- Was Gelfand Right? The Many Loves of Lattice TheoryNotices of the American Mathematical Society, 2022
- Advancing mathematics by guiding human intuition with AINature, 2021
- Introduction to Formal Concept Analysis and Its Applications in Information Retrieval and Related Fields2015
- Chains in the Bruhat orderJournal of Algebraic Combinatorics, 2008
- Combinatorics of Coxeter Groups2005
- Stepwise construction of the Dedekind-MacNeille completion1998
- Finding all closed sets: A general approachOrder, 1991
- Partial orderings of permutations and monotonicity of a rank correlation statisticAnnals of the Institute of Statistical Mathematics, 1969