7 citations · 8 across the 3 of their papers we have counts for
3 papers
math.CO2023★ 1 cited
Decidability in geometric grid classes of permutations
Samuel Braunfeld
We prove that the basis and the generating function of a geometric grid class of permutations Geom are computable from the matrix , as well as some variations on this resul…
math.LO2020
The undecidability of joint embedding for 3-dimensional permutation classes
Samuel Braunfeld
As a step towards resolving a question of Ruškuc on the decidability of joint embedding for hereditary classes of permutations, which may be viewed as structures in a language of 2…
math.LO2019★ 7 cited
The undecidability of joint embedding and joint homomorphism for hereditary graph classes
Samuel Braunfeld
We prove that the joint embedding property is undecidable for hereditary graph classes, via a reduction from the tiling problem. The proof is then adapted to show the undecidabilit…