← All problems

Equivariant partite-presentation refinement for vertex transitive graphs

6 years old · traced to

Let \Gha\Gha be a vertex transitive graph with a partite presentation PP such that \Gha=PCay⁡(P)\Gha=\operatorname{PCay}(P), and let \Gpa≤Aut⁡c-loc(\Gha)\Gpa\leq\operatorname{Aut}_{c\text{-}loc}(\Gha) be a transitive group. A cover is a graph map η:\Gha→\sCP′\eta:\Gha\to\sC_{P'} compatible with the stated presentation structure. Equivariant presentation conjecture. There exists a partite presentation P′P' such that \Gha=PCay⁡(P′)\Gha=\operatorname{PCay}(P'), together with a cover η:\Gha→\sCP′\eta:\Gha\to\sC_{P'} and a homomorphism ϕ:\Gpa→Aut⁡(\sCP′)\phi:\Gpa\to\operatorname{Aut}(\sC_{P'}) satisfying

η(g⋅x)=ϕ(g)⋅η(x)\eta(g\cdot x)=\phi(g)\cdot\eta(x)

for x∈V(\Gha)∪E→(\Gha)x\in V(\Gha)\cup\overrightarrow{E}(\Gha). Thus the action of \Gpa\Gpa commutes with the cover. The source presents this as a possible generalisation of the procedure, but does not explicitly label it as an open conjecture.

References
  1. Agelos Georgakopoulos, Matthias Hamann and Alex Wendland, “Presentations for Vertex Transitive Graphs”, arXiv:2007.06432 (2020).

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.