Asymmetric colouring of locally compact permutation groups

DOI10.1112/BLMS.12824zbMATH Open1521.05215arXiv2208.08844OpenAlexW4360945750MaRDI QIDQ6096835FDOQ6096835

Authors: Florian Lehner 

Publication date: 15 September 2023

Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)

Abstract: Let $GleqmathrmSym(X)$ for a countable set $X$. Call a colouring of $X$ asymmetric, if the identity is the only element of $G$ which preserves all colours. The motion (also called minimal degree) of $G$ is the minimal number of elements moved by an element $ginGsetminusmathrmid$. We show that every locally compact, closed permutation group with infinite motion admits an asymmetric $2$-colouring. This generalises a recent result by Babai and confirms a conjecture by Imrich, Smith, Tucker, and Watkins from 2015.

Full work available at URL: https://arxiv.org/abs/2208.08844

Recommendations

• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed
• On asymmetric colourings of claw-free graphs
• Infinite motion and 2-distinguishability of graphs and groups
• scientific article; zbMATH DE number 510773
• Asymmetric edge-colorings of graphs with three colors

zbMATH Keywords

automorphisminfinite graphmotiondistinguishabilitydistinguishing numberinfinite permutation grouporbit-equivalence

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Infinite graphs (05C63) Infinite automorphism groups (20B27) General theory for infinite permutation groups (20B07) Combinatorial aspects of groups and algebras (05E16)

Cites Work

• On groups with no regular orbits on the set of subsets
• Symmetry breaking in graphs
• Title not available (Why is that?)
• Trivial Set-Stabilizers in Finite Permutation Groups
• Distinguishing maps
• A note on the asymptotic and computational complexity of graph distinguishability
• Distinguishing infinite graphs
• Distinguishing labellings of group action on vector spaces and graphs
• Distinguishing infinite graphs with bounded degrees
• Breaking graph symmetries by edge colourings
• Asymmetric trees with two prescribed degrees
• Infinite motion and 2-distinguishability of graphs and groups
• Distinguishing graphs with intermediate growth
• Random colourings and automorphism breaking in locally finite graphs
• Metric and topological aspects of the symmetric group of countable degree
• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed

Cited In (1)

• Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's conjecture confirmed

This page was built for publication: Asymmetric colouring of locally compact permutation groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6096835)