Automatic proofs for formulae enumerating proper polycubes

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

Mira Shalah, Gill Barequet

Publication date: 14 October 2016

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

zbMATH Keywords

collapse of branched polymerspercolation processes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

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

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Automated discovery and proof of congruence theorems for partial sums of combinatorial sequences 👍 👎
• Automated proofs for some Stirling number identities 👍 👎
• Automatic proofs and counterexamples for some ortholattice identities 👍 👎
• Automatic Proofs for Formulae Enumerating Proper Polycubes. 👍 👎
• Combinatorial and automated proofs of certain identities 👍 👎
• Automating Pólya theory: The computational complexity of the cycle index polynomial 👍 👎
• A method for proving polynomial enumeration formulas 👍 👎
• Automatic Generation of Theorems and Proofs on Enumerating Consecutive-Wilf Classes 👍 👎

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)