Miller Basis in Modular Forms
- Miller basis is a canonical basis for the space Mₖ of holomorphic modular forms, defined by prescribing the initial Fourier expansion at the cusp infinity.
- It is constructed using modular invariants such as Δ, Eisenstein series Eₖ′, and the j-invariant to generate Faber polynomials that simplify the study of zeros and asymptotic behavior.
- The framework has been employed to derive effective bounds and asymptotic results on the distribution of zeros on the standard fundamental domain and the unit arc.
The Miller basis is a canonical basis of the space of holomorphic modular forms of even weight , defined by prescribing the initial segment of the Fourier expansion at the cusp . If with , the basis consists of the unique forms or , for , satisfying
Equivalently, , and the range of 0 matches 1. In recent work the Miller basis has become a central framework for studying Faber polynomials, zero loci on the boundary of the standard fundamental domain, and asymptotic zero distributions depending on the ratio 2 (Zilka, 7 Oct 2025, Raveh, 2024).
1. Definition and ambient modular-form setting
Let 3 denote the space of holomorphic modular forms of even weight 4 for the full modular group. Writing
5
the Miller basis of 6 is the family
7
characterized by
8
For each 9 there is a unique modular form with that 0-expansion, and these forms constitute a basis of 1 (Zilka, 7 Oct 2025).
The same basis is written in the literature as 2, with
3
and the two descriptions coincide at the level of definition: the basis is adapted to the cusp 4, normalized by the coefficient of 5, and indexed by the vanishing order at infinity (Raveh, 2024). The subfamily with 6 lies in 7, so the Miller basis contains a distinguished basis of cusp forms. In the notation of the cusp-form paper, 8 are precisely the cusp forms of the Miller basis (Raveh, 2024).
This basis is “natural” and “canonical” in the sense used in the modular-form literature. It is adapted simultaneously to weight and to the truncated Fourier expansion, and in one formulation the Fourier coefficient matrix up to order 9 is in reduced row echelon form (Raveh, 2024).
2. Construction through 0, 1, 2, and Faber polynomials
The structural representation of the Miller basis uses the modular discriminant
3
the Eisenstein series 4 of weight 5, and the classical 6-invariant
7
Every modular form 8 with 9 can be written uniquely as
0
where 1 is a polynomial in one variable. For a Miller basis element, the associated polynomial is the Faber polynomial 2, characterized by
3
with 4 (Zilka, 7 Oct 2025).
A more algorithmic construction begins with the seed forms
5
Since 6 and 7, one has
8
Applying Gaussian elimination to the Fourier coefficient matrix of 9 up to order 0 produces the Miller basis in reduced row echelon form. The resulting Faber polynomial 1 has integer coefficients (Raveh, 2024).
The Faber-polynomial description converts zero problems for modular forms into zero problems for ordinary polynomials. If 2 are the zeros of 3, counted with multiplicity, then
4
because 5 is nonvanishing on 6 (Zilka, 7 Oct 2025). On the arc
7
one has
8
so zeros of 9 on 0 correspond exactly to zeros of 1 in 2 (Zilka, 7 Oct 2025).
3. Zeros on the standard arc and effective large-weight results
The zero geometry of the Miller basis is studied in the standard fundamental domain
3
whose circular boundary arc is
4
For a Miller cusp form 5, the finite zeros in 6 are the zeros away from the cusp 7. Since 8, the form has exactly 9 finite zeros in the fundamental domain, counted with multiplicity (Raveh, 2024).
For fixed 0, there exist constants 1 such that if
2
then every finite zero of 3 lies on the arc 4. Moreover, as 5, these zeros become uniformly distributed on 6 (Raveh, 2024). The same paper makes the bound explicit: 7 This yields an effective linear bound in 8 for the weight (Raveh, 2024).
A special case is markedly stronger. For every 9, equivalently for every even weight 0, all finite zeros of
1
lie on 2. Thus the first cusp form in the Miller basis exhibits the arc-zero phenomenon in every admissible weight, not merely asymptotically (Raveh, 2024).
The proof strategy follows the Rankin–Swinnerton-Dyer and Duke–Jenkins method. On the arc, the normalized function
3
is real-valued, and for 4 sufficiently large relative to 5 it satisfies
6
The sign changes of the cosine term then force at least 7 zeros on the arc, and since 8 is the total number of finite zeros, all finite zeros must lie there (Raveh, 2024).
This large-weight restoration of arc concentration coexists with explicit counterexamples when 9 is not fixed. Duke–Jenkins observed that for 0 the statement “all zeros on 1” fails in general, and 2 is given as a counterexample with zeros off the arc (Raveh, 2024).
4. Faber zeros, linear moments, and limiting distributions
A second line of work studies the zeros 3 of the Faber polynomial 4. For 5, the 6-th power sum and normalized moment are
7
The fundamental structural result is that these power sums are linear functions of the weight and the index. For each integer 8 there exist constants 9 and a function 00, depending only on 01, such that for all 02 with 03 and 04,
05
Moreover,
06
07 is the coefficient of 08 in the 09-expansion of 10, and
11
The same analysis yields a nonrecursive explicit formula for the coefficients of 12 via Newton’s identities (Zilka, 7 Oct 2025).
Because 13, positivity of even moments constrains whether all zeros can remain on the arc. Using 14, the paper proves explicit upper ranges in which at least one zero leaves the arc. If 15, then: 16 or
17
implies that at least one zero of 18 is not on 19. More asymptotically, if 20, 21, and 22 is large enough, then at least one zero is not on 23 (Zilka, 7 Oct 2025).
When 24 with 25, the limiting moments depend only on 26: 27 Under the hypothesis 28 and that all zeros lie on the arc, the limiting distribution of zeros along the arc is explicitly non-uniform. For
29
the limiting probability that a zero lies between 30 and 31 is
32
At 33, this reduces to the uniform distribution on 34; for 35, the density is shifted by the 36 term and therefore depends nontrivially on 37 (Zilka, 7 Oct 2025).
5. Logarithmic Szegő curves, phase transitions, and algebraic zeros
The parameter
38
organizes the large-weight variation of zeros across the Miller basis. In this regime the central geometric object is the logarithmic analogue of the Szegő curve
39
The paper defines
40
and then
41
with sign 42 determined by the sign of the weight. Equivalently, 43 is the curve of points 44 such that
45
As 46,
47
(Chiriac et al., 10 May 2026).
For the holomorphic Miller basis, the first main zero-counting result gives a lower bound for the proportion of non-elliptic zeros on the unit arc 48: 49 where 50. In particular, if 51 and 52 is sufficiently large, then all zeros lie on 53; if 54, then at least one non-elliptic zero lies on 55 (Chiriac et al., 10 May 2026).
In the opposite regime, when
56
for some fixed 57, the zeros asymptotically approach 58. This is the regime where 59 is asymptotically close to 60, and the Faber polynomials behave like truncated exponentials. The paper accordingly posits that for all 61, the zeros asymptotically approach the upper hull of the union of the unit arc and the logarithmic Szegő curve (Chiriac et al., 10 May 2026).
The same work formulates conjectural threshold values
62
with the conjectural picture that for 63 all zeros are on the unit arc, while for 64 no zeros remain on the arc. The proven thresholds 65 and 66 are described as numerically very close to these conjectural values (Chiriac et al., 10 May 2026).
Algebraic zeros form a separate arithmetic phenomenon. Up to 67, the classification result is that 68 has a non-elliptic algebraic zero if and only if 69, and the corresponding CM points are
70
with discriminants 71. For 72, the paper proves a weaker density statement: up to height 73, all but possibly 74 weights yield no non-elliptic algebraic zero in that range (Chiriac et al., 10 May 2026).
6. Terminological extensions and non-modular usage
Although the expression “Miller basis” is concrete in the modular-form setting, it is not fully standardized across the literature. In Rhoades’ paper on symmetric-group character embeddings, the phrase does not actually appear, but the paper’s content makes it natural to interpret a “Miller basis” as the family of embedded class functions
75
for fixed 76, or equivalently their images under the Frobenius characteristic map. Here 77 is obtained by multiplying each part of 78 by 79 and then repeating each part 80 times, and
81
Under the Frobenius characteristic, the relevant plethystic identity is
82
and Theorem 1 realizes 83 as the character of an explicitly described 84-module obtained by restricting an induction product of 85 copies of 86 (Rhoades, 2022).
This distinct usage is representation-theoretic rather than modular. It is connected to Miller’s embedding and congruence phenomena for symmetric-group characters, whereas the modular-form Miller basis is the canonical 87-expansion-adapted basis of 88. The two usages share the idea of a distinguished family indexed by combinatorial data, but they arise in different parts of mathematics and are not interchangeable (Rhoades, 2022).