Dedekind's numbers characterize distributive lattices (Q757457): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite models of regular identities / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of polynomials of an idempotent algebra. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(p_ n-\)sequences of idempotent algebras are strictly increasing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of \(p_ n\)-sequences for nonidempotent algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A solution of Dedekind's problem on the number of isotone Boolean functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of independent elements in finite abstract algebras with two binary symmetrical operations / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01190409 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2029947894 / rank
 
Normal rank

Latest revision as of 09:41, 30 July 2024

scientific article
Language Label Description Also known as
English
Dedekind's numbers characterize distributive lattices
scientific article

    Statements

    Dedekind's numbers characterize distributive lattices (English)
    0 references
    0 references
    1991
    0 references
    The main result is as follows. Let D(n) denote the cardinality of the free bounded distributive lattice on n free generators. A nontrivial algebra is equivalent to a distributive lattice if and only if the number of n-ary polynomials over the algebra is equal to D(n)-2, for all \(n\geq 0.\) The representability rank and the code of the variety of distributive lattices are presented.
    0 references
    0 references
    number of polynomials
    0 references
    representability rank
    0 references
    code of the variety of distributive lattices
    0 references
    0 references
    0 references