betaFeedback

WorksMathematics

On Block-Primitive Combinatorial Designs

Abstract

We settle a long-standing problem by proving that every block-primitive combinatorial design is point-primitive. Since block-primitivity and point-primitivity coincide for symmetric designs by duality, it remains to treat the non-symmetric 22-designs. For these we apply the O'Nan–Scott theorems for primitive and for quasiprimitive permutation groups and prove that the automorphism group of every such design is almost simple on points and on blocks. Together with the classification of finite simple groups, this classifies all non-symmetric block-primitive 22-designs except for two families of block stabilizers in even characteristic. The exceptions are as follows. One family is of subfield type, PSL2(q0)PSL_2(q_0) with q=q0dq=q_0^{d}, d≥2d\geq2, of order below the dihedral point stabilizer D2(q±1)D_{2(q\pm1)}, and includes S3≅PSL2(2)S_3\cong PSL_2(2) and A5≅PSL2(4)A_5\cong PSL_2(4). The other is the dihedral block stabilizer D2(q−1)D_{2(q-1)}, where the block is a union of aa of the q/2q/2 orbits, so that v=q(q−1)/2v=q(q-1)/2, k=a(q−1)k=a(q-1) and λ=2a(aq−a−1)/(q−2)λ=2a(aq-a-1)/(q-2), the last an integer exactly when (q−2)/2(q-2)/2 divides a(a−1)a(a-1); this family is exhausted by finite enumeration except at the degrees beyond its range. We then determine which of these designs have strength t≥3t\geq 3. Apart from the inversive planes and the five Witt designs, exactly two Steiner families arise, attached to the exceptional maximal subgroups of PGL2(q)PGL_2(q). There is no non-complete design of strength t≥6t\geq 6.

Email address: [email protected] (Zhilin Zhang)

Contents

Part I: Introduction 4

1 Introduction 5

Part II: Structural reduction 11

2 The O’Nan–Scott reduction 12

3 Point-imprimitive actions are excluded 35

3.1 Key parameter constraints 35

3.2 Classical groups: point-imprimitive candidates are excluded 36

3.3 General result for point-imprimitive case 36

Part III: The almost simple classification 52

4 Almost simple type (AS) 53

4.1 Key ordering principle for non-symmetric designs 55

4.2 Classification for PSL2(q)PSL_2(q) 56

4.3 Even characteristic 68

4.4 Classical groups (Lie type) 98

4.5 Scope: non-2-homogeneous point actions 98

4.6 The Aschbacher classes 99

4.7 PSLn(q)PSL_n(q) (n≥3n \ge3) 100

4.8 PSp2n(q)PSp_{2n}(q) 101

4.9 PSUn(q)PSU_n(q) 102

4.10 PΩnϵ(q)P\Omega_n^{\epsilon}(q) 102

4.11 Summary of the classical group classification 103

4.12 Point-imprimitive case for classical groups: exclusion 103

4.13 Classification of AS type for classical groups 105

4.14 Exceptional Lie type groups 106

4.15 Sporadic simple groups 108

4.16 Examples 109

Part I: Introduction

Introduction

A combinatorial design D=(P,B)\mathcal{D} = (\mathcal{P}, \mathcal{B}) is a pair consisting of a finite set P\mathcal{P} of points and a collection B\mathcal{B} of subsets of P\mathcal{P}, called blocks. It has strength tt, for an integer t≥2t \ge2, if every tt-subset of P\mathcal{P} is contained in exactly λ\lambda blocks; it is then a tt-(v,k,λ)(v,k,\lambda) design, where v=∣P∣v = |\mathcal{P}| and k=∣B∣k = |B| for B∈BB \in\mathcal{B}, and a 2-design is the case t=2t = 2. The automorphism group Aut⁡(D)\operatorname{Aut}(\mathcal{D}) consists of all permutations of P\mathcal{P} that map blocks to blocks, and D\mathcal{D} is block-primitive when this group acts primitively on B\mathcal{B}.

The study of designs with automorphism groups that act transitively or primitively on points or blocks has a long history. A fundamental result of Delandtsheer and Doyen [20] states that if a block-transitive automorphism group GG is imprimitive on points, then v≤(k2)v \le\binom{k}{2}. This result has been used extensively in the classification of block-transitive point-imprimitive designs.

The O’Nan–Scott theorem classifies finite primitive permutation groups into five types: affine (HA), almost simple (AS), diagonal (SD and CD), product action (PA) and twisted wreath (TW), the diagonal type subsuming the simple and compound diagonal cases (Dixon and Mortimer [24]). The quasiprimitive version of Liebeck, Praeger and Saxl [31] refines the list to eight types: affine (HA), almost simple (AS), holomorph simple (HS), holomorph compound (HC), simple diagonal (SD), compound diagonal (CD), twisted wreath (TW) and product action (PA). In the diagonal case we separate the two-sided from the one-sided simple diagonal action, a distinction the design-theoretic applications require. Table 2 records the eight types, the structure of the socle, the form of the point and block actions, and the place in this paper where each type is settled.

TypeStructure of Soc⁡(G)\operatorname{Soc}(G)Point action on P\mathcal{P}Block action on B\mathcal{B}Mechanism and location
HAelementary abelian TT; Soc⁡(G)=T\operatorname{Soc}(G)=T is regular on P\mathcal{P}, v=pℓv=p^{\ell}quasiprimitive of affine typeprimitive by hypothesisthe socle is a regular normal subgroup, which forces b=vb=v and hence symmetry (Lemma 2.11, Lemma 2.10)
ASnon-abelian simple TT; T≤G≤Aut⁡(T)T\leq G\leq\operatorname{Aut}(T)primitive, not 2-homogeneousprimitive; MM maximalclassified completely: quadruples (T,G,M,H)(T,G,M,H) with ordering ∣H∣>∣M∣|H|>|M|; Aschbacher subdivision for the classical families; CFSG (Proposition 4.1, Theorem 5.1)
HST2T^{2}, TT non-abelian simplequasiprimitive; Soc⁡(G)\operatorname{Soc}(G) transitive on P\mathcal{P}primitivethe point and block stabilizers would be non-conjugate diagonal subgroups, contradicting ∣H∣>∣M∣|H|>|M| (§ 2.1)
HCT2mT^{2m}, TT non-abelian simple, m≥1m\geq1quasiprimitive, compound holomorph typeprimitivecentralizer obstruction inside the compound holomorph (§ 2.1)
SDTℓT^{\ell}, TT non-abelian simple, ℓ≥2\ell\geq2quasiprimitive of diagonal typeprimitiveSD2 excluded; the one-sided type excluded for every ℓ≥2\ell\geq2 and every non-abelian simple TT (Lemmas 7.1, 7.3 and 7.5)
CDTmℓT^{m\ell}, TT non-abelian simplequasiprimitive of compound diagonal typeprimitiveminimal model n=6n=6: parameter sieve over the six small simple groups (§ 2.1)
TWTℓT^{\ell}, TT non-abelian simplequasiprimitive; Soc⁡(G)\operatorname{Soc}(G) regular on P\mathcal{P}primitive; regular, normal subgroupthe regular normal subgroup forces b=vb=v, hence symmetry (Lemma 2.10)
PATℓT^{\ell}, TT non-abelian simple, ℓ≥2\ell\geq2quasiprimitive of product action typequasiprimitive; B\mathcal{B} itself of product action typethree-class structural analysis (Proposition 7.9) plus the five-layer sieve (Proposition 7.11), complete for the six socles with the seventeen listed primitive degrees, every ℓ≥2\ell\geq2, and arbitrary block stabilizers (cf. Proposition 3.4 and the degree tables of Dixon–Mortimer [24])

Table 2. O’Nan–Scott types for quasiprimitive permutation groups. For each type we record the structure of the socle, the form of the point action on P=G/H\mathcal{P}=G/H and of the block action on B=G/M\mathcal{B}=G/M, and the mechanism and location of the exclusion or classification.

Quasiprimitivity does not imply primitivity. Groups of affine, holomorph simple and holomorph compound type are primitive (Praeger [35]; see also Theorem 3.3 of Chen, Hua, Li and Wu [15]), whereas the other five types admit quasiprimitive actions that are not primitive; for the almost simple type, PSL2(7)PSL_2(7) acting on the 28 points PSL2(7)/S3PSL_2(7)/S_3 is an example, the stabilizer S3S_3 being self-normalizing but not maximal. Point-imprimitive actions therefore have to be excluded separately, which is done in § 2.4 (Proposition 3.4) and, family by family, in § 3.1.

Huber [27, 28] classified flag-transitive Steiner tt-designs, and Zieschang [43] studied flag-transitive automorphism groups of 2-designs with (r,λ)=1(r,\lambda) = 1. For symmetric designs, block-primitivity coincides with point-primitivity by duality and the flag-transitive case is well understood: Buekenhout, Delandtsheer and Doyen [9] treated linear spaces (λ=1\lambda= 1), O’Reilly-Regueiro [36, 37] the cases λ=2,3\lambda= 2, 3 and λ=4\lambda= 4, Alavi, Bayat, Daneshkhah and Montinaro [2] prime λ\lambda, and O’Reilly-Regueiro and Rodríguez-Fitta [38] the product action. Braić, Golemac, Mandić and Vučićíć [7, 8] classified the primitive symmetric designs with at most 255 and with up to 2500 points, their automorphism groups being affine or almost simple. The symmetric case is not treated here.

For block-transitive designs, Camina and Gagen [13] showed that k∣vk \mid v forces flag-transitivity, and Camina and Siemons [14] studied the 22-(v,k,1)(v, k, 1) case. Chen, Hua, Li and Wu [15] proved that the action of an automorphism group of a non-trivial 22-design on its blocks is faithful, and the known block-transitive 22-(v,5,λ)(v, 5, \lambda) result gives the HA/AS/PA alternative [30]. For point-imprimitive block-transitive designs, Cameron and Praeger [12] give v≤(k−2)2v \le(k - 2)^2 in the non-trivial case, which Mann and Tuan [33] sharpened for t=3t = 3.

Theorem 1.1 (Block-primitivity implies point-primitivity). Let DD be a non-trivial 22-(v,k,λ)(v, k, \lambda) design with 2<k<v−12 < k < v - 1. If Aut⁡(D)\operatorname{Aut}(D) acts primitively on the blocks of DD, then it acts primitively on the points.

The proof runs in two parts. For a symmetric design block-primitivity and point-primitivity coincide by duality, so nothing is left to prove. For a non-symmetric 22-design the point action is primitive by Theorem 1.3(2). A design of strength t≥3t \ge3 is either complete or non-complete. A complete design has block set the full set of kk-subsets, hence Aut⁡(D)=Sym⁡(v)\operatorname{Aut}(D) = \operatorname{Sym}(v), and Sym⁡(v)\operatorname{Sym}(v) acts 22-transitively on the points; the conclusion therefore holds whether or not the block action is primitive. The non-complete designs of strength t≥3t \ge3 are among those classified in Theorem 1.4, and the same conclusion applies.

Remark 1.2. The hypothesis that DD is a non-trivial 22-design cannot be dropped. On the four points 1, 2, 3, 4 with the two blocks {1,2}\{1, 2\} and {3,4}\{3, 4\} the automorphism group is Sym⁡(2)≀Sym⁡(2)\operatorname{Sym}(2) \wr\operatorname{Sym}(2) of order 8: it is transitive on the two blocks, but it preserves the non-trivial partition {{1,2},{3,4}}\{\{1, 2\}, \{3, 4\}\} of the point set, so block-primitivity does not force point-primitivity for general combinatorial designs.

We begin with the non-symmetric 22-designs. The product action is excluded for every ℓ≥2\ell\ge2 and arbitrary block stabilizers, the point action being primitive (Proposition 3.4); a reduction over the admissible primitive degrees, using the degree tables of Dixon–Mortimer [24], leaves the six socles A5A_5, A6A_6, PSL2(7)PSL_2(7), PSL2(8)PSL_2(8), PSL2(11)PSL_2(11) and PSL2(13)PSL_2(13) with seventeen primitive degrees, and the sieve of Proposition 7.11 excludes them, the 2-homogeneous pairs being removed by a transitivity argument. The SD, CD and TW types are excluded in Section 2.

Theorem 1.3 (Complete classification). Let D=(P,B)\mathcal{D}=(\mathcal{P},\mathcal{B}) be a non-trivial, non-symmetric 2-design with 2<k<v−12<k<v-1, and let G≤Aut⁡(D)G\leq\operatorname{Aut}(\mathcal{D}) act primitively on B\mathcal{B}. Denote by GPG^{\mathcal{P}} and GBG^{\mathcal{B}} the actions of GG on the point set P\mathcal{P} and the block set B\mathcal{B}, respectively. Then:

(1) GPG^{\mathcal{P}} acts quasiprimitively on P\mathcal{P} (Lemma 2.1).

(2) GPG^{\mathcal{P}} cannot act imprimitively on P\mathcal{P} (Proposition 3.4): by the quasiprimitive O’Nan–Scott classification, an imprimitive quasiprimitive action is of almost simple, twisted wreath, simple diagonal, compound diagonal or product action type (the affine, holomorph simple and holomorph compound types are always primitive), and each of these types is excluded (TW, SD and CD in Section 2; PA by Proposition 7.11 and Lemma 3.11; AS in Section 4). Consequently no non-trivial non-symmetric block-primitive 2-design admits a point-imprimitive automorphism group.

(3) Hence GPG^{\mathcal{P}} acts primitively on P\mathcal{P}, and by the O’Nan–Scott theorem both GPG^{\mathcal{P}} and GBG^{\mathcal{B}} are of almost simple type (Table 2, Theorem 5.1).

(4) The point-primitive almost simple case is then classified completely across all families of finite simple groups; the classification is summarized in Table 1 and stated in full in Proposition 4.1.

Socle familyExistence resultsExcluded actionsLocation
Classical Lie typerank-3 polar space designs (unitals) and C8C_8 cross-type embeddings, for PSL⁡n(q)\operatorname{PSL}_n(q), PSp⁡2n(q)\operatorname{PSp}_{2n}(q), PSU⁡n(q)\operatorname{PSU}_n(q), P⁡Ωn±(q)\operatorname{P}\Omega_n^\pm(q); for PSL⁡2(q)\operatorname{PSL}_2(q) designs occur at q=8q=8 and q=32q=32 within the range covered by Theorem 4.6, the even-characteristic subfield block stabilizers being delimited thereall other Aschbacher classes (C2C_2, C3C_3, C4C_4, C5C_5, C6C_6, C7C_7, SS)Proposition 4.1 (1); § 3.1
SporadicJ2J_2: 22-(100,56,560)(100,56,560), b=1800b=1800, r=1008r=1008; HSHS: 22-(100,64,1680)(100,64,1680), b=4125b=4125, r=2640r=2640 (non-2-homogeneous rank-3 actions); Co3(276)Co_3(276), HS(176)HS(176): 2-homogeneous, designs by the orbit construction (Lemma 4.2)all remaining sporadic actions, in particular M12(66)M_{12}(66), M22(176)M_{22}(176), M23(253)M_{23}(253), M24(276)M_{24}(276), McL(275)McL(275), He(2058)He(2058), Ru(4060)Ru(4060), Suz(1782)Suz(1782), Co2(2300)Co_2(2300), by exhaustive maximal-subgroup orbit enumerationProposition 4.1 (2); § 3.1
Exceptional Lie typegeneralized building designs from rank-3 building actions, Suzuki ovoid designs, Ree unital designsall non-parabolic subgroup chainsProposition 4.1 (3); § 3.1

Table 1. Summary of the classification of point-primitive non-symmetric block-primitive 2-designs (Proposition 4.1). The existence results are listed together with the design families and the acting groups; all remaining cases are excluded.

Point-primitive designs with classical, sporadic or exceptional socle are classified in Section 4: the reduction lists the candidate quadruples (T,G,M,H)(T,G,M,H) and the design conditions they have to satisfy, and the outcome for each family is stated in Proposition 4.1.

Among the designs classified in Theorem 1.3, those of strength t≥3t\geq3 are classified as follows; the full statement, with block counts and automorphism groups, is Theorem 6.3 of Section 6.

Theorem 1.4 (Block-primitive designs of strength t≥3t\geq3). Let D\mathcal{D} be a non-trivial non-complete block-primitive design of strength t≥3t\geq3. Then D\mathcal{D} is one of the following:

  1. the inversive planes 33-(q2+1,q+1,1)\left(q^2+1,q+1,1\right), q≥3q \ge3 a prime power;

  1. the Steiner systems 33-(q+1,4,1)\left(q+1,4,1\right) for q≡±1(mod8)q \equiv\pm1 \pmod{8} and q≡1,3(mod6)q \equiv1,3 \pmod{6}, and 33-(q+1,6,1)\left(q+1,6,1\right) for q≡1(mod20)q \equiv1 \pmod{20}, attached to the exceptional maximal subgroups S4\mathrm{S}_4 and S5\mathrm{S}_5 of PGL2(q)\mathrm{PGL}_2(q);

References

  1. [1]S. H. Alavi, C. Amarra, A. Daneshkhah, A. Devillers and C. E. Praeger, Higher-dimensional grid-imprimitive block-transitive designs, preprint, arXiv:2404.11241 (2024).arxiv.org/abs/2404.11241
  2. [2]S. H. Alavi, M. Bayat, A. Daneshkhah and A. Montinaro, Affine groups as flag-transitive and point-primitive automorphism groups of symmetric designs, arXiv:2409.04790 (2024).arxiv.org/abs/2409.04790
  3. [3]R. Baddeley, C. E. Praeger and C. Schneider, Quasiprimitive groups and blow-up decompositions, J. Algebra 311 (2007) 337–351.DOI
  4. [4]N. Balachandran and D. Ray-Chaudhuri, Simple 3-designs and PSL(2, q) with q ≡ 1 (mod 4), Des. Codes Cryptogr., 44(2007): 263-274.DOI
  5. [5]T. Beth, D. Jungnickel and H. Lenz, Design Theory, Cambridge University Press, Cambridge, 1999.DOI
  6. [6]R. E. Block, On the orbits of collineation groups of finite linear spaces, Math. Z., 96(1967): 33-49.
  7. [7]S. Braić, A. Golemac, J. Mandić and T. Vučić, Primitive symmetric designs with at most 255 points, Glas. Mat. 45(65) (2010) 291–305.DOI
  8. [8]S. Braić, A. Golemac, J. Mandić and T. Vučić, Primitive symmetric designs with up to 2500 points, J. Combin. Des. 19 (2011) 463–474.DOI
  9. [9]F. Buekenhout, A. Delandtsheer and J. Doyen, Finite linear spaces with flag-transitive groups, J. Combin. Theory Ser. A, 49(1988): 268-293.DOI
  10. [10]P. J. Cameron, H. R. Maimani, G. R. Omidi and B. Tayfeh-Rezaie, 3-Designs from PSL(2, q), Discrete Math., 306 (2006): 3063-3073.DOI
  11. [11]P. J. Cameron, G. R. Omidi and B. Tayfeh-Rezaie, 3-Designs from PGL(2, q), Electron. J. Combin., 13(2006): 1R50.DOI
  12. [12]P. J. Cameron and C. E. Praeger, Block-transitive t-designs I: point-imprimitive designs, Bull. London Math. Soc. 25 (1993) 515–524.DOI
  13. [13]A. R. Camina and T. M. Gagen, Block transitive automorphism groups of designs, J. Algebra, 86(1984): 549-554.DOI
  14. [14]A. R. Camina and J. Siemons, Block transitive automorphism groups of 2−(v, k, 1) block designs, J. Combin. Theory Ser. A, 51(1989): 268-276.DOI
  15. [15]J. Chen, P. Hua, C. H. Li and Y. Wu, Locally primitive block designs, J. London Math. Soc. (2), 112(2025): e70221.arxiv.org/abs/2403.16822
  16. [16]J. Chen, Y. Wu and B. Xia, Locally dihedral block designs and primitive groups with dihedral point stabilizers, preprint, arXiv:2601.08678 (2026).arxiv.org/abs/2601.08678
  17. [17]J. H. Conway, R. T. Curtis, S. P. Norton, R. A. Parker and R. A. Wilson, Atlas of Finite Groups, Oxford University Press, Oxford, 1985.
  18. [18]M. J. Coster and W. H. Haemers, Quasi-symmetric designs related to the triangular graph, Des. Codes Cryptogr., 5(1995): 27–42.
  19. [19]D. Crnkovic, Construction of Menon designs with parameters (784, 378, 182) and (900, 435, 210), Appl. Math. E-Notes, 7(2007): 124-130.
  20. [20]A. Delandtsheer and J. Doyen, Most block-transitive t-designs are point-primitive, Geom. Dedicata, 29(1989): 307-310.DOI
  21. [21]P. Dembowski, Finite Geometries, Springer-Verlag, Berlin, 1968.
  22. [22]L. E. Dickson, Linear Groups: With an Exposition of the Galois Field Theory, Teubner, Leipzig, 1901.
  23. [23]H. Dietrich, M. Lee and T. Popiel, The maximal subgroups of the Monster, Adv. Math., 469(2025): 102214.DOI
  24. [24]J. D. Dixon and B. Mortimer, Permutation Groups, Springer-Verlag, New York, 1996.
  25. [25]H. Hanani, On quadruple systems, Canad. J. Math., 12(1960): 145-157.DOI
  26. [26]H. Hanes, K. Olson and W. R. Scott, Products of simple groups, J. Algebra, 36(1975): 167-184, doi:10.1016/0021-8693(75)90096-4.DOI
  27. [27]M. Huber, Classification of flag-transitive Steiner quadruple systems, J. Combin. Theory, Series A, 94(2001): 180-190.
  28. [28]M. Huber, Almost simple groups with socle L_n(q) acting on Steiner quadruple systems, J. Combin. Theory, Series A, 117(2010): 1004-1007.DOI
  29. [29]Z. Janko, A new finite simple group with abelian Sylow 2-subgroups and its characterization, J. Algebra, 3(1966): 147-186.DOI
  30. [30]C. Lei and X. Zhan, Block-transitive automorphism groups of 2-(v, 5, λ) designs, arXiv:2505.17547 (2025).arxiv.org/abs/2505.17547
  31. [31]M. W. Liebeck, C. E. Praeger and J. Saxl, On the O’Nan–Scott theorem for finite primitive permutation groups, J. Austral. Math. Soc. Ser. A, 44(1988): 352-375.DOI
  32. [32]M. W. Liebeck and J. Saxl, Minimal degrees of primitive permutation groups, with an application to monodromy groups of covers of Riemann surfaces, Proc. London Math. Soc. (3), 63(1991): 266-314.DOI
  33. [33]A. Mann and N. D. Tuan, On a result of Cameron and Praeger on block-transitive point-imprimitive t-designs, Geom. Dedicata 88 (2001) 81–90.
  34. [34]A. Montinaro, Y. Zhao, Z. Zhang and S. Zhou, Designs with a simple automorphism group, Finite Fields Appl. 99 (2024) 102488.DOI
  35. [35]C. E. Praeger, An O’Nan–Scott theorem for finite quasiprimitive permutation groups and an application to 2-closures, J. London Math. Soc. (2), 47(1993): 227-239.DOI
  36. [36]E. O’Reilly-Regueiro, On primitivity and reduction for flag-transitive symmetric designs, J. Combin. Theory Ser. A, 109(2005): 135-148.
  37. [37]E. O’Reilly-Regueiro, Reduction for primitive, flag-transitive (v,k,4)-symmetric designs, Des. Codes Cryptogr., 56(2010): 61-63.
  38. [38]E. O’Reilly-Regueiro and J. E. Rodríguez-Fitta, A parametrisation for symmetric designs admitting a flag-transitive, point-primitive automorphism group with a product action, Ars Math. Contemp., 23(2023): #P2.04, doi:10.26493/1855-3974.2507.a1d.
  39. [39]S. Saeidi, On point and block primitive designs invariant under permutation groups, arXiv:2409.09730 (2024).arxiv.org/abs/2409.09730
  40. [40]A. Weil, On some exponential sums, Proc. Nat. Acad. Sci. U.S.A., 34(1948): 204-207.
  41. [41]R. A. Wilson, The Finite Simple Groups, Graduate Texts in Mathematics, 251, Springer-Verlag, London, 2009.DOI
  42. [42]Z. Zhang, J. Chen and S. Zhou, On symmetric designs with flag-transitive and point-quasiprimitive automorphism groups, J. Combin. Des. (2023), DOI 10.1002/jcd.21924.DOI
  43. [43]P.-H. Zieschang, Flag-transitive automorphism groups of 2-designs with (r, λ) = 1, J. Combin. Math. Combin. Comput., 10(1991): 173-186.
  44. [44]K. Zsigmondy, Zur Theorie der Potenzreste, Monatsh. für Math. u. Phys., 3(1892): 265-284.DOI

Paper details

vlnc:W_s76r8dr6
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

GPT-6 Astra

View statement
Looking for related papers…
Contents