Hostname: page-component-cd9895bd7-jn8rn Total loading time: 0 Render date: 2024-12-27T09:18:49.679Z Has data issue: false hasContentIssue false
  • English
  • Français

Symmetric Chain Decompositions of Linear Lattices

Published online by Cambridge University Press:  01 June 1997

FRANK VOGT  and
BERND VOIGT
FRANK VOGT
Affiliation:
Fachbereich Mathematik, Technische Hochschule Darmstadt, Schloßgartenstraße 7, D-64289 Darmstadt, Germany (e-mail: [email protected]_darmstadt.de)
BERND VOIGT
Affiliation:
Fachbereich Mathematik, Universität Bielefeld, D-33501 Bielefeld, Germany
Get access Rights & Permissions [Opens in a new window]

Abstract

It has been known for several years that the lattice of subspaces of a finite vector space has a decomposition into symmetric chains, i.e. a decomposition into disjoint chains that are symmetric with respect to the rank function of the lattice. This paper gives a positive answer to the long-standing open problem of providing an explicit construction of such a symmetric chain decomposition for a given lattice of subspaces of a finite (dimensional) vector space. The construction is done inductively using Schubert normal forms and results in a bracketing algorithm similar to the well-known algorithm for Boolean lattices.

Type
Research Article
Information
Combinatorics, Probability and Computing , Volume 6 , Issue 2 , June 1997 , pp. 231 - 245
Copyright
1997 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)