The large-rank almost synchronizing conjecture for primitive groups

About 11 years old · traced to

Let GG be a primitive permutation group of degree nn, and let a map have rank rr, meaning that its image has cardinality rr. Large-rank almost synchronizing conjecture. If

n2<r<n,\frac{n}{2}<r<n,

then GG synchronizes the map. Equivalently, every map of rank strictly between n/2n/2 and nn is synchronized by GG; such maps are non-uniform. The paper presents this as a weaker version of the almost synchronizing conjecture and states that it remains a difficult problem to resolve the broader classification question.

References

Primary source

João Araújo, Wolfram Bentz, Peter J. Cameron, Gordon Royle and Artur Schaefer, “Primitive groups and synchronization”, arXiv:1504.01629 (2015).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.