ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS

DOI10.17654/NT039060843zbMath1499.05052MaRDI QIDQ5075065

Eman F. Mohommed, Haslinda Ibrahim, Nazihah Ahmad

Publication date: 10 May 2022

Published in: JP Journal of Algebra, Number Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

abacusconnected partition\(n\)-connected objectsnested chain abacus

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Polyominoes (05B50)

Cites Work

• Unnamed Item
• Enumeration of polyominoes inscribed in a rectangle
• Reconstructing convex polyominoes from horizontal and vertical projections
• Rouquier blocks.
• Another runner removal theorem for \(v\)-decomposition numbers of Iwahori-Hecke algebras and \(q\)-Schur algebras.
• Counting lattice animals: A parallel attack
• Reconstruction of L-convex Polyominoes
• Tiling the Plane with a Fixed Number of Polyominoes
• Some combinatorial results involving Young diagrams
• Statistics of lattice animals (polyominoes) and polygons
• Some problems in the counting of lattice animals, polyominoes, polygons and walks
• An algorithm for deciding if a polyomino tiles the plane

This page was built for publication: ENUMERATION OF n-CONNECTED OMINOES INSCRIBED IN AN ABACUS