Lower bound for the number of 4-element generating sets of direct products of two neighboring partition lattices

DOI10.7151/DMGAA.1393MaRDI QIDQ5045075zbMATH OpenOpenAlexFDO

Authors Lilian Oluoch, Amenah Al-Najafi

Publication date 3 November 2022

Published in Discussiones Mathematicae - General Algebra and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7151/dmgaa.1393

zbMATH Keywords

statisticspartition latticesublatticecomputer programdirect product of latticesfour-element generating setgenerating partition lattices

Mathematics Subject Classification ID

Semimodular lattices, geometric lattices (06C10) Lattices (06B99)

Recommendations

• Four-element generating sets of partition lattices and their direct products
• Lower bounds for the domination number and the total domination number of direct product graphs
• scientific article; zbMATH DE number 883301
• A lower bound for the Ramsey multiplicity of \(K_4\)
• Counting 4 4 matrix partitions of graphs
• Lower bounds for the maximum genus of 4-regular graphs
• The minimal generating sets of \(\mathrm{PSL}(2,p)\) of size four.
• Four-generated direct powers of partition lattices and authentication
• scientific article; zbMATH DE number 2156404
• On elementary Arguesian lattices with four generators

Cited in

(2)

• Four-generated direct powers of partition lattices and authentication
• Four-element generating sets of partition lattices and their direct products

This page was built for publication: Lower bound for the number of 4-element generating sets of direct products of two neighboring partition lattices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5045075)