Abstract
This paper establishes power-saving bounds for Kloosterman sums associated with the long Weyl element for for arbitrary , as well as for another type of Weyl element of order 2. These bounds are obtained by establishing an explicit representation as exponential sums. As an application we go beyond Sarnak’s density conjecture for the principal congruence subgroup of prime level. We also obtain power-saving bounds for all Kloosterman sums on .
Mathematics Subject Classification: Primary 11L05
Introduction
Classical Kloosterman sums
Kloosterman sums belong the most universal exponential sums in number theory, algebra and automorphic forms. The classical Kloosterman sum for parameters and a modulus is
1.1 |
where (mod c) and the asterisk indicates that the sum is over . Kloosterman [10] introduced this type of exponential sum in his thesis as a crucial tool to study the representation of integers by positive quaternary quadratic forms. Since then they have been ubiquitous in number theory, for instance as the finite Fourier transform of exponential sums containing modular inverses, as Fourier coefficients of classical Poincaré series, in various instances of delta-symbol methods and perhaps most prominently in the relative trace formula of Petersson-Kuznetsov type (to which Poincaré series are a precursor). One of their key properties is the Weil bound [16] (complemented by Salié for powerful moduli [13])
1.2 |
where denotes the divisor function. This essentially exhibits square root cancellation relative to the trivial bound where is Euler’s -function.
We proceed to describe the more general set-up of Kloosterman sums. Let G be a reductive group, T the maximal torus, and U the standard maximal unipotent subgroup. Let be the normalizer of T in G, the Weyl group and the quotient map. For , we define and . For and a finite index subgroup we define
and the projection maps
Let be two characters on that are trivial on . The (local) Kloosterman sum is then defined to be
1.3 |
In this paper we will take , but we may think of as a more general “congruence subgroup”. Of course, by the Chinese remainder theorem it suffices to study local Kloosterman sums. There is some flexibility in the definition. For instance, some authors have on the left and U on the right.
Example 1
For , (so that with , say, , for the standard additive character on and we have
if and only if , , and we recover (1.1).
Example 2
For and in the big Bruhat cell an explicit form of the corresponding Kloosterman sum becomes already much more complicated. Using Plücker coordinates, Bump, Friedberg and Goldfeld [4, Section 4] derived for two general characters and of 3-by-3 upper triangular unipotent matrices the explicit formula for the global Kloosterman sum
where are chosen such that for .
We see from these examples that Kloosterman sums, while defined rather naturally in terms of the Bruhat decomposition, turn out to be extremely complicated exponential sums. We are well equipped with deep technology from algebraic geometry and p-adic analysis to bound general exponential sums in a relatively sharp fashion, but it is unfortunately not clear a priori how to apply these to general Kloosterman sums given by (1.3). In fact, even determining the size of X(n) and hence the “trivial” bound for (1.3) (ignoring cancellation in the characters) is a deep result of Dąbrowski and Reeder [6], see Lemma 2 below.
One case is classical: for and the Weyl element (“Voronoi element”) the Kloosterman sum (1.3) becomes a hyper-Kloosterman sum [8, Theorem B] in the sense of Deligne and hence its size is well-understood. In addition we have good bounds for Kloosterman sums on [4, 5, 15], [11] and for the long Weyl element on [9, Appendix]. In all other cases, the best we know is the “trivial” bound of Dąbrowski-Reeder [6]. A typical strategy, employed for instance in [3, 4, 9], is to use Plücker coordinates to understand the Bruhat decomposition of in an explicit fashion. Unfortunately, for large n the Plücker relations become extremely complicated, and it seems that this path is not very promising in general.
In this paper, we investigate Kloosterman sums for the general linear group for arbitrary . (The notation in place of n is slightly more convenient.) We parametrize the unipotent upper triangular matrices U of dimension as
We consider two characters of , defined by
1.4 |
for , . The Weyl group of G consists of permutation matrices, but only Weyl elements of the form
![]() |
with identity matrices of dimension lead to well-defined objects (see [8, p. 175]), which reduces the number of relevant Weyl elements to . We consider two of them, namely the long Weyl element
![]() |
and with a particular application in mind (to be described in Subsection 1.4)
The chosen representatives of the Weyl elements and here satisfy that the determinant of the -minors formed by the bottom k rows and appropriate columns have positive determinant. The actual choice of the representatives is unimportant to the theory, but this particular choice makes the computations in later sections more convenient.
We write a typical modulus as with which we embed into the torus T as . The first main achievement of this paper in an explicit and reasonably compact expression of the considered Kloosterman sums as exponential sums which we are going to describe in the following two subsections. We try to present this in a user-friendly way, which may ease further investigations.
Kloosterman sums for for the long Weyl element
Our stratification starts with the following decomposition. Let a modulus C be given as above with an exponent vector . Let
1.5 |
For we define
as well as the partial Kloosterman sum as
1.6 |
Here we employ the convention that and for . Moreover, for we set when , and of course a bar means the modular inverse. It is not obvious from the definition, but will follow from the proof, that this expression is well-defined (i.e. independent of the system of representatives chosen for the ).
As an example, the case (i.e. ) is spelled out explicitly in (8.1) in the appendix, where in addition all Weyl elements for are analyzed.
We are now ready to state our first main result.
Theorem 1
For we have with the above notation
where is defined in (1.6).
Remarks: The exact formula of Theorem 1 has a number of nice features.
First of all, we see the “trivial bound” of Dąbrowski-Reeder with bare eyes by simply counting the number of terms in the summation:
1.7 |
for as defined in (1.5). We are now in a position to exploit cancellation to obtain non-trivial bounds in Corollary 1 below.
It is also structurally quite interesting because it consists of nested Kloosterman sums. This is somewhat reminiscent of the archimedean case where the (non-degenerate) -Whittaker function can be expressed as nested integrals of Bessel K-functions (i.e. Whittaker functions), see [15].
The exact formula can also be used for certain exact evaluations (see below), it can be generalized to congruence subgroups, and can perhaps ultimately be a means for deeper methodological machinery in analytic number theory such as Poisson summation etc.
Corollary 1
With the notation as above, there exists a such that
Xinchen Miao kindly informed us that he obtained independently and by a slightly different method a similar bound in [12, Theorem 5.1].
In Subsection 5.3 we will give a quick argument that shows that one can choose . It is an interesting question whether can be chosen independently of n. In this particular situation we do not know the answer, but for general Weyl elements the answer is NO, as we will see in the next subsection.
Kloosterman sums for for
We now establish similar results for the Weyl element . For this Weyl element we have relatively severe restrictions on the moduli , see [8, Proposition 1.3]. For instance, if satisfy and , then the exponents need to form an arithmetic progression.
In the present situation we define
For we define
as well as the partial Kloosterman sum as
1.8 |
Again we employ the convention that and for . Moreover, for we set when . For the case , we refer to (8.2).
Theorem 2
For we have with the above notation
whenever the Kloosterman sum on the left hand side is well-defined.
Corollary 2
There exists a such that
Our proof will show that one can take . This should be seen in light of the following exact evaluation.
Corollary 3
For and characters with for we have .
This shows that Kloosterman sums can be fairly large. In particular, up to the constant the saving of size in Corollary 2 is asymptotically best possible. Corollary 3 is a variation of [2, Theorem 3], but proved by a completely different argument, since [2, Theorem 3] is special to the congruence subgroup . A similar, but more involved computation shows for instance
for and characters with for (generalizing [4, Property 4.10] for ).
An application
Kloosterman sums come up most prominently in the Kuznetsov formula. Up until now, in higher rank one could at best employ the trivial bound. With non-trivial bounds at hand, we can now refine the main result of [1].
The Ramanujan conjecture for the group states that cuspidal automorphic representations are tempered. This is way out of reach, but one may hope to prove that it holds in reasonable families in the following quantitative average sense: automorphic forms that are “far away” from being tempered should occur “rarely”. With this in mind, let be the finite family of cusp forms (eigenforms for the unramified Hecke algebra) for the principal congruence subgroup with bounded spectral parameter (see [1] for more details). For a place v of and define
where . The trivial bound is . On the other hand, we have . One might hope that a trace formula can interpolate linearly between these two bounds:
where should be thought of as a proxy for . This is a version of Sarnak’s density conjecture [14] and was proved in [1] for squarefree q. Of course, the trivial representation is not cuspidal, and so one may hope to do even better, but even for this is a very hard problem when the Selberg trace formula is employed. On the other hand, the Kuznetsov formula is better suited in this situation, since the residual spectrum is a priori excluded. We use this observation to go beyond Sarnak’s density conjecture in the scenario described above for prime moduli (the primality assumption is used before (7.1)).
Proposition 4
Let , . Let q be a large prime and let be the set of cuspidal automorphic forms for with archimedean spectral parameter . Fix a place v of . There exist constants depending only on n, such that
for .
The stratification of Dąbrowski and Reeder
Here we convert results in [6] to conform with our convention. Although nothing in this section is new, it might be convenient for the reader to compile some results.
Let G be a simply connected Chevalley group over with Lie algebra . Let W be the Weyl group of G, and let and denote the set of roots and the set of positive roots of respectively. We fix a set of simple roots of . For each positive root , there is a natural homomorphism . For we write
Through the canonical bijection between the set of roots and the set of coroots , we have
for . For , we write for . This induces a natural embedding
from the set of cocharacters of T into the maximal torus T. If for , we define the height of to be
2.1 |
For , we write
Then, if is a reduced expression of w as a product of simple reflections, then
2.2 |
For we set
In particular, if , say for , , then we have . This means the map preserves . For we define
2.3 |
where is some fixed representative of the simple reflection in . When no confusion can arise, we simply write for . We observe that for all . Indeed, we have
Let , let be a reduced representation of w as a product of simple reflections, and write . For , let denote the image of in . By [6, Proposition 2.1], the map is injective, and its image is contained in , where is the standard Borel subgroup of G.
We remark that the map really depends on the choice of the reduced representation of w. Moreover, also depends on the choice of the representative of . If we fix a representative of w in , then by convention we choose the representatives such that the toral part of the Bruhat decomposition of has positive entries.
For , we set
Let , and
The -coordinate function is defined by . Note that this does not depend on the order of the product. For and , we define
Then . For a sequence of simple roots, we can construct a right action , as follows:
Then is right -equivariant with respect to , that is, we have for and . It follows that induces a map
where denotes the set of -orbits with respect to the right action .
For any cocharacter , we define
where is defined in (2.2). Now we are able to state the main result in this section.
Lemma 1
([6, Proposition 3.3]) Let , , and let be a reduced representation of w as a product of simple reflections. Write . Then gives a bijection between and the Kloosterman set X(n).
The following proposition gives the trivial bound for Kloosterman sums.
Lemma 2
([6, Proposition 3.4]) Assume the settings above. For we have
where is the number of nonzero entries in and was defined in (2.1).
Proof of Theorem 1
We apply the results from Sect. 2 to our case. Let . A set of simple roots of G is given by , where in usual notation . Using this root basis, the set of positive roots of G is given by
Throughout this section, we use the following reduced representation of :
3.1 |
Recall the definition of in (2.2). For the reduced representation (3.1) of , we have
Now we give a characterisation for , for . Note that every can be written uniquely as with , , and .
Lemma 3
Let . Write , with , , and . Then has a Bruhat decomposition , where
![]() |
with
To interpret the formula above, we set and if the condition is not satisfied, and , . As a convention, when for , we define as a formal symbol.
Remarks: The hard part is to find these explicit formulae for the Bruhat decomposition. Once the formulae are given, the proof is a straightforward inductive verification by simply matching terms on both sides of the matrix equation. The indices for N look overly complicated, but are chosen in analogy with the ones in Lemma 5 below. Our application of Lemma 3 to the proof of Theorem 1 will only require the values of and on the first off-diagonal, i.e. for for which the formulae simplify substantially.
Proof
First we justify the definition as a formal symbol when . We recall the definition of for , . We write a as a product , with , , and . When , we have
3.2 |
Meanwhile, when we have
Hence (3.2) also works for if we treat as a formal symbol. As is a product of such matrices, our convention is justified.
Now we prove the actual formula by induction. For easier manipulation, we assume for all ; when some we use the convention to the result. When , the formula reads
which is precisely (2.3). For the general case, let
denote the reduced representation (3.1). By induction, we have a Bruhat decomposition
where the entries , , are given by the formulae above, with indices ij replaced with . By a slight abuse of notation, we shall denote the matrices above also by , , respectively. On the other hand, it is straightforward to compute that
So it remains to show that
3.3 |
is indeed a Bruhat decomposition of . This is a straightforward brute force computation. For convenience, we provide the details. We expand
As each row of N has exactly one nonzero entry, we can collapse the sum and write
3.4 |
By the same argument, we write
3.5 |
Since
it follows that for we have
where
It is then straightforward to verify that
and
if . Matching the terms with (3.4) yields for .
Now consider the case where , . From (3.5), we deduce that
It remains to show that for . By straightforward computation, we have
where , for , and . Putting this back into (3.4) yields as desired.
Now consider the case where , . Then (3.4) and (3.5) say
Since , and , it follows that .
Finally, for , we have
So (3.3) holds, finishing the proof.
Lemma 4
Assume the settings above. For , a complete system of coset representatives for is given by
Remark: The shape of the system is not completely obvious (to us), but once it is given, the verification is somewhat lengthly, but straightforward.
Proof
From Lemma 2 we already know the number of coset representatives needed. So it remains to show that all these coset representatives are inequivalent under right action by . Again we argue inductively. The case is straightforward to verify. Indeed, suppose we have
for some . This actually says
which implies , and as desired.
Now we consider the general case. For , we set
and
such that
3.6 |
Removing the final column and the final row of the matrices yields the problem for (with a renaming of variables ). By induction, we deduce that the first r rows and columns of R and are identical, and for all . Using Lemma 3, we deduce that for .
It remains to consider the final columns of the matrices. The -th entry of (3.6) reads
3.7 |
where again we set . From (3.7), we deduce that . It then follows that
3.8 |
Now we turn to the -th entry of (3.6). It reads
From Lemma 3, we see that there is exactly one term in and that depends on for some . Since for , we can remove all the other terms within and , and obtain
To show that , it suffices to prove that
Using (3.8), we rewrite
3.9 |
We expand
where
where
For , we write , with if , and otherwise. From (3.8), it is easy to check that
for . On the other hand, we verify that
for . So we conclude that
for . The claim then follows from (3.9).
By similar arguments, we proceed inductively and show that
for , and thus for . This finishes the proof of the statement.
Combining the previous computations, we complete the proof of Theorem 1, noting that , corresponds to the components of . From Lemma 4 we obtain the summation condition in (1.6) and from Lemma 3 the shape of the exponential for two characters as in (1.4).
Proof of Theorem 2
The proof of Theorem 2 is similar. We omit the analogous straightforward verification and just write down the relevant formulae. We fix a reduced representation of as follows
Recall the definition of in (2.2). For the reduced representation of , we have
Now we give a characterisation for , for . Again, every can be written uniquely as , with , , and .
Lemma 5
Let . Write , with , , and . Then has a Bruhat decomposition , where
where
To interpret the formula above, we set and if the condition is not satisfied. As a convention, when for , we define as a formal symbol.
Proof
Similar as the proof of Lemma 3.
Lemma 6
Assume the settings above. For , a complete system of coset representatives for is given by
Proof
Similar as the proof of Lemma 4.
Combining the above results, we complete the proof of Theorem 2.
Non-trivial bounds for Kloosterman sums
General preparation
In this section we prove Corollaries 1 and 2. We first prove Corollary 1. The idea is that the partial Kloosterman sum defined in (1.6) with
5.1 |
is a nested sum of classical Kloosterman sums, for which we have Weil’s bound (1.2) available. We start with a simple lemma.
Lemma 7
Let , with . Then
Proof
The sum on the left hand side equals
5.2 |
Suppose for notational simplicity that (the other case is completely analogous). Let us first assume that . Then the two inner sums are bounded by
where the second inequality can be seen by distinguishing the cases and .
Let us now assume . Then the inner two sums are at most
(For the -sum runs up to .) Thus in all cases we bound (5.2) by
and the lemma follows.
We return to the partial Kloosterman sum (1.6) for the long Weyl element. Let
5.3 |
be the modulus of the -sum, for any . For we put .
Let us fix one variable . Then the -sum in (1.6) is given by
5.4 |
where
with
5.5 |
Here we apply the following conventions, in this order: if for some , we put . If , we put and and . If none of the above cases apply, and or , we put and .
Let us assume
Let , . Assume without loss of generality , the other case is analogous. If , then trivially . If , we extend the range of summation to avoid issues of well-definedness, and obtain by Weil’s bound
We conclude in all cases (still assuming )
5.6 |
Note that this uses no specific information about A and B and holds for any sum of the type (5.4).
From this and the previous lemma we see that
if (in which case ). Note that this continues to hold for by our general conventions. If (in which case ), a similar, but simpler argument confirms the bound, too. Here we dropped potential savings in the exponents .
If we simply estimate trivially, and therefore obtain in all cases the bound
5.7 |
where
A soft argument
With a view towards possible generalizations we first demonstrate a soft argument. We define an ordering on the set of indices (i, j), as follows
5.8 |
Let
Then (5.7) implies
(which is trivially true if ) for any (i, j). Choosing the index pair (i, j) suitably, we conclude
for some (depending on n), from which we easily obtain the statement of Corollary 1, observing that the number of for a given vector r is for every .
A refined argument
The previous argument uses cancellation only in one index pair (ij). It is very flexible and requires only the ordering (5.8), but no further computations. On the other hand, it gives only a small value of (exponentially decreasing in n). A more refined argument runs as follows. We partition the index pairs into 4 classes depending on the parity of i and j and obtain
for . Recall that
cf. (5.3) and also (1.7). Taking geometric means, we get
We now observe that
and
Taken together, this implies
and so
The element
The proof of Corollary 2 is similar. We apply again a soft argument and use the ordering
Analyzing (1.8), we see that is of the shape (5.4) with
with the same conventions as explained after (5.5).
Arguing as before based on (5.6), we obtain
and conclude the proof as in Sect. 5.2 for some .
We can make this quantitative as in Sect. 5.3. We have
and by a small variation of Lemma 5.6, we also have
We put , for , and . We put the nodes (i, j) with or into the two classes with indices of the form , and with indices of the form , . Then
We now observe that
and so
An exact evaluation
Here we prove Corollary 3. For the vector , the relevant satisfying (5.1) are
, otherwise;
, otherwise, for some .
In the first case we obtain
The two innermost sums equal p, and so we obtain
In the second case we consider first the case . Then contains the sum
Finally, if , we obtain
The two inner sums equal 1, and so This completes the proof.
Beyond Sarnak’s density conjecture
We finally prove Proposition 4. This requires some minor modifications in Sections 4 and 5 of [1] that we now describe. We use the notation from [1]. Since q is prime, the argument simplifies a bit, and we need [1, Lemma 4.2] for and (1, 0). For we use it as is, for we make a small improvement. We recall that we need to count satisfying the size conditions [1, (4.15)] and the congruences [1, (4.17), (4.18)], where in the case the congruence (4.18) can be written more simply as (4.19). The count for (4.15) is given in (4.16). In order to count the saving imposed by the congruences (4.17), (4.19), we proceed as described after (4.18), but obtain an extra saving for from (4.19) of size . Thus we see that
for . (It is important to have exponent strictly less than 2.) Together with the improved bound of Corollary 2, we now obtain the following variation of [1, Theorem 4.3] under the additional assumptions that , q is prime and satisfies (which implies that only the cases and (1, 0) are relevant in the proof):
7.1 |
with as in our Corollary 2. We can and will assume without loss of generality that .
With this in hand, we move to the discussion after [1, Lemma 5.1]. The key point is that we can now slightly relax [1, (5.3)] to
for some sufficiently small to be chosen in a moment (cf. also [1, (1.4)]). If and , then by Remark 2 after [1, Lemma 4.1] we can still conclude that only the trivial Weyl element and give a non-zero contribution. The contribution of the trivial Weyl element is given in [1, (5.4)], for the contribution of the we invoke (7.1) getting
if . In this way we obtain an improved version of [1, Proposition 5.2] where (under the current assumptions q prime, ) we only need the relaxed condition . This can be directly inserted into [1, Corollary 6.11] and completes the proof of Proposition 4.
Appendix: the case
It might be useful for applications to use the method of proof of Theorem 1 and Corollary 1 to obtain explicit formulae and non-trivial bounds for all Weyl elements in the case . See [9, Appendix] for a list of the relevant consistency relations, and [7] for a version in terms of Plücker coordinates.
There are 8 Weyl elements. We do not need to talk about the trivial Weyl element and the Voronoi element , which is covered in [8] (with non-trivial bounds following from Deligne’s estimates). The element is analogous.
(a) For the long Weyl element we obtain by (1.6) that is given by
8.1 |
where the sum runs over
subject to .
(b) For the Weyl element we obtain by (1.8) that is given by
8.2 |
where the sum runs over
subject to . These two cases are illustrative examples for the general results presented in the body of the paper; Corollaries 1 and 2 establish non-trivial bounds.
(c) We are left with three remaining Weyl elements. We first consider . Here we choose the representative , so that
We then obtain for by similar computations the formula
where indicates the usual coprimality condition .
Here we obtain a saving relative to the trivial bound as follows: the -sum and the -sum save and respectively. If , an analogous argument works for the indices (12), (23), and if (which is the only situation in which we can have ), then the -sum implies
Thus in all cases we get a saving of
so that one can choose in Corollary 2 below. This is just for concreteness—it is easy to improve the numerical value.
(d) Finally we treat the Weyl element , the Weyl element being analogous. Here we choose a representative , so that
We then obtain for the formula
Arguing as in Sect. 5 with the ordering
we obtain a saving of
so that we can choose in the following corollary. Again it is very easy to improve this numerical value. We conclude
Corollary 5
Let w be a non-trivial Weyl element for and . Then there exists an absolute constant such that
Funding
Open Access funding enabled and organized by Projekt DEAL.
Availability of data and material
Not applicable.
Declarations
Conflict of interest
The authors declare that there is no conflict of interest.
Footnotes
V. Blomer was supported in part by the DFG-SNF Lead Agency Program grant BL 915/2-2, Germany’s Excellence Strategy grant EXC-2047/1 - 390685813 and ERC Advanced Grant 101054336. S. H. Man was supported by the European Research Council grant 101001179 and the Czech Science Foundation GAČR grant 21-00420M.
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Assing, E., Blomer, V.: The density conjecture for principal congruence subgroups. Duke Math. J., to appear
-
2.Blomer, V.: Density theorems for
. Invent. Math. 232, 783–811 (2023) [Google Scholar]
-
3.Broughan, K.: An algorithm for the explicit evaluation of
Kloosterman sums. ACM Commun. Comput. Algebra 43, 1–10 (2009) [Google Scholar]
-
4.Bump, D., Friedberg, S., Goldfeld, D.: Poincaré series and Kloosterman sums for
. Acta Arith 50, 31–89 (1988) [Google Scholar]
-
5.Dąbrowski, R., Fisher, B.: A stationary phase formula for exponential sums over
and applications to
-Kloosterman sums. Acta Arith 80, 1–48 (1997) [Google Scholar]
- 6.Dąbrowski, R., Reeder, M.: Kloosterman sets in reductive groups. J. Number Theory 73, 228–255 (1998) [Google Scholar]
-
7.Friedberg, S.:Explicit determination of
Kloosterman sums, Séminaire de théorie des nombres, 1985-1986 (Talence), Exp. No. 3, 22 pp
-
8.Friedberg, S.: Poincaré series for
: Fourier expansion, Kloosterman sums, and algebreo-geometric estimates. Math. Z. 196, 165–188 (1987) [Google Scholar]
-
9.Goldfeld, D., Stade, E., Woodbury, M.: An orthogonality relation for
(with an appendix by Bingrong Huang). Forum Math. Sigma 9, Paper No. e47, 83 pp (2021)
-
10.Kloosterman, H.D.: On the representation of numbers in the form
. Acta Math. 49, 407–464 (1927) [Google Scholar]
- 11.Man, S.H.: Symplectic Kloosterman sums and Poincaré series. Ramanujan J. 57, 707–753 (2022) [Google Scholar]
- 12.Miao, X.: Bessel functions and Kloosterman integrals on GL(n). arXiv:2208.01016
-
13.Salié, H.: Über die Kloostermanschen Summen
. Math. Z. 34, 91–109 (1931) [Google Scholar]
- 14.Sarnak, P.: Diophantine Problems and Linear Groups. Proceedings of the ICM Kyoto, pp. 459–471 (1990)
-
15.Stevens, G.: Poincaré series on
and Kloostermann sums. Math. Ann. 277, 25–51 (1987) [Google Scholar]
- 16.Weil, A.: On some exponential sums. Proc. Natl. Acad. Sci. USA 34, 204–207 (1948) [DOI] [PMC free article] [PubMed] [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
Not applicable.