SumSet Generator

By William Czubakowski and Colin Messinger

Based on SamSets and Irsets by Samir M Lalvani (http://www.cs.gettysburg.edu/~lalvsa01/)

Special thanks to Samuel Edwards, Dr. Bela Bajnok, and Dr. Ivaylo Ilinkin

How many SumSets do you want to find?
iterations =

What is the order (n) of your group?
Fixed value
Range of values
n =

Enter either the size of a subset (m) to have the program find all subsets of size m, or a specific subset (the subset A).
Specific m-value
Specific subset A (separate all elements with commas and no spaces)
m =

Enter the number of terms that will be added (the value of h).
h is fixed
h is a range
h =

Is the sumset restricted or nonrestricted?
Restricted (^)
Non-restricted (ordinary/distinct)

Is the sumset signed or unsigned?
Signed (+/-)
Unsigned (+)

Do you want to restrict the size of the sumsets?
No, generate all sumsets.
Yes, only generate sumsets with a range of sizes

0-free?
Yes No

How many SumSets do you want to find?
iterations =

Enter the orders of your groups (separate all elements with commas).


Enter either the size of a subset (m) to have the program find all subsets of size m, or a specific subset (the subset A).
Specific m-value
Specific subset A (separate all elements with commas and no spaces)
m =

Enter the number of terms that will be added (the value of h).
h is fixed
h is a range
h =

Is the sumset restricted or nonrestricted?
Restricted (^)
Non-restricted (ordinary/distinct)

Is the sumset signed or unsigned?
Signed (+/-)
Unsigned (+)

Do you want to restrict the size of the sumsets?
No, generate all sumsets.
Yes, only generate sumsets with a range of sizes

0-free?
Yes No