arXiv 0801.44042008-01math.COmath.AC

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

Maurice Pouzet, Nicolas M. Thiéry

备注：: 27 pages; submitted

英文摘要：

The profile of a relational structure $R$ is the function $φ_R$ which counts for every integer $n$ the number, possibly infinite, $φ_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures being identified. If $φ_R$ takes only finite values, this is the Hilbert function of a graded algebra associated with $R$, the age algebra $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 $R$ 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.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Some relational structures with polynomial growth and their associated algebras I: Quasi-polynomiality of the profile

The profile of a relational structure $R$ is the function $φ_R$ which counts for every integer $n$ the number $φ_R(n)$, possibly infinite, of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures being identified. If $φ_R$ takes only finite values, this is the Hilbert function of a graded algebra associated with $R$, the age algebra introduced by P. J. Cameron. In this paper we give a closer look at this association, particularly when the relational structure $R$ admits a finite monomorphic decomposition. This setting still encompass well-studied graded commutative …

2014-02-13math.ACmath.CO

Some relational structures with polynomial growth and their associated algebras

The profile of a relational structure R is the function phi_R which counts for every integer n the number, possibly infinite, phi_R(n) of substructures of R induced on the n-element subsets, isomorphic substructures being identified. Several graded algebras can be associated with R in such a way that the profile of R is simply the Hilbert function. An example of such graded algebra is the age algebra introduced by P.~J.~Cameron. In this paper, we give a closer look at this association, particularly when the relational structure R decomposes into finitely many monomorphic components. In this ca…

2006-01-11math.ACmath.CO

Stable regularity for relational structures

We generalize the stable graph regularity lemma of Malliaris and Shelah to the case of finite structures in finite relational languages, e.g., finite hypergraphs. We show that under the model-theoretic assumption of stability, such a structure has an equitable regularity partition of size polynomial in the reciprocal of the desired accuracy, and such that for each $k$-ary relation and $k$-tuple of parts of the partition, the density is close to either 0 or 1. In addition, we provide regularity results for finite and Borel structures that satisfy a weaker notion that we call almost stability.

2018-01-15math.COmath.LO

Polynomial growth and asymptotic dimension

Bonamy et al \cite{BBEGLPS} showed that graphs of polynomial growth have finite asymptotic dimension. We refine their result showing that a graph of polynomial growth strictly less than $n^{k+1}$ has asymptotic dimension at most $k$. As a corollary Riemannian manifolds of bounded geometry and polynomial growth strictly less than $n^{k+1}$ have asymptotic dimension at most $k$. We show also that there are graphs of growth $<n^{1+ε}$ for any $ε>0$ and infinite asymptotic Assouad-Nagata dimension.

2022-01-05math.COmath.MG

Permutation Classes of Polynomial Growth

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and sufficient conditions on sets of forbidden permutations which ensure that the associated pattern class is of polynomial growth is determined. A catalogue of all such sets of forbidden permutations having three or fewer elements is provided together with bounds on the degrees of the associated enumerating polynomials.

2007-02-07math.CO

Shatter functions with polynomial growth rates

We study how a single value of the shatter function of a set system restricts its asymptotic growth. Along the way, we refute a conjecture of Bondy and Hajnal which generalizes Sauer's Lemma.

2017-01-23cs.DMmath.CO

更多相关论文收起更多论文

Polynomial versus Exponential Growth in Repetition-Free Binary Words

It is known that the number of overlap-free binary words of length n grows polynomially, while the number of cubefree binary words grows exponentially. We show that the dividing line between polynomial and exponential growth is 7/3. More precisely, there are only polynomially many binary words of length n that avoid 7/3-powers, but there are exponentially many binary words of length n that avoid (7/3+)-powers. This answers an open question of Kobayashi from 1986.

2003-04-07cs.DMmath.CO

直角Coxeter群的强本原Salem增长多项式

Strongly Primitive Salem Growth Polynomials for Right-Angled Coxeter Groups

Chung-Ang University（中央大学）

通过定义图的团多项式研究直角Coxeter群的标准球面增长率，证明每个偶数度至少4可作为强本原Salem增长率的度数，并给出独立多项式对指定Salem多项式的阻碍。

2026-06-28math.COmath.GR

On finite reflexive homomorphism-homogeneous binary relational systems

A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Nešetřil introduced a relaxed version of homogeneity: we say that a structure is homomorphism-homogeneous if every homomorphism between finitely induced substructures of the structure extends to an endomorphism of the structure. In this paper we consider finite homomorphism-homogeneous relational systems with one reflexive binary relation. We show that for a large part of such relational systems (bidirectional…

2009-12-25math.CO

Polynomial growth of sumsets in abelian semigroups

Let S be an abelian semigroup, and A a finite subset of S. The sumset hA consists of all sums of h elements of A, with repetitions allowed. Let |hA| denote the cardinality of hA. Elementary lattice point arguments are used to prove that an arbitrary abelian semigroup has polynomial growth, that is, there exists a polynomial p(t) such that |hA| = p(h) for all sufficiently large h. Lattice point counting is also used to prove that sumsets of the form h_1A_1 + >... + h_rA_r have multivariate polynomial growth.

2002-04-03math.COmath.NT

Harmonic functions of polynomial growth on infinite penny graphs

For an infinite penny graph, we study the finite-dimensional property for the space of harmonic functions, or ancient solutions of the heat equation, of polynomial growth. We prove the asymptotically sharp dimensional estimate for the above spaces.

2020-10-13math.APmath.COmath.DG

The firefighter problem on polynomial and intermediate growth groups

We prove that any Cayley graph $G$ with degree $d$ polynomial growth does not satisfy $\{f(n)\}$-containment for any $f=o(n^{d-2})$. This settles the asymptotic behaviour of the firefighter problem on such graphs as it was known that $Cn^{d-2}$ firefighters are enough, answering and strengthening a conjecture of Develin and Hartke. We also prove that intermediate growth Cayley graphs do not satisfy polynomial containment, and give explicit lower bounds depending on the growth rate of the group. These bounds can be further improved when more geometric information is available, such as for Grigo…

2020-02-25cs.DMmath.COmath.GR

次数为2的多项式傅里叶增长

Fourier growth of degree $2$ polynomials

Princeton University（普林斯顿大学）；California Institute of Technology（加州理工学院）；MSU（密歇根州立大学）；University of South Carolina（南卡罗来纳大学）

研究了次数为2的多项式在傅里叶系数上的增长特性，给出了相关函数的绝对和的界限。

2026-02-25math.APmath.COmath.FA

A Mealy machine with polynomial growth of irrational degree

We consider a very simple Mealy machine (three states over a two-symbol alphabet), and derive some properties of the semigroup it generates. In particular, this is an infinite, finitely generated semigroup; we show that the growth function of its balls behaves asymptotically like n^2.4401..., where this constant is 1 + log(2)/log((1+sqrt(5))/2); that the semigroup satisfies the identity g^6=g^4; and that its lattice of two-sided ideals is a chain.

2007-01-12math.COmath.GR

多项式增长Borel图的大尺度几何

Large-scale geometry of Borel graphs of polynomial growth

从渐近几何与描述集合论角度研究多项式增长Borel图，通过构造粗嵌入证明$\mathbb Z^n$自由Borel作用的普适性，解决了超有限性与toast结构等问题。

2025-04-07math.COmath.LOmath.MG

Jumps in speeds of hereditary properties in finite relational languages

Given a finite relational language $\mathcal{L}$, a hereditary $\mathcal{L}$-property is a class of finite $\mathcal{L}$-structures closed under isomorphism and substructure. The speed of $\mathcal{H}$ is the function which sends an integer $n\geq 1$ to the number of distinct elements in $\mathcal{H}$ with underlying set $\{1, . . . , n\}$. In this paper we give a description of many new jumps in the possible speeds of a hereditary $\mathcal{L}$-property, where $\mathcal{L}$ is any finite relational language. In particular, we characterize the jumps in the polynomial and factorial ranges, and …

2022-02-03math.COmath.LO

Multiple recurrence and convergence for Hardy sequences of polynomial growth

We study the limiting behavior of multiple ergodic averages involving sequences of integers that satisfy some regularity conditions and have polynomial growth. We show that for "typical" choices of Hardy field functions $a(t)$ with polynomial growth, the averages $\frac{1}{N}\sum_{n=1}^N f_1(T^{[a(n)]}x)\cdot...\cdot f_\ell(T^{\ell [a(n)]}x)$ converge in the mean and we determine their limit. For example, this is the case if $a(t)=t^{3/2}, t\log{t},$ or $t^2+(\log{t})^2$. Furthermore, if ${a_1(t),...,a_\ell(t)}$ is a "typical" family of logarithmico-exponential functions of polynomial growth, …

2012-12-21math.COmath.DS

Dimensional bounds for ancient caloric functions on graphs

We study ancient solutions of polynomial growth to heat equations on graphs, and extend Colding and Minicozzi's theorem [CM19] on manifolds to graphs: For a graph of polynomial volume growth, the dimension of the space of ancient solutions of polynomial growth is bounded by the product of the growth degree and the dimension of harmonic functions with the same growth.

2019-03-10math.COmath.DGmath.MG

A finitary structure theorem for vertex-transitive graphs of polynomial growth

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with finite vertex stabilisers. We also present some applications. We show that a finite, connected vertex-transitive graph G of large diameter admits a quotient with fibres of small diameter on which the action of Aut(G) is virtually abelian with vertex stabilisers of bounded size. We also show that G has moderate growth in the sense of Diaconis and Saloff-Coste, …

2021-02-02math.COmath.GNmath.GR