2 citations · 4 across the 3 of their papers we have counts for
3 papers
math.CO2008
Using the Incompressibility Method to obtain Local Lemma results for Ramsey-type Problems
Pascal Schweitzer
We reveal a connection between the incompressibility method and the Lovasz local lemma in the context of Ramsey theory. We obtain bounds by repeatedly encoding objects of interest…
math.CO2008★ 2 cited
Counting Defective Parking Functions
Peter J. Cameron, Daniel Johannsen, Thomas Prellberg +1
Suppose that drivers each choose a preferred parking space in a linear car park with spaces. Each driver goes to the chosen space and parks there if it is free, and otherwi…
math.GR2005★ 2 cited
Context-Freeness of Higman-Thompson group's co-word problem
Joerg Lehnert, Pascal Schweitzer
The co-word problem of a group G generated by a set X is defined as the set of words in X which do not represent 1 in G. We introduce a new method to decide if a permutation group…