scientific article; zbMATH DE number 2163326

MaRDI QIDQ4672176zbMATH OpenFDO

Authors B. N. Waphare, Madhukar M. Pawar

Publication date 29 April 2005

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorics of partially ordered sets (06A07) Lattices (06B99)

Recommendations

• Cartesian lattice counting by the vertical 2-sum
• A structure theorem for dismantlable lattices and enumeration
• Counting finite lattices.
• On the largest numbers of congruences of finite lattices
• Generating modular lattices of up to 30 elements

Cited in

(13)

• How many ways can two composition series intersect?
• Cartesian lattice counting by the vertical 2-sum
• The number of slim rectangular lattices.
• The asymptotic number of planar, slim, semimodular lattice diagrams
• scientific article; zbMATH DE number 5017751 (Why is no real title available?)
• Purely chromatic and hyper chromatic lattices
• Basic retracts and counting of lattices
• Posets dismantlable by doubly irreducibles
• Counting of lattices containing up to four comparable reducible elements and having nullity up to three
• Counting of lattices having nullity up to two
• Covering energy, linear sum and vertical sum of posets
• Counting of lattices on up to three reducible elements
• Counting of lattices containing up to 4 reducible elements and having nullity up to 3

This page was built for publication:

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