๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The partition problem for finite abelian groups

โœ Scribed by Bernd Voigt

Publisher
Elsevier Science
Year
1980
Tongue
English
Weight
720 KB
Volume
28
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A Combinatorial Problem on Finite Abelia
A Combinatorial Problem on Finite Abelian Groups
โœ W.D. Gao ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 186 KB

In this paper the following theorem is proved. Let G be a finite Abelian group of order n. Then, n+D(G )&1 is the least integer m with the property that for any sequence of m elements a 1 , ..., a m in G, 0 can be written in the form 0= a 1 + } } } +a in with 1 i 1 < } } } <i n m, where D(G) is the

Addition Theorems for Finite Abelian Gro
Addition Theorems for Finite Abelian Groups
โœ W.D. Gao ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 202 KB

Let \(a_{1}, \ldots, a_{k}\) be a sequence of elements in an Abelian group of order \(n\) (repetition allowed). In this paper, we give two sufficient conditions such that an element \(g \in G\) can be written in the form \(g=a_{i_{1}}+a_{i_{2}}+\cdots+a_{i_{n}}, 1 \leqslant i_{1}<i_{2}<\cdots<i_{n}