{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T17:29:50Z","timestamp":1767202190438,"version":"3.48.0"},"reference-count":34,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T00:00:00Z","timestamp":1766275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ICREA 2019"},{"name":"PALGAIT","award":["PID2023-148336NB-100"],"award-info":[{"award-number":["PID2023-148336NB-100"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This work introduces RAMA (Recursive Aesthetic Modular Approximation), a metaheuristic framework that models a restricted form of mathematical intuition inspired by the notebooks of Srinivasa Ramanujan. While Ramanujan often produced deep results without formal proofs, the heuristic processes guiding such discoveries remain poorly understood. RAMA treats large language models (LLMs) as proposal mechanisms within an iterative search that generates, evaluates, and refines candidate conjectures under an explicit energy functional balancing fit, description length, and aesthetic structure. A small set of Ramanujan-inspired heuristics\u2014modular symmetries, integrality cues, aesthetic compression, and near-invariance detection\u2014is formalized as micro-operators acting on symbolic states. We instantiate RAMA in two domains: (i) inverse engineering eta-quotients from partial q-series data and (ii) designing cyclotomic fingerprints with shadow gadgets for quantum circuits. In both settings, RAMA recovers compact structures from limited information and improves separation from classical baselines, illustrating how intuitive heuristic patterns can be rendered as explicit, reproducible computational procedures.<\/jats:p>","DOI":"10.3390\/a19010007","type":"journal-article","created":{"date-parts":[[2025,12,24]],"date-time":"2025-12-24T12:22:27Z","timestamp":1766578947000},"page":"7","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["RAMA: A Meta-Algorithmic Framework for Ramanujan-Style Heuristic Discovery Using Large Language Models"],"prefix":"10.3390","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9975-7780","authenticated-orcid":false,"given":"Jordi","family":"Vallverd\u00fa","sequence":"first","affiliation":[{"name":"Philosophy Department, ICREA, Universitat Aut\u00f2noma de Barcelona, 08193 Bellaterra, BCN, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2025,12,21]]},"reference":[{"key":"ref_1","unstructured":"Ramanujan, S. (1957). Notebooks (2 Vols.), Tata Institute of Fundamental Research."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Berndt, B.C. (1985). Ramanujan\u2019s Notebooks: Part I, Springer.","DOI":"10.1007\/978-1-4612-1088-7"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Berndt, B.C. (1989). Ramanujan\u2019s Notebooks: Part II, Springer.","DOI":"10.1007\/978-1-4612-4530-8"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Berndt, B.C. (1991). Ramanujan\u2019s Notebooks: Part III, Springer.","DOI":"10.1007\/978-1-4612-0965-2"},{"key":"ref_5","unstructured":"Berndt, B.C. (1993). Ramanujan\u2019s Notebooks: Part IV, Springer."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"Berndt, B.C. (1998). Ramanujan\u2019s Notebooks: Part V, Springer.","DOI":"10.1007\/978-1-4612-1624-7"},{"key":"ref_7","unstructured":"Ramanujan, S., and Andrews, G.E. (1988). The Lost Notebook and Other Unpublished Papers of Srinivasa Ramanujan, Springer."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Andrews, G.E., and Berndt, B.C. (2005). Ramanujan\u2019s Lost Notebook: Part I, Springer.","DOI":"10.1007\/0-387-28124-X"},{"key":"ref_9","unstructured":"Andrews, G.E., and Berndt, B.C. (2008). Ramanujan\u2019s Lost Notebook: Part II, Springer."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Andrews, G.E., and Berndt, B.C. (2012). Ramanujan\u2019s Lost Notebook: Part III, Springer.","DOI":"10.1007\/978-1-4614-3810-6"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Andrews, G.E., and Berndt, B.C. (2013). Ramanujan\u2019s Lost Notebook: Part IV, Springer.","DOI":"10.1007\/978-1-4614-4081-9"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Andrews, G.E., and Berndt, B.C. (2018). Ramanujan\u2019s Lost Notebook: Part V, Springer.","DOI":"10.1007\/978-3-319-77834-1"},{"key":"ref_13","unstructured":"Zwegers, S. (2002). Mock Theta Functions. [Ph.D. Thesis, Utrecht University]."},{"key":"ref_14","first-page":"143","article-title":"Ramanujan\u2019s mock theta functions and their applications (after Zwegers and Bringmann\u2013Ono)","volume":"326","author":"Zagier","year":"2010","journal-title":"Ast\u00e9risque"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"5765","DOI":"10.1073\/pnas.1300345110","article-title":"Ramanujan\u2019s mock theta functions","volume":"110","author":"Griffin","year":"2013","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"5782","DOI":"10.1073\/pnas.1301046110","article-title":"On Ramanujan\u2019s definition of mock theta function","volume":"110","author":"Rhoades","year":"2013","journal-title":"Proc. Natl. Acad. Sci. USA"},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Washington, L.C. (1997). Introduction to Cyclotomic Fields, Springer. [2nd ed.]. GTM.","DOI":"10.1007\/978-1-4612-1934-7"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute","year":"2019","journal-title":"Nature"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1038\/s41567-018-0124-x","article-title":"Characterizing quantum supremacy in near-term devices","volume":"14","author":"Boixo","year":"2018","journal-title":"Nat. Phys."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Aaronson, S., and Arkhipov, A. (2011, January 6\u20138). The computational complexity of linear optics. Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, San Jose, CA, USA.","DOI":"10.1145\/1993636.1993682"},{"key":"ref_21","unstructured":"Mullane, S. (2020). Sampling random quantum circuits: A pedestrian\u2019s guide. arXiv."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1112\/plms\/s2-42.1.230","article-title":"On computable numbers, with an application to the Entscheidungsproblem","volume":"42","author":"Turing","year":"1937","journal-title":"Proc. Lond. Math. Soc."},{"key":"ref_23","unstructured":"Kleene, S.C. (1952). Introduction to Metamathematics, North-Holland."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/321386.321395","article-title":"A machine-independent theory of the complexity of recursive functions","volume":"14","author":"Blum","year":"1967","journal-title":"J. ACM"},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1145\/321637.321648","article-title":"On effective procedures for speeding up algorithms","volume":"18","author":"Blum","year":"1971","journal-title":"J. ACM"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/343369.343384","article-title":"Sequential abstract-state machines capture sequential algorithms","volume":"1","author":"Gurevich","year":"2000","journal-title":"ACM Trans. Comput. Log."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Li, M., and Vit\u00e1nyi, P. (2008). An Introduction to Kolmogorov Complexity and Its Applications, Springer. [3rd ed.].","DOI":"10.1007\/978-0-387-49820-1"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Motwani, R., and Raghavan, P. (1995). Randomized Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511814075"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Goldin, D., Smolka, S.A., and Wegner, P. (2006). Interactive Computation: The New Paradigm, Springer.","DOI":"10.1007\/3-540-34874-3"},{"key":"ref_30","first-page":"1877","article-title":"Language Models are Few-Shot Learners","volume":"33","author":"Brown","year":"2020","journal-title":"NeurIPS"},{"key":"ref_31","first-page":"24824","article-title":"Chain-of-Thought Prompting Elicits Reasoning in Large Language Models","volume":"35","author":"Wei","year":"2022","journal-title":"NeurIPS"},{"key":"ref_32","unstructured":"Yao, S., Zhao, J., Yu, D., Du, N., Shafran, I., Narasimhan, K.R., and Cao, Y. (2023, January 1\u20135). ReAct: Synergizing Reasoning and Acting in Language Models. Proceedings of the Eleventh International Conference on Learning Representations, Kigali, Rwanda."},{"key":"ref_33","unstructured":"Schick, T., Dwivedi-Yu, J., Dess\u00ec, R., Raileanu, R., Lomeli, M., Hambro, E., Zettlemoyer, L., Cancedda, N., and Scialom, T. (2023). Toolformer: Language Models Can Teach Themselves to Use Tools. arXiv."},{"key":"ref_34","unstructured":"Garg, S., Tsipras, D., Liang, P., and Valiant, G. (2022). What Can Transformers Learn In-Context? A Case Study of Simple Function Classes. arXiv."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/1\/7\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T17:25:10Z","timestamp":1767201910000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/19\/1\/7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,21]]},"references-count":34,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["a19010007"],"URL":"https:\/\/doi.org\/10.3390\/a19010007","relation":{},"ISSN":["1999-4893"],"issn-type":[{"type":"electronic","value":"1999-4893"}],"subject":[],"published":{"date-parts":[[2025,12,21]]}}}