Equationally extreme trees

Equationally extreme trees

We study extreme semilattices whose Hasse diagrams are trees, and prove that the linearly ordered tree of order n has the minimal average number of solutions of 1-variable equations.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of physics. Conference series 2021-05, Vol.1901 (1), p.12048
Hauptverfasser: Rybalov, A N, Shevlyakov, A N
Format: Artikel
Sprache:eng
Schlagworte:
Physics
Trees
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study extreme semilattices whose Hasse diagrams are trees, and prove that the linearly ordered tree of order n has the minimal average number of solutions of 1-variable equations.
ISSN:1742-6588
1742-6596
DOI:10.1088/1742-6596/1901/1/012048