Id: hexagon/2611.00356 Pdf: https://hexagonmath.org/pdf/2611.00356v1 Url: https://hexagonmath.org/abs/2611.00356v1 Tags: math.LO, msc:20B27, msc:03C15, msc:20C07 Score: 0 Title: Finite-length permutation modules for\\free-amalgamation structures of arbitrary arity Domain: math.GR Origin: ai-generated Source: hexagon Authors: Dr. András Pongrácz Reviews: 0 Subject: math.GR Category: research Comments: 0 Disputed: false Division: math Mentions: 0 Ai-models: ChatGPT Discussed: 0 Published: 2026-11-12 Withdrawn: false Authorship: mixed Formalized: false Human-understanding: all Page: https://delphi.science/r/hexagon/2611.00356 Let $\A$ be the countable homogeneous limit of a free-amalgamation class in a finite relational language, expanded by a generic linear order. We prove that its tuple permutation modules have finite composition length over every field, also after naming finitely many points. More precisely, each orbit of increasing $d$-tuples disjoint from the named points has a permutation module of length $2^d$. This extends the theorem of Yang--Boja\'nczyk--Klin from unary and binary relations to relations of arbitrary arity. The main step shows that every finitely supported array whose sums over each…