Counting bounded elements of a number field
Miko{\l}aj Fr\k{a}czyk, Gergely Harcos, P\'eter Maga

TL;DR
This paper provides estimates for the number and independence of elements in a number field with bounded valuations, and derives new bounds for ideal lattice minima using advanced mathematical techniques.
Contribution
It introduces novel bounds for elements and lattice minima in number fields by combining group theory, ramification, and geometry of numbers.
Findings
New bounds for the count of elements with valuation constraints
Bounds on the maximal number of linearly independent elements
Improved estimates for successive minima of ideal lattices
Abstract
We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices. Our arguments combine group theory, ramification theory, and the geometry of numbers.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Counting bounded elements of a number field
Mikołaj Fraczyk
,
Gergely Harcos
and
Péter Maga
Alfréd Rényi Institute of Mathematics, Hungarian Academy of Sciences, POB 127, Budapest H-1364, Hungary
[email protected], [email protected], [email protected]
MTA Rényi Intézet Lendület Groups and Graphs Research Group
MTA Rényi Intézet Lendület Automorphic Research Group
[email protected], [email protected]
Institute for Advanced Study, Princeton NJ, USA
Central European University, Nador u. 9, Budapest H-1051, Hungary
Abstract.
We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices. Our arguments combine group theory, ramification theory, and the geometry of numbers.
Key words and phrases:
integral bases, number fields, lattices, geometry of numbers
2010 Mathematics Subject Classification:
Primary 11H06, 11R04; Secondary 11R29, 11S15
First author supported by ERC grant CoG-648017 and the MTA Rényi Intézet Lendület Groups and Graphs Research Group. Second and third author supported by NKFIH (National Research, Development and Innovation Office) grant K 119528 and by the MTA Rényi Intézet Lendület Automorphic Research Group. Third author also supported by the Premium Postdoctoral Fellowship of the Hungarian Academy of Sciences.
1. Introduction
It was a decisive moment in the history of mathematics when Minkowski [12] realized that certain geometric ideas are very powerful in tackling difficult arithmetic problems. In particular, Minkowski [12] proved that in a number field of degree and discriminant , every ideal class can be represented by an integral ideal of norm less than . His proof relied on two ideas. First, the natural embedding allows one to regard the ring of integers as a lattice in of covolume . Second, a lattice in contains a nonzero lattice point in a convex body symmetric about the origin111that is, a convex subset of invariant under multiplication by , as long as the volume of the body exceeds times the covolume of the lattice. The second idea was extended by Blichfeldt [2] and van der Corput [4] to exhibit more lattice points in larger convex bodies. It leads to the following estimate that we state partly for motivation, partly as a technical ingredient for our investigations. For a modern exposition of the quoted results, see [6, Ch. 2, §5.1 & §7.2].
Theorem 1** (Minkowski [12], Blichfeldt [2], van der Corput [4]).**
Let be a nonzero ideal, and let be a convex body symmetric about the origin. Then
[TABLE]
Blichfeldt [2] also established an upper bound of similar quality in the case when contains linearly independent vectors.
Theorem 2** (Blichfeldt [2]).**
Let be a nonzero ideal, and let be a convex body symmetric about the origin. Assume that contains linearly independent vectors. Then
[TABLE]
In fact Blichfeldt proved a more general result, namely Theorem 7 in Section 3. The original source [2] is an account of an AMS Sectional Meeting held in 1920 (written by B. A. Bernstein), so it does not contain any proof. What is worse, we could only find sketches of the proof in the literature. Hence we include a detailed proof in Section 3, without claiming any originality.
Our principal goal in this paper is to provide an upper bound for in the complementary case when does not contain linearly independent vectors. More precisely, with certain arithmetic applications in mind, we restrict ourselves to the special convex bodies considered by Minkowski [12] in his seminal work. They are the archimedean analogues of ideal lattices, and they are defined as follows. As before, let be a number field of degree . Let , and let be the compositum of the fields for . Then is a finite Galois extension whose Galois group acts transitively and faithfully on . In this way, is a transitive permutation group of degree . Fixing an embedding , we can think of the elements of as the embeddings , and we can identify with the set of column vectors satisfying for all . See [13, Ch. I, §5] for more details. Let be a collection of positive numbers such that for all . We shall focus on convex bodies of the form
[TABLE]
and we note for later reference that
[TABLE]
Here and later, the symbols , , have their usual meaning in analytic number theory: (resp. ) means that holds for an absolute constant depending only on , while abbreviates .
Theorem 3**.**
Let be a nonzero ideal, and let be a convex body of the form (1). Let be the maximal number of linearly independent lattice vectors contained in . If , then
[TABLE]
Further, if and is -homogeneous222that is, acts transitively on the -element subsets of , then
[TABLE]
Theorems 2 and 3 yield a practical estimate for the number of elements of which are bounded in every archimedean and non-archimedean valuation of .
Corollary 1**.**
Let be a nonzero ideal, and let be a convex body of the form (1). Then
[TABLE]
By combining Theorems 1 and 3, we see that if the volume of our convex body is sufficiently large compared to the covolume of our ideal lattice, then the intersection contains several linearly independent lattice vectors.
Corollary 2**.**
Let be a nonzero ideal, and let be a convex body of the form (1). Let be the maximal number of linearly independent lattice vectors contained in . If , then
[TABLE]
Further, if and is -homogeneous, then
[TABLE]
If , then (3) and (4) are trivial, while (6) and (7) boil down to the Minkowski bound . If or , then (3) and (4) (resp. (6) and (7)) are identical. For , the bound (4) is stronger than (3) (resp. (7) is stronger than (6)), but its scope is restricted by the assumption that is -homogeneous. The list of finite -homogeneous groups is known by the work of many people, in particular by the classification of finite simple groups. For further details and references, see [8, Prop. 3.1], [3, Th. 5.3], [7, p. 198].
Corollary 3**.**
Let be a nonzero ideal, and let be a convex body of the form (1). If does not contain a lattice basis of , then .
Interestingly, when is totally real, the conclusion of Corollary 3 also follows from a celebrated result of McMullen [11, Th. 4.1] proved by topological arguments. In another direction, when the radii are equal, the conclusion of Corollary 3 says that the last successive minimum333we understand successive minima with respect to the closed Euclidean unit ball centered at the origin of is . For , this bound was deduced earlier by Bhargava et al. [1, Th. 1.6] with a more direct approach. We will return to these connections in Section 4. In fact we can control, to some extent, all successive minima of ideal lattices.
Theorem 4**.**
Let be the successive minima of a nonzero ideal embedded as a lattice in . Then for all we have
[TABLE]
If is -homogeneous, then the exponents of in (8) and (9) can be improved to and , respectively.
The example mentioned by Bhargava et al. below their [1, Th. 1.6] shows that the -homogeneous case of Theorem 4 cannot be improved in general. Indeed, if are prime numbers and , then is sharply -transitive, while holds for all . The last relation follows from the straightforward upper bound combined with and Minkowski’s result (12) quoted below. The same example also shows that Corollary 3 cannot be improved in general. In contrast, the sharpness of (3)–(4) and (8)–(9) is less clear to us.
Theorem 4 readily yields two-sided bounds for individual successive minima, extending the result of Bhargava et al. [1, Th. 1.6] mentioned in the previous paragraph.
Corollary 4**.**
Let be the successive minima of a nonzero ideal embedded as a lattice in . Then for all we have
[TABLE]
To form an idea of the accuracy of (11), it is instructive to observe that the two sides differ by a factor of . Moreover, the product of the left hand side over equals , while the same for the right hand side equals . This should be compared with the product of the ’s, which by Minkowski’s theorem [6, p. 124, Th. 3] is
[TABLE]
The proof of Theorem 3 combines group theory, ramification theory, and the geometry of numbers. The main idea is to obtain an upper bound for by projecting onto well-chosen “coordinate subspaces” of for , and then compare it with the lower bound of Theorem 1. We make sure that the projections of generate lattices in their ambient spaces , and then we succeed by bounding from below the product of covolumes of those lattices. The proof of Theorem 4 is similar, but it focuses on successive minima in place of lattice point counts. In order to formulate the key arithmetic ingredient of both proofs, Theorem 5 below, we need to introduce further notation.
For a nonzero prime ideal dividing a rational prime , let (resp. ) denote the ramification index (resp. inertia degree) of the local field extension . By [13, Ch. III, §2], the exponent of in the different ideal of equals when , and it lies between and when (which can only occur for ). Therefore, the tame discriminant , defined as
[TABLE]
divides the discriminant , and it satisfies
[TABLE]
The last bound is rather crude, and it can be verified as follows. The ratio divides the norm of the ideal , which is a divisor of the principal ideal . Therefore,
[TABLE]
Theorem 5**.**
Let be a nonzero ideal, and let . For any -subsets and ,
[TABLE]
If is -homogeneous, then the exponent of can be improved to .
Note that divides , and also divides when is -homogeneous, so the exponents of and are nonnegative integers. The next theorem is very similar to the -homogeneous case of Theorem 5. We do not need it for the proof of Theorem 3, but we present it for its intrinsic beauty and interest.
Theorem 6**.**
Let be a nonzero ideal, and let . For any -subset ,
[TABLE]
The determinants in (15) and (16) are only defined up to a factor of , because we have not specified any ordering on and . However, their squares are well-defined. If , then Theorems 5 and 6 follow from the fact that either is zero, or it equals the covolume of a full rank sublattice of . Another relatively simple special case is when and for some . Then, Theorem 6 and the -homogeneous case of Theorem 5 are consequences of the Vandermonde determinant formula and the definition of the (usual) discriminant of . Not surprisingly, we shall only use the divisibility conclusion when the participating determinants are nonzero. On the other hand, it seems to be an interesting and difficult problem to characterize the vanishing of these determinants. One result in this direction is Chebotarev’s theorem from 1926: if is a prime, is the -th cyclotomic field, and the elements of are -th roots of unity, then none of these determinants vanish (see [16] for a proof and for useful references). Another result is the following simple observation: if contains a proper subfield with , and the -subset is linearly dependent over , then there is an -subset such that all embeddings coincide on , whence . Motivated by this example, we ask the following question:
Question**.**
Assume that and satisfy and . Does there exist a subfield of such that is linearly dependent over , and all embeddings coincide on ?
If is of size and is -homogeneous (e.g. when or ), then the answer to this question is affirmative. Indeed, in this case, the vanishing of one minor of implies the vanishing of all minors, which can happen if and only if is linearly dependent over .
Acknowledgements**.**
We are grateful to the referees for their careful reading and valuable comments. We also thank Péter Pál Pálfy and Gergely Zábrádi for helpful discussions.
2. Non-archimedean investigations
In this section, we prove Theorems 5 and 6. The two sides of (15) and (16) are rational integers, hence it suffices to show, for every rational prime , that the exponent of is at least as large on the left hand side as on the right hand side (with the convention that the -exponent of zero is infinity).
We fix and an embedding , then we can think of the elements of as the embeddings . For each , there is a unique prime ideal and a unique -linear extension of . Denoting by the set of ’s corresponding to a given , the extension map is a bijection with inverse being the restriction map. In particular, is a -orbit on of cardinality . Let be the unique additive valuation on extending the normalized additive valuation on , and let be the normalized additive valuation on . By “normalized” we mean that and . Then we have the important identity
[TABLE]
See [13, Ch. II, §8] for more details. Let be the maximal unramified subextension of , then
[TABLE]
Identifying with as above, we can break up into subsets of equal size according to how gets embedded into . In the end, two elements of belong to the same subset if and only if they induce the same non-archimedean valuation on and their -linear extensions agree on ; we shall call two such elements of inertially equivalent.
The proofs of Theorems 5 and 6 rely on the key observation that the -adic valuation of the participating determinants can be estimated in terms of the inertial equivalence classes .
Proposition 1**.**
Let be a nonzero ideal, and let . For any -subsets and ,
[TABLE]
where abbreviates , and stands for the exponent of in .
Proof.
We recall that is the compositum of the fields for , and we write for the extension of generated by . We denote by the degree , and by the ring of integers of . We shall think of as the set of column vectors of length with entries in .
The -set is partitioned into the -sets . Accordingly, the matrix decomposes into the blocks . Strictly speaking, these matrices are only defined up to a permutation of the rows and the columns, but this ambiguity disappears once we choose an ordering of the rows and the columns.
We shall assume that , for otherwise (18) is trivial. The natural isomorphism from to maps into , hence it induces a surjective homomorphism from onto . In particular,
[TABLE]
The left hand side equals , hence (18) will follow if we can show that
[TABLE]
Let us fix and . We shall assume that is not empty, for otherwise (19) is trivial. We write
[TABLE]
to simplify notation, and we list the elements of as . By (17), we have
[TABLE]
We also list the elements of as in such a way that
[TABLE]
In particular, is constant on each column of
[TABLE]
and it is non-decreasing from left to right. As the ’s are inertially equivalent, their -linear extensions coincide on , and we can identify with its image in via any of these embeddings. A nice feature resulting from this identification is that the ’s are -linear, not just -linear.
We are ready to prove (19). We shall use the fact that the left hand side of (19), which is in our new notation (20), remains unchanged if we multiply by elements of on the right and by elements of on the left. Writing (resp. ) for the ring of integers of (resp. ), we shall also utilize the fact that the group of units contains a full set of representatives for the nonzero residue classes modulo in . This is because the residue fields of and have equal cardinality .
First, we perform invertible elementary column operations over in order to increase the additive valuations of the columns of . Specifically, we run the following algorithm:
Set . 2. 2.
For each , if , then choose such that and replace by . 3. 3.
Reorder in such a way that is non-decreasing on the new sequence. 4. 4.
Replace by . 5. 5.
If , then go to the second step; otherwise, finish.
We end up with a matrix
[TABLE]
with such that
[TABLE]
In particular, for all .
Second, we perform invertible elementary row operations over to transform into
[TABLE]
with such that (cf. (21))
[TABLE]
In particular, is a subgroup of , where
[TABLE]
This implies, using that divides the ramification degree of the local field extension ,
[TABLE]
The inequalities (22) and (19) are equivalent, because their left hand sides are equal, and their right hand sides are also equal (cf. (20)). The proof of Proposition 1 is complete. ∎
Proof of Theorem 5.
For any , it follows from Proposition 1 that
[TABLE]
We average both sides over , utilizing that acts transitively and faithfully on . For any , we obtain readily that
[TABLE]
As a consequence, for any distinct , we see that
[TABLE]
This bound is trivial when , in which case we shall only use that the left hand side is nonnegative. Combining these inequalities and noting that , we infer that
[TABLE]
Now from it is clear that
[TABLE]
while (13) implies that
[TABLE]
Therefore, the last inequality can be rewritten as
[TABLE]
The rational prime was arbitrary here, so we have proved (15).
If is -homogeneous, then we can improve (24) to
[TABLE]
As a result, we can replace by in the subsequent argument, and hence also in (15). The proof of Theorem 5 is complete. ∎
Proof of Theorem 6.
For any -subset , it follows from Proposition 1 that
[TABLE]
We sum both sides over all -subsets , using that
[TABLE]
From here we proceed as in the proof of Theorem 5, and conclude
[TABLE]
The rational prime was arbitrary here, so the proof of Theorem 6 is complete. ∎
3. Archimedean investigations
In this section, we prove Theorems 3–4 and Corollaries 1–4. We shall combine Theorems 1 and 5 with the following lesser known result of Blichfeldt [2], of which Theorem 2 is a special case.
Theorem 7** (Blichfeldt [2]).**
Let be a lattice, and let be a convex body containing the origin. If contains linearly independent lattice vectors, then
[TABLE]
Proof.
The second inequality is clear by , hence we focus on the first inequality. In this proof, a polytope (resp. simplex) will always mean a convex lattice polytope (resp. simplex) with vertices lying in . For other terminology, we follow the book [5]. Without loss of generality, is bounded. Then, by the initial assumptions on , the convex hull of is an -dimensional polytope, which can be decomposed into -simplices according to [5, Prop. 2.2.4]. The corresponding triangulation of can be refined to a full triangulation by decomposing recursively the participating -simplices into smaller -simplices. Alternatively, one can obtain a full triangulation of by ordering its elements in such a way that no point belongs to the convex hull of previous points, and then taking the placing/pushing triangulation for that ordering. We fix a full triangulation of , and we denote by the set of -simplices that participate in it. We define a graph on by declaring that two elements of are connected by an edge if and only if their intersection is an -simplex. One can show that this graph is connected, which forces
[TABLE]
For details, see [5, Th. 2.6.1], [14, Th. 3.2], and their proofs. On the other hand, as is convex and each element of has volume at least , we also have
[TABLE]
Combining these two bounds, we get the first inequality of (25). As remarked earlier, the second inequality of (25) is straightforward, so the proof of Theorem 7 is complete. ∎
Proof of Theorem 3.
If , then (3) and (4) are trivial, so we shall assume that . We write for the -span of , so that is an -dimensional -subspace of , and is an -dimensional lattice in . We fix a basis of , and we think of its elements as the columns of the complex matrix . Strictly speaking, is only defined up to a permutation of the rows and the columns, but this ambiguity disappears once we choose an ordering of and . By construction, the columns of are linearly independent over , and we claim that they are also linearly independent over . Indeed, if satisfies for all , then complex conjugating the equations and switching from to , we get that for all . As a result, the real and imaginary parts of must vanish for all , which proves the claim. Hence , and there exists an -subset such that . We fix along with .
For any Galois automorphism , the image of under equals . Therefore, these minors of are nonzero, and by (14) and Theorem 5 they satisfy
[TABLE]
Moreover, the exponent of can be improved to when is -homogeneous.
Fixing for a moment, the multilinearity of the determinant shows that there is a choice of for each such that
[TABLE]
The left hand side is positive, hence the right hand side is also positive. Let be the product of the -linear surjections given by
[TABLE]
Tautologically, holds for all , hence restricts to an -linear isomorphism , and is a lattice in of covolume . In addition, is an -symmetric convex body in , which lies in the orthotope by (1). Clearly, contains , which in turn contains linearly independent lattice vectors. Now we combine these observations with Theorem 7 and (27) to infer that
[TABLE]
We keep the two sides of the last inequality, and take their geometric mean over . Using also (2), (23), (26), we obtain
[TABLE]
Finally, we invoke Theorem 1 to estimate from above the right hand side in terms of the left hand side:
[TABLE]
This bound is equivalent to (3) in the light of . If is -homogeneous, then the exponent of can be improved to in (28), and to in (29), so that the resulting bound is equivalent to (4). The proof of Theorem 3 is complete. ∎
Proof of Corollary 1.
If contains linearly independent vectors, then (5) follows from Theorem 2. If does not contain linearly independent vectors, then (5) follows from Theorem 3. The proof of Corollary 1 is complete. ∎
Proof of Corollary 2.
In the light of Theorem 1, the bound (6) follows from (3), while the bound (7) follows from (4). The proof of Corollary 2 is complete. ∎
Proof of Corollary 3.
Assume that does not contain a lattice basis of . Then, by an observation of Mahler [10] (see also [6, Ch. 2, §10.2]), the scaled body does not contain linearly independent lattice vectors from . Hence, by Corollary 2, it follows that
[TABLE]
The proof of Corollary 3 is complete. ∎
Proof of Theorem 4.
We borrow several ideas from the proof of Theorem 3 without further mention. Let be linearly independent lattice vectors whose Euclidean norms in are the successive minima , respectively. Let be the -set , and let be the -span of . Then is an -dimensional -subspace of , and is an -dimensional lattice in of successive minima . In particular, the covolume of is . We fix an -subset such that . For any , there exists an orthogonal projection of onto an -subspace such that the covolume of is at least . Since the covolume of cannot exceed the covolume of , we infer that
[TABLE]
Taking the geometric mean of both sides over , and using (26), we obtain (8). Taking the reciprocal of (8), and then multiplying both sides by (12), we arrive at (9). If is -homogeneous, then the exponent of in (26) can be improved to , and our argument yields the following variants of (8) and (9):
[TABLE]
The proof of Theorem 4 is complete. ∎
Proof of Corollary 4.
We observe that (8) and (30) are also valid for , while (9) and (31) are also valid for . Indeed, these special cases amount to (12). Now, taking the -th root of (8) and (30) readily yields the lower bound of (10) and (11). Similarly, taking the -th root of (9) and (31) readily yields the upper bound of (10) and (11) with in place of . The proof of Corollary 4 is complete. ∎
4. Connections to the work of McMullen [11] and Bhargava et al. [1]
If the number field is totally real, then we can identify the -algebra with the set of column vectors . The multiplicative group acts on by multiplication, hence so does its subgroup
[TABLE]
Let us consider the induced action of on the space of lattices of . Geometrically, the space of lattices can be described as , and the induced action of is given by left multiplication by positive diagonal matrices of determinant . In particular, this action is continuous and preserves the covolume. The group of totally positive units is cocompact in (cf. Dirichlet’s unit theorem) and stabilizes the lattice , hence the orbit is compact. By a striking result of McMullen [11, Th. 4.1], the compactness of implies the existence of such that the successive minima of the lattice are equal: . As we shall explain in the next paragraph, this fact gives rise to a short alternative proof of Corollary 3 (when is totally real). We note in passing that Levin, Shapira, Weiss [9, Th. 1.1] have extended McMullen’s theorem to closed orbits of lattices; these orbits arise from direct sums of totally real number fields and their full rank additive subgroups [15, Prop. 5.7].
Let be the common value of , and let be the closed Euclidean unit ball in centered at the origin. Then contains linearly independent vectors. Let be a nonzero ideal, and let be an orthotope of the form . We claim that if does not contain a lattice basis of , then
[TABLE]
This is sufficient for the conclusion of Corollary 3, since . Let us assume that (32) is false. Then , hence Theorem 1 guarantees the existence of a nonzero lattice point . By our initial remarks, contains linearly independent vectors, so by and it follows that also contains linearly independent vectors. Finally, by the earlier quoted observation of Mahler [10] (see also [6, Ch. 2, §10.2]), we conclude that contains a lattice basis of .
Corollary 3 can also be connected to the work of Bhargava et al. [1] in multiple ways. Let be an arbitrary number field, and let be the successive minima of embedded as a lattice in . Then [1, Th. 1.6] states that
[TABLE]
We claim that (33) follows from Corollary 3, while a weaker version of Corollary 3 follows from (33). To justify the first claim, we set for all in (1). Clearly, contains no lattice basis of , hence by Corollary 3, which is equivalent to (33) by (2). To justify the second claim, we start from (33). Let be a nonzero ideal, and let be a convex body of the form (1) not containing a lattice basis of . As contains linearly independent vectors, we can proceed as in the previous paragraph but with (resp. ) replaced by (resp. ). We deduce the following variant of (33):
[TABLE]
That is, (33) alone implies a version of Corollary 3 in which is replaced by .
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] M. Bhargava, A. Shankar, T. Taniguchi, F. Thorne, J. Tsimerman, Y. Zhao, Bounds on 2 2 2 -torsion in class groups of number fields and integral points on elliptic curves , ar Xiv:1701.02458 , J. Amer. Math. Soc., to appear
- 2[2] H. F. Blichfeldt, Notes on geometry of numbers , In: The October meeting of the San Francisco Section , Bull. Amer. Math. Soc. 27 (1921), 149–153.
- 3[3] P. J. Cameron, Finite permutation groups and finite simple groups , Bull. London Math. Soc. 13 (1981), 1–22.
- 4[4] J. G. van der Corput, Verallgemeinerung einer Mordellschen Beweismethode in der Geometrie der Zahlen , Acta Arith. 1 (1935), 62–66.; Zweite Mitteilung , ibid. 2 (1936), 145–146.
- 5[5] J. A. De Loera, J. Rambau, F. Santos, Triangulations: Structures for algorithms and applications , Algorithms and Computation in Mathematics, Vol. 25, Springer-Verlag, Berlin, 2010.
- 6[6] P. M. Gruber, C. G. Lekkerkerker, Geometry of numbers , 2nd edition, North-Holland Mathematical Library, Vol. 37, North-Holland Publishing Co., Amsterdam, 1987.
- 7[7] M. Huber, The classification of flag-transitive Steiner 3-designs , Adv. Geom. 5 (2005), 195–221.
- 8[8] W. M. Kantor, Automorphism groups of designs , Math. Z. 109 (1969), 246–252.
