Seminar • Algorithms and Complexity • Polycubes with Small Perimeter Defect

Please note: This seminar will take place in DC 2306.

Gill Barequet, Professor
Department of Computer Science, The Technion

Lattice animals are connected sets of cells on a lattice.  For example, \emph{polyominoes} are connected sets of cells on the planar square lattice, where connectivity is through edges (sides of the squares).

One of the main problems in this area is finding a formula for the number of animals (or for the number of members of some family of animals) on some lattice.

In this talk, I will explore methods for setting formulae for the number of animals on the $d$-dimensional cubical lattice, whose perimeter deviates by a fixed constant from the maximum possible perimeter.

Joint work with Andrei Asinowski (Alpen-Adria-Universität Klagenfurt) and Yufei Zheng (UMass Amherst).