Trees, wreath products and finite Gelfand pairs (Q850014)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Trees, wreath products and finite Gelfand pairs
scientific article

    Statements

    Trees, wreath products and finite Gelfand pairs (English)
    0 references
    15 November 2006
    0 references
    Let \(G\) be a finite group and \(K\) a subgroup of \(G\). Let \(L(X)\) denote the complex-valued functions on \(X\). The pair \((G, K)\) is a Gelfand pair if the algebra \(L(K/G\setminus K)\) of bi-\(K\)-invariant functions is commutative. Let \(T\) be a finite rooted tree of depth \(m\) and let \(r= \{r_1,r_2,\dots, r_m\}\) be an \(m\)-tuple of integers \(\geq 2\). \(T\) is of type \(r\) when each vertex at distance \(k\) from the root has exactly \(r_{k+1}\) sons, for \(k= 0,1,2,\dots, m-1\). If \(s\) is another \(m\)-tuple with \(1\leq s_k\leq r_k\) then \(V(r, s)\) denotes the variety of subtrees of \(T\) of type \(s\). Then \(V(r, s)= \Aut(T)/K(r, s)\) where \(K(r, s)\) is the stabilizer of a fixed \(T'\) in \(V(r, s)\). The authors show that \((\Aut(T), K(r, s))\) is a Gelfand pair. This generalizes known examples: the ultrametric space, the Hamming scheme, and the Johnson scheme.
    0 references
    finite Gelfand pairs
    0 references
    wreath products
    0 references
    rooted trees
    0 references
    finite ultrametric space
    0 references
    Hamming scheme
    0 references
    Johnson scheme
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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