Skip to Main Content

Transactions of the American Mathematical Society

Published by the American Mathematical Society since 1900, Transactions of the American Mathematical Society is devoted to longer research articles in all areas of pure and applied mathematics.

ISSN 1088-6850 (online) ISSN 0002-9947 (print)

The 2020 MCQ for Transactions of the American Mathematical Society is 1.48.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

Covers in free lattices
HTML articles powered by AMS MathViewer

by Ralph Freese and J. B. Nation PDF
Trans. Amer. Math. Soc. 288 (1985), 1-42 Request permission

Abstract:

In this paper we study the covering relation $(u \succ v)$ in finitely generated free lattices. The basic result is an algorithm which, given an element $w \in {\text {FL}}(X)$, finds all the elements which cover or are covered by $w$ (if any such elements exist). Using this, it is shown that covering chains in free lattices have at most five elements; in fact, all but finitely many covering chains in each free lattice contain at most three elements. Similarly, all finite intervals in ${\text {FL}}(X)$ are classified; again, with finitely many exceptions, they are all one-, two- or three-element chains.
References
Similar Articles
  • Retrieve articles in Transactions of the American Mathematical Society with MSC: 06B25
  • Retrieve articles in all journals with MSC: 06B25
Additional Information
  • © Copyright 1985 American Mathematical Society
  • Journal: Trans. Amer. Math. Soc. 288 (1985), 1-42
  • MSC: Primary 06B25
  • DOI: https://doi.org/10.1090/S0002-9947-1985-0773044-4
  • MathSciNet review: 773044