Automatic Proofs for Formulae Enumerating Proper Polycubes

Gill Barequet, Mira Shalah

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This video describes a general framework for computing formulae enumerating polycubes of size n which are proper in n-κ dimensions (i.e., spanning all n-κ dimensions), for a fixed value of κ. (Such formulae are central in the literature of statistical physics in the study of percolation processes and collapse of branched polymers.) The implemented software re-affirmed the alreadyproven formulae for k3, and proved rigorously, for the first time, the formula enumerating polycubes of size n that are proper in n-4 dimensions.

Original languageEnglish
Title of host publication31st International Symposium on Computational Geometry, SoCG 2015
EditorsJanos Pach, Lars Arge
Pages19-22
Number of pages4
ISBN (Electronic)9783939897835
DOIs
StatePublished - 1 Jun 2015
Event31st International Symposium on Computational Geometry, SoCG 2015 - Eindhoven, Netherlands
Duration: 22 Jun 201525 Jun 2015

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume34

Conference

Conference31st International Symposium on Computational Geometry, SoCG 2015
Country/TerritoryNetherlands
CityEindhoven
Period22/06/1525/06/15

Keywords

  • Inclusion-exclusion
  • Polycubes

All Science Journal Classification (ASJC) codes

  • Software

Fingerprint

Dive into the research topics of 'Automatic Proofs for Formulae Enumerating Proper Polycubes'. Together they form a unique fingerprint.

Cite this