A Generalization of an Addition Theorem for Solvable Groups
Canadian journal of mathematics, Tome 36 (1984) no. 3, pp. 529-536
Voir la notice de l'article provenant de la source Cambridge University Press
The “sets” in this paper are actually multi-sets. That is, we allow an element to occur several times in a set and distinguish between the number of elements in a set and the number of distinct elements in the set. On the few occasions when we need to avoid repetition we will use the term “ordinary set.“ Definition. Let G be a group and let S a set of elements of G. An r-sum in S is an ordered subset of S of cardinality r; the result of that r-sum is the product of its elements in the designated order. Definition. If S is a set, r(x, S) denotes the number of times x appears in S and [x, S] is a set consisting of r(x, S) copies of x. An n-set or n-subset is a set consisting of n elements. Hence [x, S] is an r(x, S)-subset of S.
Yuster, Thomas; Peterson, Bruce. A Generalization of an Addition Theorem for Solvable Groups. Canadian journal of mathematics, Tome 36 (1984) no. 3, pp. 529-536. doi: 10.4153/CJM-1984-032-x
@article{10_4153_CJM_1984_032_x,
author = {Yuster, Thomas and Peterson, Bruce},
title = {A {Generalization} of an {Addition} {Theorem} for {Solvable} {Groups}},
journal = {Canadian journal of mathematics},
pages = {529--536},
year = {1984},
volume = {36},
number = {3},
doi = {10.4153/CJM-1984-032-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1984-032-x/}
}
TY - JOUR AU - Yuster, Thomas AU - Peterson, Bruce TI - A Generalization of an Addition Theorem for Solvable Groups JO - Canadian journal of mathematics PY - 1984 SP - 529 EP - 536 VL - 36 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1984-032-x/ DO - 10.4153/CJM-1984-032-x ID - 10_4153_CJM_1984_032_x ER -
[1] 1. Cauchy, A. L., Recherches sur les nombres, Journal Ecole Polytechnique 9 (1813), 99–123. Google Scholar
[2] 2. Erdös, , Ginsburg, and Ziv, , Theorem in additive number theory, Bull. Res. Coun. Israel 10 (1961), 41–43. Google Scholar
Cité par Sources :