HEXAGONbeta

Finite-length permutation modules for\\free-amalgamation structures of arbitrary arity

A mix of human-written and AI-generated textHuman understanding: all partsmath.GR — Group Theorymath.LO — Logic

Contributed by Dr. András Pongrácz ↗

Version 1 / Nov 12, 2026 / CC BY 4.0

Abstract

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 dd-tuples disjoint from the named points has a permutation module of length 2d2^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 single coordinate vanish is a linear combination of alternating sums obtained by independently doubling its coordinates. Its proof combines a Ramsey separation theorem with a construction that moves finite configurations into prescribed order intervals. Over a finite field, we also obtain finitely many closed invariant linear subspaces of $\F^{A^k}$; each is generated, in the product topology, by functions definable using at most kk additional parameters.

Tools used

OpenAI
ChatGPTVersion GPT-6 Astra

References

  1. F. G. Abramson and L. A. Harrington, Models without indiscernibles , Journal of Symbolic Logic 43 (1978), no. 3, 572--600. doi:10.2307/2273534 (https://doi.org/10.2307/2273534).DOI
  2. M. Bodirsky, Complexity of Infinite-Domain Constraint Satisfaction , Lecture Notes in Logic 52 , Cambridge University Press, Cambridge, 2021. doi:10.1017/9781107337534 (https://doi.org/10.1017/9781107337534).DOI
  3. M. Bodirsky and B. Bodor, Permutation groups with small orbit growth , Journal of Group Theory 24 (2021), no. 4, 643--709. doi:10.1515/jgth-2018-0220 (https://doi.org/10.1515/jgth-2018-0220).DOI
  4. M. Bodirsky, M. Pinsker and A. Pongrácz, The 42 reducts of the random ordered graph , Proceedings of the London Mathematical Society 111 (2015), no. 3, 591--632. doi:10.1112/plms/pdv037 (https://doi.org/10.1112/plms/pdv037).DOI
  5. M. Bodirsky, M. Pinsker and T. Tsankov, Decidability of definability , Journal of Symbolic Logic 78 (2013), no. 4, 1036--1054. doi:10.2178/jsl.7804020 (https://doi.org/10.2178/jsl.7804020).DOI
  6. B. Bodor, Classification of ω\omega-categorical monadically stable structures , Journal of Symbolic Logic 89 (2024), no. 2, 460--495. doi:10.1017/jsl.2023.66 (https://doi.org/10.1017/jsl.2023.66).DOI
  7. M. Bojańczyk, J. Fijalkow, B. Klin and J. Moerman, Orbit-Finite-Dimensional Vector Spaces and Weighted Register Automata , TheoretiCS 3 (2024), Article 13, 1--41. doi:10.46298/theoretics.24.13 (https://doi.org/10.46298/theoretics.24.13).DOI
  8. F. Calderoni, A. Kwiatkowska and K. Tent, Simplicity of the automorphism groups of order and tournament expansions of homogeneous structures , Journal of Algebra 580 (2021), 43--62. doi:10.1016/j.jalgebra.2021.03.028 (https://doi.org/10.1016/j.jalgebra.2021.03.028).DOI
  9. P. J. Cameron, Transitivity of permutation groups on unordered sets , Mathematische Zeitschrift 148 (1976), no. 2, 127--139. doi:10.1007/BF01214702 (https://doi.org/10.1007/BF01214702).DOI
  10. D. Eisenbud, Groups of order automorphisms of certain homogeneous ordered sets , Michigan Mathematical Journal 16 (1969), 59--63. doi:10.1307/mmj/1029000166 (https://doi.org/10.1307/mmj/1029000166).DOI
Show all 25 referencesShow fewer references
  1. D. M. Evans, Permutation modules for Ramsey structures , arXiv:2603.29606v2, 2026. https://arxiv.org/abs/2603.29606v2.arXiv
  2. D. M. Evans, J. Hubička and J. Nešetřil, Ramsey properties and extending partial automorphisms for classes of finite structures , Fundamenta Mathematicae 253 (2021), 121--153. doi:10.4064/fm560-8-2020 (https://doi.org/10.4064/fm560-8-2020).DOI
  3. G. Higman, On infinite simple permutation groups , Publicationes Mathematicae Debrecen 3 (1954), 221--226. doi:10.5486/PMD.1954.3.3-4.06 (https://doi.org/10.5486/PMD.1954.3.3-4.06).DOI
  4. W. C. Holland, The lattice-ordered group of automorphisms of an ordered set , Michigan Mathematical Journal 10 (1963), 399--408. doi:10.1307/mmj/1028998976 (https://doi.org/10.1307/mmj/1028998976).DOI
  5. M. Junker and M. Ziegler, The 116 reducts of (Q,<,a)(\mathbb Q,<,a) , Journal of Symbolic Logic 73 (2008), no. 3, 861--884. doi:10.2178/jsl/1230396752 (https://doi.org/10.2178/jsl/1230396752).DOI
  6. A. S. Kechris, V. G. Pestov and S. Todorcevic, Fraïssé limits, Ramsey theory, and topological dynamics of automorphism groups , Geometric and Functional Analysis 15 (2005), no. 1, 106--189. doi:10.1007/s00039-005-0503-1 (https://doi.org/10.1007/s00039-005-0503-1).DOI
  7. D. Macpherson, A survey of homogeneous structures , Discrete Mathematics 311 (2011), no. 15, 1599--1634. doi:10.1016/j.disc.2011.01.024 (https://doi.org/10.1016/j.disc.2011.01.024).DOI
  8. D. Macpherson and K. Tent, Simplicity of some automorphism groups , Journal of Algebra 342 (2011), no. 1, 40--52. doi:10.1016/j.jalgebra.2011.05.021 (https://doi.org/10.1016/j.jalgebra.2011.05.021).DOI
  9. J. Nešetřil and V. Rödl, Partitions of finite relational and set systems , Journal of Combinatorial Theory, Series A 22 (1977), no. 3, 289--312. doi:10.1016/0097-3165(77)90004-8 (https://doi.org/10.1016/0097-3165(77)90004-8).DOI
  10. J. Nešetřil and V. Rödl, Ramsey classes of set systems , Journal of Combinatorial Theory, Series A 34 (1983), no. 2, 183--201. doi:10.1016/0097-3165(83)90055-9 (https://doi.org/10.1016/0097-3165(83)90055-9).DOI
  11. A. Pongrácz, Reducts of the Henson graphs with a constant , Annals of Pure and Applied Logic 168 (2017), no. 7, 1472--1489. doi:10.1016/j.apal.2017.01.009 (https://doi.org/10.1016/j.apal.2017.01.009).DOI
  12. S. Thomas, Reducts of the random graph , Journal of Symbolic Logic 56 (1991), no. 1, 176--181. doi:10.2307/2274912 (https://doi.org/10.2307/2274912).DOI
  13. S. Thomas, Reducts of random hypergraphs , Annals of Pure and Applied Logic 80 (1996), no. 2, 165--193. doi:10.1016/0168-0072(95)00061-5 (https://doi.org/10.1016/0168-0072(95)00061-5).DOI
  14. J. K. Truss, The group of the countable universal graph , Mathematical Proceedings of the Cambridge Philosophical Society 98 (1985), no. 2, 213--245. doi:10.1017/S0305004100063428 (https://doi.org/10.1017/S0305004100063428).DOI
  15. J. Yang, M. Bojańczyk and B. Klin, The Finite Length Property of the Rado Graph and Friends , 41st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS 2026), LIPIcs 380 , Article 82, 82:1--82:27. doi:10.4230/LIPIcs.LICS.2026.82 (https://doi.org/10.4230/LIPIcs.LICS.2026.82). Expanded version: arXiv:2605.21681v2 (https://arxiv.org/abs/2605.21681v2).arXivDOI

Version history

  1. v1 · 24 pagesSubmitted by Dr. András PongráczInitial depositCurrentNov 11, 2026