{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:42:29Z","timestamp":1776577349989,"version":"3.51.2"},"reference-count":18,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T00:00:00Z","timestamp":1780272000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1016\/j.tcs.2026.115911","type":"journal-article","created":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T00:50:18Z","timestamp":1773967818000},"page":"115911","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Undecidability of polynomial inequalities in subset densities and additive energies"],"prefix":"10.1016","volume":"1074","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9043-0375","authenticated-orcid":false,"given":"Yaqiao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-3715-2132","authenticated-orcid":false,"given":"Yu","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2026.115911_bib0001","series-title":"Additive Combinatorics","volume":"105","author":"Tao","year":"2006"},{"key":"10.1016\/j.tcs.2026.115911_bib0002","series-title":"International Congress of Mathematicians (Madrid, 2006)","first-page":"581","article-title":"The dichotomy between structure and randomness, arithmetic progressions, and the primes","volume":"1","author":"Tao","year":"2007"},{"issue":"3","key":"10.1016\/j.tcs.2026.115911_bib0003","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1112\/S0025579318000207","article-title":"Additive energy and the metric Poissonian property","volume":"64","author":"Bloom","year":"2018","journal-title":"Mathematika"},{"key":"10.1016\/j.tcs.2026.115911_bib0004","article-title":"Additive energies on discrete cubes","author":"de Dios Pont","year":"2023","journal-title":"Discrete Anal."},{"key":"10.1016\/j.tcs.2026.115911_bib0005","first-page":"1","article-title":"Additive energies of subsets of discrete cubes","author":"Shao","year":"2024","journal-title":"Proc. R. Soc. Edinburgh Sect. A Math."},{"key":"10.1016\/j.tcs.2026.115911_bib0006","unstructured":"M.K. Goh, On an entropic analogue of additive energy, (2024). arXiv: 2406.18798."},{"key":"10.1016\/j.tcs.2026.115911_bib0007","series-title":"Additive Number Theory: Inverse Problems and the Geometry of Sumsets","volume":"165","author":"Nathanson","year":"1996"},{"issue":"4","key":"10.1016\/j.tcs.2026.115911_bib0008","doi-asserted-by":"crossref","first-page":"1684","DOI":"10.1137\/080717286","article-title":"On additive doubling and energy","volume":"24","author":"Katz","year":"2010","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/j.tcs.2026.115911_bib0009","unstructured":"W.T. Gowers, L. Mili\u0107evi\u0107, A quantitative inverse theorem for the U4 norm over finite fields, (2017). arXiv: 1712.00241."},{"key":"10.1016\/j.tcs.2026.115911_bib0010","doi-asserted-by":"crossref","first-page":"515","DOI":"10.4007\/annals.2025.201.2.5","article-title":"On a conjecture of Marton","volume":"201","author":"Gowers","year":"2025","journal-title":"Ann. Math."},{"key":"10.1016\/j.tcs.2026.115911_bib0011","unstructured":"J.-J. Liao, Improved exponent for Marton\u2019s conjecture in F2n, (2024). arXiv: 2404.09639."},{"issue":"9","key":"10.1016\/j.tcs.2026.115911_bib0012","doi-asserted-by":"crossref","first-page":"778","DOI":"10.1080\/00029890.1959.11989408","article-title":"On sets of acquaintances and strangers at any party","volume":"66","author":"Goodman","year":"1959","journal-title":"Am. Math. Mon."},{"issue":"2","key":"10.1016\/j.tcs.2026.115911_bib0013","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1090\/S0894-0347-2010-00687-X","article-title":"Undecidability of linear inequalities in graph homomorphism densities","volume":"24","author":"Hatami","year":"2011","journal-title":"J. Am. Math. Soc."},{"issue":"4","key":"10.1016\/j.tcs.2026.115911_bib0014","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s00493-019-4124-y","article-title":"Simple graph density inequalities with no sum of squares proofs","volume":"40","author":"Blekherman","year":"2020","journal-title":"Combinatorica"},{"key":"10.1016\/j.tcs.2026.115911_bib0015","series-title":"Forum of Mathematics, Sigma","first-page":"e40","article-title":"Undecidability of polynomial inequalities in weighted graph homomorphism densities","volume":"12","author":"Blekherman","year":"2024"},{"key":"10.1016\/j.tcs.2026.115911_bib0016","unstructured":"H. Chen, Y. Lin, J. Ma, F. Wei, Undecidability of polynomial inequalities in tournaments, (2024). arXiv: 2412.04972."},{"key":"10.1016\/j.tcs.2026.115911_bib0017","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1142\/9789812564894_0013","article-title":"Enumerable sets are diophantine","author":"Matiyasevi\u010d","year":"2003","journal-title":"Math. Logic 20th Century"},{"issue":"3","key":"10.1016\/j.tcs.2026.115911_bib0018","doi-asserted-by":"crossref","first-page":"549","DOI":"10.2307\/2273588","article-title":"Universal diophantine equation","volume":"47","author":"Jones","year":"1982","journal-title":"J. Symb. Logic"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001702?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397526001702?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,4,19]],"date-time":"2026-04-19T05:06:05Z","timestamp":1776575165000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397526001702"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,6]]},"references-count":18,"alternative-id":["S0304397526001702"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115911","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2026,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Undecidability of polynomial inequalities in subset densities and additive energies","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.tcs.2026.115911","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"115911"}}