Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Automorphism groups of countably categorical linear orders are extremely amenable - MaRDI portal

Automorphism groups of countably categorical linear orders are extremely amenable (Q2376898)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Automorphism groups of countably categorical linear orders are extremely amenable
scientific article

    Statements

    Automorphism groups of countably categorical linear orders are extremely amenable (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    A topological group \(G\) is extremely amenable if every action of \(G\) on a compact Hausdorff space has a fixed point. It was shown by \textit{V. G. Pestov} [Trans. Am. Math. Soc. 350, No. 10, 4149--4165 (1998; Zbl 0911.54034)] that the automorphism group of the linear order of \(\mathbb{Q}\) is extremely amenable. Here the authors show that every countable linear order has a canonical sum-shuffle expression. They use Fraïssé limits to show that every countably categorical linear order is extremely amenable. They use methods of \textit{A. S. Kechris} et al. [Geom. Funct. Anal. 15, No. 1, 106--189 (2005; Zbl 1084.54014)] to derive structural Ramsey theorems.
    0 references
    0 references
    linear orders
    0 references
    automorphism groups
    0 references
    countable categoricity
    0 references
    extreme amenability
    0 references
    Fraïssé classes
    0 references
    Ramsey property
    0 references
    topological group
    0 references
    sum-shuffle expression
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references