On the number of abelian groups of a given order (supplement)

Hong-Quan Liu

Acta Arithmetica (1993)

  • Volume: 64, Issue: 3, page 285-296
  • ISSN: 0065-1036

Abstract

top
1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, A ( x ) = C x + C x 1 / 2 + C x 1 / 3 + O ( x 50 / 199 + ε ) , where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented in [2]. The new tool here is an improved version of a result about enumerating certain lattice points due to E. Fouvry and H. Iwaniec (Proposition 2 of [1], which was listed as Lemma 6 in [2]).

How to cite

top

Hong-Quan Liu. "On the number of abelian groups of a given order (supplement)." Acta Arithmetica 64.3 (1993): 285-296. <http://eudml.org/doc/206551>.

@article{Hong1993,
abstract = {1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, $A(x) = C₁x + C₂x^\{1/2\} + C₃x^\{1/3\} + O(x^\{50/199+ε\})$, where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented in [2]. The new tool here is an improved version of a result about enumerating certain lattice points due to E. Fouvry and H. Iwaniec (Proposition 2 of [1], which was listed as Lemma 6 in [2]).},
author = {Hong-Quan Liu},
journal = {Acta Arithmetica},
keywords = {asymptotic results; number of non-isomorphic abelian groups},
language = {eng},
number = {3},
pages = {285-296},
title = {On the number of abelian groups of a given order (supplement)},
url = {http://eudml.org/doc/206551},
volume = {64},
year = {1993},
}

TY - JOUR
AU - Hong-Quan Liu
TI - On the number of abelian groups of a given order (supplement)
JO - Acta Arithmetica
PY - 1993
VL - 64
IS - 3
SP - 285
EP - 296
AB - 1. Introduction. The aim of this paper is to supply a still better result for the problem considered in [2]. Let A(x) denote the number of distinct abelian groups (up to isomorphism) of orders not exceeding x. We shall prove Theorem 1. For any ε > 0, $A(x) = C₁x + C₂x^{1/2} + C₃x^{1/3} + O(x^{50/199+ε})$, where C₁, C₂ and C₃ are constants given on page 261 of [2]. Note that 50/199=0.25125..., thus improving our previous exponent 40/159=0.25157... obtained in [2]. To prove Theorem 1, we shall proceed along the line of approach presented in [2]. The new tool here is an improved version of a result about enumerating certain lattice points due to E. Fouvry and H. Iwaniec (Proposition 2 of [1], which was listed as Lemma 6 in [2]).
LA - eng
KW - asymptotic results; number of non-isomorphic abelian groups
UR - http://eudml.org/doc/206551
ER -

Citations in EuDML Documents

top
  1. Xiaodong Cao, Wenguang Zhai, On the distribution of p α modulo one
  2. Xiaodong Cao, Wenguang Zhai, Multiple exponential sums with monomials
  3. Hong-Quan Liu, The number of cube-full numbers in an interval
  4. Hong-Quan Liu, The distribution of 4-full numbers
  5. Hong-Quan Liu, Divisor problems of 4 and 3 dimensions
  6. Hong-Quan Liu, On some divisor problems
  7. Wenguang Zhai, Xiaodong Cao, On the average number of unitary factors of finite abelian groups
  8. Hong-Quan Liu, On a fundamental result in van der Corput's method of estimating exponential sums

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.