Pith. sign in

REVIEW 2 major objections 1 minor 43 references

Preperiodic points, finiteness, and structures of semigroups of algebraic morphisms

T0 review · 2 major / 1 minor · reviewed 2026-08-05 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper proves a Burnside-type finiteness theorem for torsion groups acting by algebraic morphisms via p-adic arcs, and ties common preperiodic points to the group structure.

desk verdict Bell–Tucker abstract promises real arithmetic-dynamics results, but the supplied full text is a SinLlama NLP paper, so there is no math to check. read the letter →

arxiv 2508.09114 v1 pith:YLGPCBHQ submitted 2025-08-12 math.NT math.AG

Jason P. Bell , Thomas J. Tucker This is my paper
classification math.NTmath.AG MSC 37P3037P5520F50
keywords preperiodicpointsBurnsideproblemp-adicarcmethodautomorphismgroupstorsionNorthcottpropertyfinitemorphismsarithmeticdynamics
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies finiteness questions for preperiodic points—points whose forward orbits eventually repeat—under algebraic morphisms. It first establishes a group-action analog of the Burnside problem for torsion groups using the p-adic arc method. It then proves results connecting how many preperiodic points elements of an automorphism group share with the algebraic structure of the group, in the spirit of theorems of Tits and Borel. Finally, it proves Northcott-type finiteness results for finite morphisms, showing that preperiodic points of bounded height form a finite set. Together these results aim to show that the arithmetic dynamics of a morphism is tightly constrained by the group it generates.

What carries the argument

The p-adic arc method is the key tool: it constructs p-adic analytic arcs in the variety, allowing the authors to transfer the Burnside problem into a statement about p-adic dynamics. The Northcott-type results use height functions, which measure arithmetic complexity, to prove finiteness of preperiodic points of bounded height.

What would settle it

Find a torsion group of algebraic automorphisms of a projective variety over a number field, satisfying the paper's hypotheses, whose set of common preperiodic points is infinite; such a construction would refute the main finiteness theorem.

Watch

Extended reading notes

Core claim

The paper's central discovery is that the Burnside phenomenon—ordinarily a statement about abstract torsion groups—has a natural dynamical counterpart. For a torsion group acting by algebraic morphisms, the p-adic arc method shows that common preperiodic points cannot be too abundant unless the group has special structure. More precisely, the set of points preperiodic for every element of an automorphism group is intimately tied to the group's algebraic properties: substantial commonality forces the group to resemble the rigid groups appearing in theorems of Tits and Borel. The paper also establishes Northcott-type finiteness results for finite morphisms, giving height-based finiteness for p

Load-bearing premise

The p-adic arc method must apply to every torsion group action treated; if any considered action lacks the required p-adic analytic structure, the Burnside-type finiteness and the derived structural conclusions fail.

Editorial extensions

If this is right

  • A torsion group of automorphisms of a projective variety that shares a large set of preperiodic points must be structurally constrained; the paper proves a precise finiteness/boundedness dichotomy.
  • Finite morphisms satisfy a Northcott-type property: preperiodic points of bounded height are finite, giving a new class of arithmetic finiteness results.
  • The p-adic arc method is effective: it provides a way to bound the number of common preperiodic points in the torsion setting, not just prove existence of bounds.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Because the arc construction does not obviously require morphisms to be invertible, the same method likely proves finiteness for semigroups of algebraic morphisms, not just groups.
  • The structural dichotomy for common preperiodic points resembles a dynamical Tits alternative; verifying whether a non-abelian free group can arise as the automorphism group with no common preperiodic points would be a natural test.
  • The Northcott-type theorems may generalize to function fields of positive characteristic, where height arguments usually need separate treatment; such a transfer is not explored in the abstract.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

2 major / 1 minor

Summary. The paper arXiv:2508.09114 (math.NT) presents an abstract that promises three contributions: (1) a group-action analog of the Burnside problem for torsion groups proved via the p-adic arc method; (2) results linking commonality of preperiodic points among automorphisms with structural group properties, related to results of Tits and Borel; and (3) Northcott-type finiteness results for finite morphisms. However, the full text supplied for review is not the mathematics paper. It is the SinLlama paper (arXiv:2508.09115), an NLP paper on extending the Llama-3-8B language model to Sinhala. As a result, no mathematical content from the claimed paper is available for inspection. This report is based solely on the abstract and the observation that the accompanying full text is a different article.

Significance. If the three sets of claims in the abstract are correct, they would constitute meaningful advances in arithmetic dynamics. In particular, a Burnside-type theorem for torsion groups acting by algebraic morphisms via a p-adic arc method would be a new structural result, and Northcott-type finiteness theorems for finite morphisms would have broad applications. The connection to Tits's and Borel's theorems is also potentially interesting. However, significance cannot be assessed without the actual theorems, proofs, and hypotheses. The abstract alone is insufficient to judge novelty or depth, and the correct full text is missing.

major comments (2)
  1. [Full text (entire document)] The complete text supplied for review is not the paper described in the abstract. It is the SinLlama paper (arXiv:2508.09115) on extending an LLM for Sinhala. No mathematical definitions, theorem statements, lemmas, proofs, or hypotheses of arXiv:2508.09114 are present. Consequently, the central claims — the p-adic arc Burnside-type theorem, the preperiodic-point commonality results, and the Northcott-type finiteness theorems — cannot be inspected or verified. This is a load-bearing omission: the manuscript as submitted is not the paper under review. The authors must provide the correct full text before any substantive review can occur.
  2. [Abstract] Even taking the abstract at face value, the statements are too under-specified to assess. The 'group action analog of the Burnside problem' leaves unspecified: whether the group is finitely generated, what kind of torsion is assumed, what category of algebraic morphisms/actions is considered, what base field/ring the p-adic arc method requires, and how 'preperiodic point' and 'commonality' are defined. The classical Burnside problem is false for arbitrary torsion groups, so specific hypotheses are essential. Absent the missing full text, I cannot determine whether the claimed theorems are even congruent with known results.
minor comments (1)
  1. [Abstract] The phrase 'well-known results of Tits and Borel' should be accompanied by precise references (e.g., Tits's alternative, Borel's fixed point theorem or density theorem) so readers know which results are meant.

Circularity Check

0 steps flagged · score 0.0 of 10

No circular step identifiable from available material; the supplied full text is an unrelated NLP paper.

full rationale

The only text attributable to arXiv:2508.09114 is the abstract, which announces a group-action analog of the Burnside problem via the p-adic arc method, structural results about common preperiodic points in automorphism groups, and Northcott-type finiteness results. These are ordinary mathematical theorem claims; the abstract contains no definition, fitted parameter, self-citation, or uniqueness argument from which a circular reduction could be exhibited. The supplied 'full text' is the SinLlama paper (arXiv:2508.09115), not the target math manuscript, so no equation-level derivation chain can be inspected. Under the hard rule that circularity may be flagged only when the paper's own text exhibits the specific reduction, no circular step can be identified. Accordingly the score is 0 rather than a speculative intermediate value. Full verification would require the actual text of 2508.09114.

Assumptions & free parameters 0 free parameters · 0 assumptions · 0 invented entities

Abstract-only review. No free parameters, axioms, or invented entities can be identified from the abstract alone. The p-adic arc method and Northcott-type setting imply standard assumptions in algebraic geometry and p-adic analysis, but the exact hypotheses are not given.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Preperiodic points, finiteness, and structures of semigroups of algebraic morphisms." pith.science (2026). https://pith.science/paper/YLGPCBHQ

@misc{pith2026250809114,
  author       = {Pith},
  title        = {Pith review of: Preperiodic points, finiteness, and structures of semigroups of algebraic morphisms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/YLGPCBHQ}},
  note         = {Machine review of arXiv:2508.09114}
}
read the original abstract

In this paper, we explore a variety of finiteness questions for preperiodic points of morphisms. We begin by treating a group action analog of the Burnside problem for torsion groups using the p-adic arc method. We then prove some results connecting commonality of preperiodic points for elements of an automorphism group with structural properties of the group; these results are related to well-known results of Tits and Borel. We finish by proving some Northcott-type results for finite morphisms.

Discussion (0). Sign in to comment.

Reference graph

Works this paper leans on

43 extracted references · 22 canonical work pages

  1. [1]

    The llama 3 herd of models,

    A. Grattafiori, A. Dubey, A. Jauhri, A. Pandey, A. Ka- dian, A. Al-Dahle, A. Letman, A. Mathur, A. Schelten, A. Vaughan et al., “The llama 3 herd of models,” arXiv preprint arXiv:2407.21783, 2024

    arXiv 2024

  2. [2]

    Gemma: Open models based on gemini research and technology,

    G. Team, T. Mesnard, C. Hardin, R. Dadashi, S. Bhupati- raju, S. Pathak, L. Sifre, M. Rivi `ere, M. S. Kale, J. Love et al., “Gemma: Open models based on gemini research and technology,” arXiv preprint arXiv:2403.08295, 2024

    arXiv 2024

  3. [3]

    Don‘t trust ChatGPT when your question is not in English: A study of multilingual abilities and types of LLMs,

    X. Zhang, S. Li, B. Hauer, N. Shi, and G. Kondrak, “Don‘t trust ChatGPT when your question is not in English: A study of multilingual abilities and types of LLMs,” in Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing , H. Bouamor, J. Pino, and K. Bali, Eds. Singapore: Association for Computational Linguistics, Dec. 202...

    work page 2023

  4. [4]

    Survey on publicly available sinhala natural language processing tools and research,

    N. De Silva, “Survey on publicly available sinhala natural language processing tools and research,” arXiv preprint arXiv:1906.02358v25, 2025

    arXiv 1906

  5. [5]

    Some languages are more equal than others: Probing deeper into the linguistic disparity in the nlp world,

    S. Ranathunga and N. De Silva, “Some languages are more equal than others: Probing deeper into the linguistic disparity in the nlp world,” in Proceedings of the 2nd Conference of the Asia-Pacific Chapter of the Association for Computational Linguistics and the 12th International Joint Conference on Natural Language Processing (Vol- ume 1: Long Papers) , 2...

    work page 2022

  6. [6]

    The state and fate of linguistic diversity and inclusion in the NLP world,

    P. Joshi, S. Santy, A. Budhiraja, K. Bali, and M. Choudhury, “The state and fate of linguistic diversity and inclusion in the NLP world,” in Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics , D. Jurafsky, J. Chai, N. Schluter, and J. Tetreault, Eds. Online: Association for Computational Linguistics, Jul. 2020, pp. 6282–

    work page 2020

  7. [7]

    BERTifying Sinhala -- A Comprehensive Analysis of Pre-trained Language Models for Sinhala Text Classification

    V . Dhananjaya, P. Demotte, S. Ranathunga, and S. Jayasena, “Bertifying sinhala–a comprehensive anal- ysis of pre-trained language models for sinhala text classification,” arXiv preprint arXiv:2208.07864 , 2022

    work page Pith review arXiv 2022

  8. [8]

    Mala-500: Massive language adaptation of large lan- guage models,

    P. Lin, S. Ji, J. Tiedemann, A. F. Martins, and H. Sch¨utze, “Mala-500: Massive language adaptation of large lan- guage models,” arXiv preprint arXiv:2401.13303 , 2024

    arXiv 2024

Show all 43 references
  1. [9]

    Aya model: An instruction fine- tuned open-access multilingual language model,

    A. ¨Ust¨un, V . Aryabumi, Z.-X. Yong, W.-Y . Ko, D. D’souza, G. Onilude, N. Bhandari, S. Singh, H.-L. Ooi, A. Kayid et al. , “Aya model: An instruction fine- tuned open-access multilingual language model,” arXiv preprint arXiv:2402.07827, 2024

    2024 arXiv

  2. [10]

    Glue: A multi-task benchmark and analysis platform for natural language understanding,

    A. Wang, A. Singh, J. Michael, F. Hill, O. Levy, and S. R. Bowman, “Glue: A multi-task benchmark and analysis platform for natural language understanding,” arXiv preprint arXiv:1804.07461 , 2018

    2018 arXiv

  3. [11]

    Attention is all you need,

    A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural informa- tion processing systems , vol. 30, 2017

    2017

  4. [12]

    Mistral 7b,

    A. Q. Jiang, A. Sablayrolles, A. Mensch, C. Bamford, D. S. Chaplot, D. de las Casas, F. Bressand, G. Lengyel, G. Lample, L. Saulnier, L. R. Lavaud, M.-A. Lachaux, P. Stock, T. L. Scao, T. Lavril, T. Wang, T. Lacroix, and W. E. Sayed, “Mistral 7b,” 2023. [Online]. Available: ht...

    2023 arXiv

  5. [13]

    Mega: Multilingual evaluation of generative ai,

    K. Ahuja, H. Diddee, R. Hada, M. Ochieng, K. Ramesh, P. Jain, A. Nambi, T. Ganu, S. Segal, M. Axmed et al., “Mega: Multilingual evaluation of generative ai,” arXiv preprint arXiv:2303.12528, 2023

    2023 arXiv

  6. [14]

    A survey on evaluation of large language models,

    Y . Chang, X. Wang, J. Wang, Y . Wu, L. Yang, K. Zhu, H. Chen, X. Yi, C. Wang, Y . Wang et al., “A survey on evaluation of large language models,” ACM transactions on intelligent systems and technology , vol. 15, no. 3, pp. 1–45, 2024

    2024

  7. [15]

    Continual pre-training mitigates forgetting in language and vision,

    A. Cossu, A. Carta, L. Passaro, V . Lomonaco, T. Tuyte- laars, and D. Bacciu, “Continual pre-training mitigates forgetting in language and vision,” Neural Networks, vol. 179, p. 106492, 2024

    2024

  8. [16]

    Llamaturk: Adapting open-source genera- tive large language models for low-resource language,

    C. Toraman, “Llamaturk: Adapting open-source genera- tive large language models for low-resource language,” arXiv preprint arXiv:2405.07745 , 2024

    2024 arXiv

  9. [17]

    Taco: Enhancing cross-lingual transfer for low-resource languages in llms through translation-assisted chain-of-thought processes,

    B. Upadhayay and V . Behzadan, “Taco: Enhancing cross-lingual transfer for low-resource languages in llms through translation-assisted chain-of-thought processes,” arXiv preprint arXiv:2311.10797 , 2023

    2023 arXiv

  10. [18]

    Adap- tive machine translation with large language models,

    Y . Moslem, R. Haque, J. D. Kelleher, and A. Way, “Adap- tive machine translation with large language models,” arXiv preprint arXiv:2301.13294 , 2023

    2023 arXiv

  11. [19]

    Zero-shot sentiment analysis in low-resource languages using a multilingual sentiment lexicon,

    F. Koto, T. Beck, Z. Talat, I. Gurevych, and T. Baldwin, “Zero-shot sentiment analysis in low-resource languages using a multilingual sentiment lexicon,” arXiv preprint arXiv:2402.02113, 2024

    2024 arXiv

  12. [20]

    Word embedding evaluation for sinhala,

    D. Lakmal, S. Ranathunga, S. Peramuna, and I. Herath, “Word embedding evaluation for sinhala,” in Proceed- ings of the Twelfth Language Resources and Evaluation Conference, 2020, pp. 1874–1881

    2020

  13. [21]

    Roberta: A robustly optimized bert pretraining ap- proach,

    Y . Liu, M. Ott, N. Goyal, J. Du, M. Joshi, D. Chen, O. Levy, M. Lewis, L. Zettlemoyer, and V . Stoyanov, “Roberta: A robustly optimized bert pretraining ap- proach,” arXiv preprint arXiv:1907.11692 , 2019

    1907 arXiv

  14. [22]

    Polylm: An open source polyglot large language model,

    X. Wei, H. Wei, H. Lin, T. Li, P. Zhang, X. Ren, M. Li, Y . Wan, Z. Cao, B. Xie et al., “Polylm: An open source polyglot large language model,” arXiv preprint arXiv:2307.06018, 2023

    2023 arXiv

  15. [23]

    Eliciting the translation ability of large language models via multilingual finetuning with translation instructions,

    J. Li, H. Zhou, S. Huang, S. Cheng, and J. Chen, “Eliciting the translation ability of large language models via multilingual finetuning with translation instructions,” Transactions of the Association for Computational Lin- guistics, vol. 12, pp. 576–592, 2024

    2024

  16. [24]

    The falcon series of open lan- guage models,

    E. Almazrouei, H. Alobeidli, A. Alshamsi, A. Cappelli, R. Cojocaru, M. Debbah, ´E. Goffinet, D. Hesslow, J. Lau- nay, Q. Malartic et al. , “The falcon series of open lan- guage models,” arXiv preprint arXiv:2311.16867 , 2023

    2023 arXiv

  17. [25]

    Crosslingual gener- alization through multitask finetuning,

    N. Muennighoff, T. Wang, L. Sutawika, A. Roberts, S. Biderman, T. L. Scao, M. S. Bari, S. Shen, Z.- X. Yong, H. Schoelkopf et al. , “Crosslingual gener- alization through multitask finetuning,” arXiv preprint arXiv:2211.01786, 2022

    2022 arXiv

  18. [26]

    Phi-3 technical report: A highly capable lan- guage model locally on your phone,

    M. Abdin, J. Aneja, H. Awadalla, A. Awadallah, A. A. Awan, N. Bach, A. Bahree, A. Bakhtiari, J. Bao, H. Behl et al. , “Phi-3 technical report: A highly capable lan- guage model locally on your phone,” arXiv preprint arXiv:2404.14219, 2024

    2024 arXiv

  19. [27]

    Opt: Open pre-trained transformer language models,

    S. Zhang, S. Roller, N. Goyal, M. Artetxe, M. Chen, S. Chen, C. Dewan, M. Diab, X. Li, X. V . Lin et al. , “Opt: Open pre-trained transformer language models,” arXiv preprint arXiv:2205.01068 , 2022

    2022 arXiv

  20. [28]

    Bigtranslate: Augmenting large language models with multilingual translation capability over 100 languages. arxiv 2023,

    W. Yang, C. Li, J. Zhang, and C. Zong, “Bigtranslate: Augmenting large language models with multilingual translation capability over 100 languages. arxiv 2023,” arXiv preprint arXiv:2305.18098

    2023 arXiv

  21. [29]

    Measuring massive multitask language understanding,

    D. Hendrycks, C. Burns, S. Basart, A. Zou, M. Mazeika, D. Song, and J. Steinhardt, “Measuring massive multitask language understanding,” arXiv preprint arXiv:2009.03300, 2020

    2009 arXiv

  22. [30]

    Think you have solved question answering? try arc, the ai2 reasoning challenge,

    P. Clark, I. Cowhey, O. Etzioni, T. Khot, A. Sabharwal, C. Schoenick, and O. Tafjord, “Think you have solved question answering? try arc, the ai2 reasoning challenge,” arXiv preprint arXiv:1803.05457 , 2018

    2018 arXiv

  23. [31]

    Drop: A reading comprehension benchmark requiring discrete reasoning over paragraphs,

    D. Dua, Y . Wang, P. Dasigi, G. Stanovsky, S. Singh, and M. Gardner, “Drop: A reading comprehension benchmark requiring discrete reasoning over paragraphs,” arXiv preprint arXiv:1903.00161 , 2019

    1903 arXiv

  24. [32]

    Gpqa: A graduate-level google-proof q&a benchmark,

    D. Rein, B. L. Hou, A. C. Stickland, J. Petty, R. Y . Pang, J. Dirani, J. Michael, and S. R. Bowman, “Gpqa: A graduate-level google-proof q&a benchmark,” in First Conference on Language Modeling , 2024

    2024

  25. [33]

    Madlad- 400: A multilingual and document-level large audited dataset,

    S. Kudugunta, I. Caswell, B. Zhang, X. Garcia, D. Xin, A. Kusupati, R. Stella, A. Bapna, and O. Firat, “Madlad- 400: A multilingual and document-level large audited dataset,” Advances in Neural Information Processing Systems, vol. 36, pp. 67 284–67 296, 2023

    2023

  26. [34]

    Culturax: A cleaned, enormous, and multilingual dataset for large language models in 167 languages,

    T. Nguyen, C. Van Nguyen, V . D. Lai, H. Man, N. T. Ngo, F. Dernoncourt, R. A. Rossi, and T. H. Nguyen, “Culturax: A cleaned, enormous, and multilingual dataset for large language models in 167 languages,” arXiv preprint arXiv:2309.09400, 2023

    2023 arXiv

  27. [35]

    Shoulders of Giants: A Look at the Degree and Utility of Openness in NLP Research,

    S. Ranathunga, N. de Silva, D. Jayakody, and A. Fer- nando, “Shoulders of Giants: A Look at the Degree and Utility of Openness in NLP Research,” in Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics, 2024

    2024

  28. [36]

    Introduction to common crawl datasets,

    J. M. Patel, “Introduction to common crawl datasets,” in Getting structured data from the internet: running web crawlers/scrapers on a big data production scale . Springer, 2020, pp. 277–324

    2020

  29. [37]

    Improving the quality of web-mined parallel corpora of low-resource languages using debiasing heuristics,

    A. Fernando, S. Ranathunga, and N. de Silva, “Improving the quality of web-mined parallel corpora of low-resource languages using debiasing heuristics,” arXiv preprint arXiv:2502.19074, 2025

    2025

  30. [38]

    Sinhala text classification: observations from the perspective of a resource poor language,

    N. de Silva, “Sinhala text classification: observations from the perspective of a resource poor language,” Re- searchGate, 2015

    2015

  31. [39]

    Sentiment analy- sis of sinhala news comments,

    S. Ranathunga and I. U. Liyanage, “Sentiment analy- sis of sinhala news comments,” Transactions on Asian and Low-Resource Language Information Processing , vol. 20, no. 4, pp. 1–23, 2021

    2021

  32. [40]

    Efficient and effective text encoding for chinese llama and alpaca,

    Y . Cui, Z. Yang, and X. Yao, “Efficient and effective text encoding for chinese llama and alpaca,” arXiv preprint arXiv:2304.08177, 2023

    2023 arXiv

  33. [41]

    Monolingual or multilingual instruc- tion tuning: Which makes a better alpaca,

    P. Chen, S. Ji, N. Bogoychev, A. Kutuzov, B. Haddow, and K. Heafield, “Monolingual or multilingual instruc- tion tuning: Which makes a better alpaca,” arXiv preprint arXiv:2309.08958, 2023

    2023 arXiv

  34. [42]

    Lora: Low-rank adaptation of large language models

    E. J. Hu, Y . Shen, P. Wallis, Z. Allen-Zhu, Y . Li, S. Wang, L. Wang, W. Chen et al., “Lora: Low-rank adaptation of large language models.” ICLR, vol. 1, no. 2, p. 3, 2022. APPENDIX A PROMPTS USED All of the prompts used for the benchmark process referred to the prompts given...

    2022

  35. [6293]

    Available: https://aclanthology.org/2020

    [Online]. Available: https://aclanthology.org/2020. acl-main.560/

    2020

Pith tools

Reviewed August 5, 2026 · model on record in the stance chip above.