Almost all trees have quantum symmetry
Abstract
From the work of Erdos and R\'enyi from 1963 it is known that almost all graphs have no symmetry. In 2017, Lupini, Mancinska 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, Erdos and R\'enyi 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 Erdos and R\'enyi's result on trees.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.