English

Almost all trees have quantum symmetry

Quantum Algebra 2023-11-03 v2 Combinatorics

Abstract

From the work of Erd\H{o}s and R\'{e}nyi from 1963 it is known that almost all graphs have no symmetry. In 2017, Lupini, Man\v{c}inska and Roberson proved a quantum counterpart: Almost all graphs have no quantum symmetry. Here, the notion of quantum symmetry is phrased in terms of Banica's definition of quantum automorphism groups of finite graphs from 2005, in the framework of Woronowicz's compact quantum groups. Now, Erd\H{o}s and R\'{e}nyi also proved a complementary result in 1963: Almost all trees do have symmetry. The crucial point is the almost sure existence of a cherry in a tree. But even more is true: We almost surely have two cherries in a tree - and we derive that almost all trees have quantum symmetry. We give an explicit proof of this quantum counterpart of Erd\H{o}s and R\'{e}nyi's result on trees.

Cite

@article{arxiv.1911.02952,
  title  = {Almost all trees have quantum symmetry},
  author = {Luca Junk and Simon Schmidt and Moritz Weber},
  journal= {arXiv preprint arXiv:1911.02952},
  year   = {2023}
}

Comments

11 pages; fixed minor mistake in the proof of the main result

R2 v1 2026-06-23T12:08:37.832Z