Search arXivSearch

arXiv · 1003.4414

An elementary approach to toy models for D. H. Lehmer's conjecture

Abstract

In 1947, Lehmer conjectured that the Ramanujan's tau function $τ(m)$ never vanishes for all positive integers $m$, where $τ(m)$ is the $m$-th Fourier coefficient of the cusp form $Δ_{24}$ of weight 12. The theory of spherical $t$-design is closely related to Lehmer's conjecture because it is shown, by Venkov, de la Harpe, and Pache, that $τ(m)=0$ is equivalent to the fact that the shell of norm $2m$ of the $E_{8}$-lattice is a spherical 8-design. So, Lehmer's conjecture is reformulated in terms of spherical $t$-design. Lehmer's conjecture is difficult to prove, and still remains open. However, Bannai-Miezaki showed that none of the nonempty shells of the integer lattice $\ZZ^2$ in $\RR^2$ is a spherical 4-design, and that none of the nonempty shells of the hexagonal lattice $A_2$ is a spherical 6-design. Moreover, none of the nonempty shells of the integer lattices associated to the algebraic integers of imaginary quadratic fields whose class number is either 1 or 2, except for $\QQ(\sqrt{-1})$ and $\QQ(\sqrt{-3})$ is a spherical 2-design. In the proof, the theory of modular forms played an important role. Recently, Yudin found an elementary proof for the case of $\ZZ^{2}$-lattice which does not use the theory of modular forms but uses the recent results of Calcut. In this paper, we give the elementary (i.e., modular form free) proof and discuss the relation between Calcut's results and the theory of imaginary quadratic fields.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Eiichi Bannai, Tsuyoshi Miezaki, Vladimir A. Yudin. 2010-03-23. An elementary approach to toy models for D. H. Lehmer's conjecture. https://doi.org/10.1070/im2011v075n06abeh002565

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Small doublings in abelian groups of prime power torsion

Let $A$ be a subset of $G$, where $G$ is a finite abelian group of torsion $r$. It was conjectured by Ruzsa that if $|A+A|\leq K|A|$, then $A$ is contained in a coset of $G$ of size at most $r^{CK}|A|$ for some constant $C$. The case $r=2$ received considerable attention in a sequence of papers, and was resolved by Green and Tao. Recently, Even-Zohar and Lovett settled the case when $r$ is a prime. In this paper, we confirm the conjecture when $r$ is a power of prime. In particular, the bound we obtain is tight.

math.CO

Graph Polynomial for Colored Embedded Graphs: A Topological Approach

We study finite graphs embedded in oriented surfaces by associating a polynomial to it. The tools used in developing a theory of such graph polynomials are algebraic topological while the polynomial itself is inspired from ideas arising in physics. We also analyze a variant of these polynomials for colored embedded graphs. This is used to describe the change in the polynomial under basic graph theoretic operations. We conclude with several applications of this polynomial including detection of certain classes of graphs and the connection of this polynomial with topological entanglement entropy.

math.CO

Schur positivity of the spiders $S(a,2,1)$ and $S(a,4,1)$ via noncommutative symmetric functions

We prove that the spider graphs $S(a,2,1)$ and $S(a,4,1)$ are Schur positive for all integers $a\ge1$. Together with the known $e$-positivity results, this completes the $e$- and Schur-positivity classification of both families. Our approach uses noncommutative symmetric functions, including a particularly simple ribbon expansion for the path lift with coefficients given by powers of two. We give a new proof of the Shareshian--Wachs path formula at $t=1$ and construct corresponding lifts for spiders. The Littlewood--Richardson rule converts their ribbon expansions into a general Schur-coefficient formula in terms of weighted Yamanouchi words. Mass-preserving multi-injections and a reduction to finitely many inequalities in degree $10$ then prove the required positivity; exact computer verification of these inequalities completes the proof in full generality.

math.CO