EUVIMEDEUVIMED entdecken
Open Access · CC BY-NC 4.0

The “k = 1” Case of a Problem of Greene and Kleitman from 1976: Join-Irreducible Elements in the Lattice of Sperner 1-Families

Jonathan David Farley

Mathematica Pannonica · 2021

DOI: 10.1556/314.2021.00010 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematica Pannonica, 2021. Verfasst von Jonathan David Farley. Der Volltext ist frei zugänglich (Open Access, CC BY-NC 4.0).

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Let k ≥ 1. A Sperner k-family is a maximum-sized subset of a finite poset that contains no chain with k + 1 elements. In 1976 Greene and Kleitman defined a lattice-ordering on the set S k ( P ) of Sperner k -families of a fifinite poset P and posed the problem: “Characterize and interpret the join- and meet-irreducible elements of S k ( P ),” adding, “This has apparently not been done even for the case k = 1.” In this article, the case k = 1 is done.

Zitieren

APA

Farley, J. D. (2021). The “k = 1” Case of a Problem of Greene and Kleitman from 1976: Join-Irreducible Elements in the Lattice of Sperner 1-Families. Mathematica Pannonica. https://doi.org/10.1556/314.2021.00010

Vancouver

Farley JD. The “k = 1” Case of a Problem of Greene and Kleitman from 1976: Join-Irreducible Elements in the Lattice of Sperner 1-Families. Mathematica Pannonica. 2021. doi:10.1556/314.2021.00010

BibTeX
@article{Farley2021,
  author = {Farley, Jonathan David},
  title = {The “k = 1” Case of a Problem of Greene and Kleitman from 1976: Join-Irreducible Elements in the Lattice of Sperner 1-Families},
  journal = {Mathematica Pannonica},
  year = {2021},
  doi = {10.1556/314.2021.00010}
}
Kostenlos starten →