most citedAn algorithm for uniform generation of unlabeled trees (Pólya trees), with an extension of Cayley's formula

1 citations · 1 across the 3 of their papers we have counts for

collaborators
Showing math.DSShow all

1 paper · 1 filter

math.DS2024

Shifts on the lamplighter group

Laurent Bartholdi, Ville Salo

We prove that the lamplighter group admits strongly aperiodic SFTs, has undecidable tiling problem, and the entropies of its SFTs are exactly the upper semicomputable nonnegative r…