Automatic proofs for formulae enumerating proper polycubes

DOI10.1016/J.ENDM.2015.06.022zbMATH Open1346.05120OpenAlexW2173057753WikidataQ113875307 ScholiaQ113875307MaRDI QIDQ322211FDOQ322211

Authors: Gill Barequet, Mira Shalah 

Publication date: 14 October 2016

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2015/5088/

Recommendations

• Automatic proofs for formulae enumerating proper polycubes
• A method for proving polynomial enumeration formulas
• Combinatorial and automated proofs of certain identities
• Automated proofs for some Stirling number identities
• Automatic proofs and counterexamples for some ortholattice identities
• scientific article; zbMATH DE number 4072432
• Automatic generation of theorems and proofs on enumerating consecutive-Wilf classes
• Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences
• Automating Pólya theory: The computational complexity of the cycle index polynomial
• Enumeration of polycubes and Dirichlet convolutions

zbMATH Keywords

collapse of branched polymerspercolation processes

Mathematics Subject Classification ID

Applications of graph theory (05C90) Enumeration in graph theory (05C30)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Counting multidimensional polyominoes
• 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
• Title not available (Why is that?)
• Formulae and growth rates of high-dimensional polycubes

Cited In (4)

• Counting \(n\)-cell polycubes proper in \(n - k\) dimensions
• Proper \(n\)-cell polycubes in \(n - 3\) dimensions
• Automatic proofs and counterexamples for some ortholattice identities
• Automatic proofs for formulae enumerating proper polycubes

This page was built for publication: Automatic proofs for formulae enumerating proper polycubes

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