Sets in Abelian Groups with Distinct Sums of Pairs

@inproceedings{Haanp2002SetsIA,
  title={Sets in Abelian Groups with Distinct Sums of Pairs},
  author={Harri Haanp{\"a}{\"a} and Patric R. J. {\"O}sterg{\aa}rd},
  year={2002}
}
A subset S = {s1, . . . , sk} of an Abelian group G is called an St-set of size k if all sums of t different elements in S are distinct. Let s(G) denote the cardinality of the largest S2-set in G. Let v(k) denote the order of the smallest Abelian group for which s(G) ≥ k. We develop bounds for s(G), and we determine v(k) for k ≤ 15 by determining s(G) for Abelian groups of order up to 183 using exhaustive backtrack search with isomorph rejection. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Über die Automorphismen einer endlichen abelschen

K. Shoda
Gruppe, Math. Ann • 1928
View 4 Excerpts
Highly Influenced

The Helly bound for singular sums

Discrete Mathematics • 2002
View 1 Excerpt

Unsolved Problems in Number Theory, 2nd ed

R. K. Guy
1994
View 1 Excerpt

Lower bounds for constant weight codes

IEEE Trans. Information Theory • 1980
View 1 Excerpt

On Additive Bases and Harmonious Graphs

SIAM J. Matrix Analysis Applications • 1980
View 3 Excerpts

Every one a winner, or How to avoid isomorphism search when cataloguing combinatorial configurations, Ann

R. C. Read
Discrete Math • 1978
View 1 Excerpt

Similar Papers

Loading similar papers…