在数学领域，解决长期未解的难题往往能带来重大的突破。近日，加州大学洛杉矶分校的研究生James Leng、麻省理工学院数学研究生Ashwin Sah以及哥伦比亚大学助理教授Mehtaab Sawhney在组合数学领域取得了一项重要进展，解决了数十年来困扰数学家们的算术级数问题。
这项研究起源于1936年数学家Paul Erdős和Pál Turán提出的猜想，即在一个由整数组成的集合中，如果该集合包含非零分数比例的整数，那么它必然包含任意长度的算术级数。1975年，Endre Szemerédi证明了这一猜想，并为后续研究奠定了基础。
Szemerédi的结果揭示了一个问题：在有限的整数集合（例如从1到N的整数集合）中，在不可避免地包含一个被禁止的算术级数之前，集合中能使用的部分占比是多少？随着N的增加，这个占比会如何变化？
Leng、Sah和Sawhney的研究工作进一步量化了这个问题，他们证明了在避免四项或更多项的算术级数时，集合中能使用的部分占比会随着N的增加而减少。他们的工作不仅回答了Szemerédi定理中的一个关键问题，还证明了当集合中没有k项算术级数时，存在一个上限c_k，使得集合中最大子集的大小不超过这个上限。
这一成果是自20世纪90年代末Timothy Gowers提出理论以来，在解决算术级数问题上的重大进展。Gowers的理论为解决这类问题提供了一种全新的方法，并在2001年应用到了Szemerédi定理上，得到了更好的集合大小界限。
James Leng在研究中并未直接应用Gowers的理论，而是探索了与Gowers方法相关的问题。Sah和Sawhney通过与Leng的合作，发现了Gowers理论的潜在应用，并最终在避免五项级数的情况下取得了突破。
这一成果对于数学理论的发展具有重要意义，同时也为计算机科学和人工智能等领域提供了新的研究视角。通过对算术级数的深入研究，数学家们不仅揭示了数学中的深层次结构，也为解决实际问题提供了新的思路和方法。
英语如下：
News Title: “Mathematics Breakthrough: Students Unite to Solve Century-Old Puzzle”
Keywords: Puzzle Breakthrough, Mathematical Advancement, Graduate Contribution
News Content: In the realm of mathematics, solving longstanding problems often leads to significant breakthroughs. Recently, graduate students James Leng from the University of California, Los Angeles, Ashwin Sah, a mathematics graduate student from the Massachusetts Institute of Technology, and Mehtaab Sawhney, an assistant professor at Columbia University, made an important advancement in the field of combinatorics by solving a problem that has puzzled mathematicians for decades.
The origins of this research can be traced back to a conjecture proposed in 1936 by mathematicians Paul Erdős and Pál Turán, which suggests that in a set of integers, if the set contains a non-zero fraction of the integers, then it must contain an arithmetic progression of any length. In 1975, Endre Szemerédi proved this conjecture, laying the groundwork for future research.
Szemerédi’s result raised a question: what proportion of a finite set of integers (such as the integers from 1 to N) can be used before it inevitably contains a forbidden arithmetic progression? How does this proportion change as N increases?
The work of Leng, Sah, and Sawhney further quantifies this question, proving that when avoiding arithmetic progressions of four or more terms, the proportion of the set that can be used decreases as N increases. Their research not only answers a key question posed by Szemerédi’s theorem but also proves the existence of an upper bound c_k when a set does not contain a k-term arithmetic progression, limiting the size of the largest subset within the set.
This achievement represents a significant advancement in the resolution of arithmetic progression problems since the late 1990s when Timothy Gowers proposed a theory. Gowers’ theory provided a new approach to solving such problems, which was applied in 2001 to the Szemerédi theorem, leading to improved bounds on the size of the sets.
While James Leng did not directly apply Gowers’ theory in his research, he explored related issues. Sah and Sawhney, through their collaboration with Leng, discovered potential applications of Gowers’ theory and ultimately made a breakthrough in avoiding arithmetic progressions of five terms.
This result is of great significance for the development of mathematical theory and also offers new perspectives for research in fields such as computer science and artificial intelligence. Through in-depth study of arithmetic progressions, mathematicians not only reveal deep structures within mathematics but also provide new approaches and methods for solving practical problems.
【来源】https://www.jiqizhixin.com/articles/2024-08-15-2
Views: 1