10,924 research outputs found

    Some relational structures with polynomial growth and their associated algebras II: Finite generation

    Get PDF
    The profile of a relational structure RR is the function φR\varphi_R which counts for every integer nn the number, possibly infinite, φR(n)\varphi_R(n) of substructures of RR induced on the nn-element subsets, isomorphic substructures being identified. If φR\varphi_R takes only finite values, this is the Hilbert function of a graded algebra associated with RR, the age algebra A(R)A(R), introduced by P.~J.~Cameron. In a previous paper, we studied the relationship between the properties of a relational structure and those of their algebra, particularly when the relational structure RR admits a finite monomorphic decomposition. This setting still encompasses well-studied graded commutative algebras like invariant rings of finite permutation groups, or the rings of quasi-symmetric polynomials. In this paper, we investigate how far the well know algebraic properties of those rings extend to age algebras. The main result is a combinatorial characterization of when the age algebra is finitely generated. In the special case of tournaments, we show that the age algebra is finitely generated if and only if the profile is bounded. We explore the Cohen-Macaulay property in the special case of invariants of permutation groupoids. Finally, we exhibit sufficient conditions on the relational structure that make naturally the age algebra into a Hopf algebra.Comment: 27 pages; submitte

    Labeled Trees and Localized Automorphisms of the Cuntz Algebras

    Full text link
    We initiate a detailed and systematic study of automorphisms of the Cuntz algebras \O_n which preserve both the diagonal and the core UHFUHF-subalgebra. A general criterion of invertibility of endomorphisms yielding such automorphisms is given. Combinatorial investigations of endomorphisms related to permutation matrices are presented. Key objects entering this analysis are labeled rooted trees equipped with additional data. Our analysis provides insight into the structure of {\rm Aut}(\O_n) and leads to numerous new examples. In particular, we completely classify all such automorphisms of O2{\mathcal O}_2 for the permutation unitaries in 4M2\otimes^4 M_2. We show that the subgroup of {\rm Out}(\O_2) generated by these automorphisms contains a copy of the infinite dihedral group ZZ2{\mathbb Z} \rtimes {\mathbb Z}_2.Comment: 35 pages, slight changes, to appear on Trans. Amer. Math. So

    Lattice congruences, fans and Hopf algebras

    Get PDF
    We give a unified explanation of the geometric and algebraic properties of two well-known maps, one from permutations to triangulations, and another from permutations to subsets. Furthermore we give a broad generalization of the maps. Specifically, for any lattice congruence of the weak order on a Coxeter group we construct a complete fan of convex cones with strong properties relative to the corresponding lattice quotient of the weak order. We show that if a family of lattice congruences on the symmetric groups satisfies certain compatibility conditions then the family defines a sub Hopf algebra of the Malvenuto-Reutenauer Hopf algebra of permutations. Such a sub Hopf algebra has a basis which is described by a type of pattern-avoidance. Applying these results, we build the Malvenuto-Reutenauer algebra as the limit of an infinite sequence of smaller algebras, where the second algebra in the sequence is the Hopf algebra of non-commutative symmetric functions. We also associate both a fan and a Hopf algebra to a set of permutations which appears to be equinumerous with the Baxter permutations.Comment: 34 pages, 1 figur

    On the (un)decidability of a near-unanimity term

    Get PDF
    We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two fixed elements. On the other hand, based on Rosenberg’s characterization of maximal clones, we present partial results towards proving the decidability of the general problem
    corecore