Abstract:The GLY (Granville-Lin-Yau) Conjecture is a generalization of Lin, Xu and Yau's results. An important application of GLY is its use in characterizing an affine hypersurface in C n as a cone over a nonsingular projective variety. In addition, the Rough Upper Estimate Conjecture in GLY, recently proved by Yau and Zhang, implies the Durfee Conjecture in singularity theory. This paper develops a unified approach to prove the Sharp Upper Estimate Conjecture for general n. Using this unified approach, we prove that … Show more
“…Proof. Before we begin the proof, it will be beneficial to explicitly write out the sharp GLY Conjecture for n = 6, which was proven in [17]. Equality holds if and only if a 1 = a 2 = a 3 = a 4 = a 5 = a 6 ∈ Z + .…”
Section: Zmentioning
confidence: 99%
“…The sharp GLY Conjecture has been proven to be true for 3 ≤ n ≤ 6 [19,4,17,7]. The rough GLY upper estimate for all n was proven by Yau and Zhang [20].…”
The subject of counting positive lattice points in n-dimensional simplexes has interested mathematicians for decades due to its applications in singularity theory and number theory. Enumerating the lattice points in a right-angled simplex is equivalent to determining the geometric genus of an isolated singularity of a weighted homogeneous complex polynomial. It is also a method to shed insight into large gaps in the sequence of prime numbers. Seeking to contribute to these applications, in this paper, we prove the Yau Geometric Conjecture in six dimensions, a sharp upper bound for the number of positive lattice points in a six-dimensional tetrahedron. The main method of proof is summing existing sharp upper bounds for the number of points in 5-dimensional simplexes over the cross sections of the six-dimensional simplex. Our new results pave the way for the proof of a fully general sharp upper bound for the number of lattice points in a simplex. It also sheds new light on proving the Yau Geometric and Yau Number-Theoretic Conjectures in full generality.
“…Proof. Before we begin the proof, it will be beneficial to explicitly write out the sharp GLY Conjecture for n = 6, which was proven in [17]. Equality holds if and only if a 1 = a 2 = a 3 = a 4 = a 5 = a 6 ∈ Z + .…”
Section: Zmentioning
confidence: 99%
“…The sharp GLY Conjecture has been proven to be true for 3 ≤ n ≤ 6 [19,4,17,7]. The rough GLY upper estimate for all n was proven by Yau and Zhang [20].…”
The subject of counting positive lattice points in n-dimensional simplexes has interested mathematicians for decades due to its applications in singularity theory and number theory. Enumerating the lattice points in a right-angled simplex is equivalent to determining the geometric genus of an isolated singularity of a weighted homogeneous complex polynomial. It is also a method to shed insight into large gaps in the sequence of prime numbers. Seeking to contribute to these applications, in this paper, we prove the Yau Geometric Conjecture in six dimensions, a sharp upper bound for the number of positive lattice points in a six-dimensional tetrahedron. The main method of proof is summing existing sharp upper bounds for the number of points in 5-dimensional simplexes over the cross sections of the six-dimensional simplex. Our new results pave the way for the proof of a fully general sharp upper bound for the number of lattice points in a simplex. It also sheds new light on proving the Yau Geometric and Yau Number-Theoretic Conjectures in full generality.
“…Case (6b) a 6 1 9 (31 + √ 574) ≈ 6.10648. In order to solve ths case we will need to use the sharp estimate of the GLY conjecture for n = 6, which has already been proven by Wang and Yau [35].…”
Section: Subcase (I)mentioning
confidence: 99%
“…It has also been proven generally for n 6. However, for n = 7, a counterexample to the conjecture has been given in [35]. In [40], a revised verision of GLY conjecture, i.e., Yau-Zhao-Zuo (YZZ) conjecture was proposed and proved to be ture in low dimensions.…”
Inspired by Durfee Conjecture in singularity theory, Yau formulated the Yau number theoretic conjecture (see Conjecture 1.3) which gives a sharp polynomial upper bound of the number of positive integral points in an n-dimensional (n 3) polyhedron. It is well known that getting the estimate of integral points in the polyhedron is equivalent to getting the estimate of the de Bruijn function ψ(x, y), which is important and has a number of applications to analytic number theory and cryptography. We prove the Yau number theoretic conjecture for n = 6. As an application, we give a sharper estimate of function ψ(x, y) for 5 y < 17, compared with the result obtained by Ennola.
“…The hunt for a good, simple estimate of q(α 1 , ..., α n ) and p(α 1 , ..., α n ) led to several results [7,8,9,15,17,18,19], finally put together in the GLY Conjeture, named after its authors Granville, Lin and Yau.…”
Section: A First Application: a Bound "á La Wilf "mentioning
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way which enables us to prove some results and a hopefully interesting characterization of the elements of a semigroup in terms of Groebner bases.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.