Combinatorial settlement planning

MaRDI QIDQ6183269zbMATH OpenFDO

Authors Mate Puljiz, Stjepan Šebek, Josip Žubrinić

Publication date 26 January 2024

Full work available at URL https://arxiv.org/abs/2107.07555, https://cdm.ucalgary.ca/article/view/73491

zbMATH Keywords

forbidden induced subgraph problemmaximal configurationoptimal patternsshift spacetilings

Mathematics Subject Classification ID

Mathematics and architecture (00A67) Combinatorial aspects of packing and covering (05B40) Integer programming (90C10)

Recommendations

• Packing Density of Combinatorial Settlement Planning Models
• On a variant of Flory model
• Packing solar cells on a roof
• Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
• Integer programming for urban design

Cites work

• Covering a Rectangle with T-Tetrominoes
• Dominating sets in directed graphs
• scientific article; zbMATH DE number 6108474 (Why is no real title available?)
• On the number of tilings of the rectangular board with T-tetrominoes
• The undecidability of the domino problem
• Tilings of rectangles with T-tetrominoes
• Undecidability and nonperiodicity for tilings of the plane

Cited in

(4)

• Packing Density of Combinatorial Settlement Planning Models
• On the structure factor of jammed particle configurations on the one-dimensional lattice
• On a variant of Flory model
• Predators and altruists arriving on jammed Riviera

This page was built for publication: Combinatorial settlement planning

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