Displaying 381 – 400 of 701

Showing per page

On the asymptotic behavior of some counting functions

Maciej Radziejewski, Wolfgang A. Schmid (2005)

Colloquium Mathematicae

The investigation of certain counting functions of elements with given factorization properties in the ring of integers of an algebraic number field gives rise to combinatorial problems in the class group. In this paper a constant arising from the investigation of the number of algebraic integers with factorizations of at most k different lengths is investigated. It is shown that this constant is positive if k is greater than 1 and that it is also positive if k equals 1 and the class group satisfies...

On the asymptotic behavior of some counting functions, II

Wolfgang A. Schmid (2005)

Colloquium Mathematicae

The investigation of the counting function of the set of integral elements, in an algebraic number field, with factorizations of at most k different lengths gives rise to a combinatorial constant depending only on the class group of the number field and the integer k. In this paper the value of these constants, in case the class group is an elementary p-group, is estimated, and determined under additional conditions. In particular, it is proved that for elementary 2-groups these constants are equivalent...

On the Davenport constant and group algebras

Daniel Smertnig (2010)

Colloquium Mathematicae

For a finite abelian group G and a splitting field K of G, let (G,K) denote the largest integer l ∈ ℕ for which there is a sequence S = g · . . . · g l over G such that ( X g - a ) · . . . · ( X g l - a l ) 0 K [ G ] for all a , . . . , a l K × . If (G) denotes the Davenport constant of G, then there is the straightforward inequality (G) - 1 ≤ (G,K). Equality holds for a variety of groups, and a conjecture of W. Gao et al. states that equality holds for all groups. We offer further groups for which equality holds, but we also give the first examples of groups G for which (G) -...

On the heights of power digraphs modulo n

Uzma Ahmad, Husnine Syed (2012)

Czechoslovak Mathematical Journal

A power digraph, denoted by G ( n , k ) , is a directed graph with n = { 0 , 1 , , n - 1 } as the set of vertices and E = { ( a , b ) : a k b ( mod n ) } as the edge set. In this paper we extend the work done by Lawrence Somer and Michal Křížek: On a connection of number theory with graph theory, Czech. Math. J. 54 (2004), 465–485, and Lawrence Somer and Michal Křížek: Structure of digraphs associated with quadratic congruences with composite moduli, Discrete Math. 306 (2006), 2174–2185. The heights of the vertices and the components of G ( n , k ) for n 1 and k 2 are determined....

On the Heyde theorem for discrete Abelian groups

G. M. Feldman (2006)

Studia Mathematica

Let X be a countable discrete Abelian group, Aut(X) the set of automorphisms of X, and I(X) the set of idempotent distributions on X. Assume that α₁, α₂, β₁, β₂ ∈ Aut(X) satisfy β α - 1 ± β α - 1 A u t ( X ) . Let ξ₁, ξ₂ be independent random variables with values in X and distributions μ₁, μ₂. We prove that the symmetry of the conditional distribution of L₂ = β₁ξ₁ + β₂ξ₂ given L₁ = α₁ξ₁ + α₂ξ₂ implies that μ₁, μ₂ ∈ I(X) if and only if the group X contains no elements of order two. This theorem can be considered as an analogue...

On the index of length four minimal zero-sum sequences

Caixia Shen, Li-meng Xia, Yuanlin Li (2014)

Colloquium Mathematicae

Let G be a finite cyclic group. Every sequence S over G can be written in the form S = ( n g ) · . . . · ( n l g ) where g ∈ G and n , . . . , n l i [ 1 , o r d ( g ) ] , and the index ind(S) is defined to be the minimum of ( n + + n l ) / o r d ( g ) over all possible g ∈ G such that ⟨g⟩ = G. A conjecture says that every minimal zero-sum sequence of length 4 over a finite cyclic group G with gcd(|G|,6) = 1 has index 1. This conjecture was confirmed recently for the case when |G| is a product of at most two prime powers. However, the general case is still open. In this paper, we make some...

On the lattice of pronormal subgroups of dicyclic, alternating and symmetric groups

Shrawani Mitkari, Vilas Kharat (2024)

Mathematica Bohemica

In this paper, the structures of collection of pronormal subgroups of dicyclic, symmetric and alternating groups G are studied in respect of formation of lattices L ( G ) and sublattices of L ( G ) . It is proved that the collections of all pronormal subgroups of A n and S n do not form sublattices of respective L ( A n ) and L ( S n ) , whereas the collection of all pronormal subgroups LPrN ( Dic n ) of a dicyclic group is a sublattice of L ( Dic n ) . Furthermore, it is shown that L ( Dic n ) and LPrN ( Dic n ) are lower semimodular lattices.

On the nontrivial solvability of systems of homogeneous linear equations over in ZFC

Jan Šaroch (2020)

Commentationes Mathematicae Universitatis Carolinae

Motivated by the paper by H. Herrlich, E. Tachtsis (2017) we investigate in ZFC the following compactness question: for which uncountable cardinals κ , an arbitrary nonempty system S of homogeneous -linear equations is nontrivially solvable in provided that each of its subsystems of cardinality less than κ is nontrivially solvable in ?

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

Currently displaying 381 – 400 of 701