1 citations · 1 across the 3 of their papers we have counts for
5 papers
Finite Chains of Two-Complexes and Acyclic Covers
Laurent Bartholdi, Roman Mikhailov
A negative answer to Whitehead's asphericity problem would follow from an infinite chain of two-complexes, starting with a non-aspherical one, in which every inclusion induces the…
Every countable group embeds in a group of type
Laurent Bartholdi, Roman Mikhailov
For every integer , we prove that every countable group embeds in a group of type . We also construct a group of type containing a copy of ever…
An algorithm for uniform generation of unlabeled trees (Pólya trees), with an extension of Cayley's formula
Laurent Bartholdi, Persi Diaconis
Pólya trees are rooted, unlabeled trees on vertices. This paper gives an efficient, new way to generate Pólya trees. This allows comparing typical unlabeled and labeled tree st…
Snakes can be fooled into thinking they live in a tree
Laurent Bartholdi, Ville Salo
We construct a finitely generated group which is not virtually free, yet has decidable snake tiling problem. This shows that either a long-standing conjecture by Ballier and Stein…
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…