Previous Page 6

Displaying 101 – 118 of 118

Showing per page

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

Hong-Quan Liu (1993)

Acta Arithmetica

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]....

On the number of subgroups of finite abelian groups

Aleksandar Ivić (1997)

Journal de théorie des nombres de Bordeaux

Let T ( x ) = K 1 x log 2 x + K 2 x log x + K 3 x + Δ ( x ) , where T ( x ) denotes the number of subgroups of all abelian groups whose order does not exceed x and whose rank does not exceed 2 , and Δ ( x ) is the error term. It is proved that 1 X Δ 2 ( x ) d x X 2 log 31 / 3 X , 1 X Δ 2 ( x ) d x = Ω ( X 2 log 4 X ) .

On the Olson and the Strong Davenport constants

Oscar Ordaz, Andreas Philipp, Irene Santos, Wolfgang A. Schmid (2011)

Journal de Théorie des Nombres de Bordeaux

A subset S of a finite abelian group, written additively, is called zero-sumfree if the sum of the elements of each non-empty subset of S is non-zero. We investigate the maximal cardinality of zero-sumfree sets, i.e., the (small) Olson constant. We determine the maximal cardinality of such sets for several new types of groups; in particular, p -groups with large rank relative to the exponent, including all groups with exponent at most five. These results are derived as consequences of more general...

On the structure of sequences with forbidden zero-sum subsequences

W. D. Gao, R. Thangadurai (2003)

Colloquium Mathematicae

We study the structure of longest sequences in d which have no zero-sum subsequence of length n (or less). We prove, among other results, that for n = 2 a and d arbitrary, or n = 3 a and d = 3, every sequence of c(n,d)(n-1) elements in d which has no zero-sum subsequence of length n consists of c(n,d) distinct elements each appearing n-1 times, where c ( 2 a , d ) = 2 d and c ( 3 a , 3 ) = 9 .

On the structure of the Galois group of the Abelian closure of a number field

Georges Gras (2014)

Journal de Théorie des Nombres de Bordeaux

From a paper by A. Angelakis and P. Stevenhagen on the determination of a family of imaginary quadratic fields K having isomorphic absolute Abelian Galois groups A K , we study any such issue for arbitrary number fields K . We show that this kind of property is probably not easily generalizable, apart from imaginary quadratic fields, because of some p -adic obstructions coming from the global units of K . By restriction to the p -Sylow subgroups of A K and assuming the Leopoldt conjecture we show that the...

Currently displaying 101 – 118 of 118

Previous Page 6