Automatic proofs for formulae enumerating proper polycubes
From MaRDI portal
(Redirected from Publication:322211)
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
Cites work
- scientific article; zbMATH DE number 3148802 (Why is no real title available?)
- scientific article; zbMATH DE number 2024859 (Why is no real title available?)
- scientific article; zbMATH DE number 6272352 (Why is no real title available?)
- 1/d-expansions for the free energy of lattice animal models of a self-interacting branched polymer
- Counting multidimensional polyominoes
- Formulae and growth rates of high-dimensional polycubes
Cited in
(4)
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)
