Factoring Finite Abelian Groups by Subsets with Maximal Span (original) (raw)

Factoring abelian groups into uniquely complemented subsets

Journal of Group Theory, 2000

The paper deals with decomposition of a finite abelian group into a direct product of subsets. A family of subsets, the so-called uniquely complemented subsets, is singled out. It will be shown that if a finite abelian group is a direct product of uniquely complemented subsets, then at least one of the factors must be a subgroup. This generalizes Hajó s's factorization theorem.

Factoring an Infinite Abelian Group by Subsets

2000

By a theorem of L. Rédei if a finite abelian group is a direct product of its subsets such that each subset has a prime number of elements and contains the identity element of the group, then at least one of the factors must be a subgroup. The content of this paper is that this result holds for certain infinite abelian groups, too. Namely, for groups that are direct products of finitely many Prüferian groups and finite cyclic groups of prime power order, belonging to pairwise distinct primes.

Complete decompositions of finite abelian groups

Applicable Algebra in Engineering, Communication and Computing, 2018

Let G be a nontrivial abelian group and let A 1 ,. .. , A h (h ≥ 2) be nonempty subsets of G. We say that A 1 ,. .. , A h is a complete decomposition of G of order h if A 1 + • • •+ A h = G and A i ∩ A j = ∅ for i, j = 1,. .. , h (i = j). In this paper we consider the case G is the cyclic group Z n and determine the values of h for which a complete decomposition of Z n of order h exists. The result is then extended to the case G is a finite abelian group. We also investigate the existence of complete decompositions of Z n where the cardinality of each set in the decomposition is a prescribed integer ≥ 2. As an application, we describe a way to construct codes over a binary alphabet using a construction of a complete decomposition of cyclic groups.

A type of factorization of finite Abelian groups

Discrete Mathematics, 1985

A clique is a subgraph in a graph that is complete in the sense that each two of its nodes are connected by an edge. Finding cliques in a given graph is an important procedure in discrete mathematical modeling. The paper will show how concepts such as splitting partitions, quasi coloring, node and edge dominance are related to clique search problems. In particular we will discuss the connection with parallel clique search algorithms. These concepts also suggest practical guide lines to inspect a given graph before starting a large scale search.

On factorizations of finite groups

2021

Let G be a finite group and let {A1, . . . , Ak} be a collection of subsets of G such that G = A1 . . . Ak is the product of all the Ai and card(G) = card(A1) . . . card(Ak). We shall write G = A1 · . . . · Ak, and call this a kfold factorization of the form (card(A1), . . . , card(Ak)). We prove that for any integer k ≥ 3 there exist a finite group G of order n and a factorization of n = a1 . . . ak into k factors other than one such that G has no k-fold factorization of the form (a1, . . . , ak).

Factoring Abelian Groups, Cliques in Graphs and Covering Sets

Algebra Colloquium, 2011

The paper deals with the following problem: If a finite abelian 2-group is a direct product of its subsets of cardinality 4, does it follow that at least one of the factors is periodic? Two results are presented. In the first one, the structures of the group and the subsets are restricted but the size of the the group is not. In the second one, the group and the factors are general but the order of the group is 2 6 .