Some relational structures with polynomial growth and their associated algebras II: Finite generation
From MaRDI portal
Publication:5087459
zbMATH Open1490.05277arXiv0801.4404MaRDI QIDQ5087459FDOQ5087459
Maurice Pouzet, Nicolas Thiéry
Publication date: 1 July 2022
Abstract: The profile of a relational structure is the function which counts for every integer the number, possibly infinite, of substructures of induced on the -element subsets, isomorphic substructures being identified. If takes only finite values, this is the Hilbert function of a graded algebra associated with , the age algebra , 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 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.
Full work available at URL: https://arxiv.org/abs/0801.4404
profilekernelHilbert functionrelational structurepolynomial growthquasi-symmetric polynomialsagegraded commutative algebraage algebrainvariants of permutation group
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polytopes, Rings, and K-Theory
- Computational invariant theory
- NONCOMMUTATIVE SYMMETRIC FUNCTIONS VI: FREE QUASI-SYMMETRIC FUNCTIONS AND RELATED ALGEBRAS
- Isomorphy up to complementation
- Sur l'extension aux relations de quelques propriétés des ordres
- Algorithms in invariant theory
- Möbius functions and semigroup representation theory.
- Group actions on Stanley-Reisner rings and invariants of permutation groups
- Ordering by Divisibility in Abstract Algebras
- Overview of some general results in combinatorial enumeration
- Profile and hereditary classes of ordered relational structures
- Nonassociative exponential and logarithm.
- Extending partial automorphisms and the profinite topology on free groups
- The morphology of infinite tournaments; application to the growth of their profile
- Hereditary properties of partitions, ordered graphs and ordered hypergraphs
- Qsym over Sym is free
- Sperner properties for groups and relations
- Algebraic invariants of graphs; a study based on computer exploration
- Relational structures determined by their finite induced substructures
- Admissible orders and linear forms
- Some relational structures with polynomial growth and their associated algebras. I: Quasi-polynomiality of the profile
- Growth Rates in Infinite Graphs and Permutation Groups
Cited In (3)
This page was built for publication: Some relational structures with polynomial growth and their associated algebras II: Finite generation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5087459)