Asymmetric colouring of locally compact permutation groups

DOI10.1112/BLMS.12824MaRDI QIDQ6096835zbMATH OpenOpenAlexFDO

Authors Florian Lehner

Publication date 15 September 2023

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

Copyright license Creative Commons Attribution-NonCommercial 4.0 International

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

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)

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.

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

Cites work

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

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)