Papers
Topics
Authors
Recent
Search
2000 character limit reached

$B_{h}[g]$ modular sets from $B_{h}$ modular sets

Published 21 Nov 2014 in math.NT | (1411.5741v2)

Abstract: A set of positive integers $A$ is called a $B_{h}[g]$ set if there are at most $g$ different sums of $h$ elements from $A$ with the same result. This definition has a generalization to abelian groups and the main problem related to this kind of sets, is to find $B_{h}[g]$ maximal sets i.e. those with larger cardinality. We construct $B_{h}[g]$ modular sets from $B_{h}$ modular sets using homomorphisms and analyze the constructions of $B_{h}$ sets by Bose and Chowla, Ruzsa, and G\'omez and Trujillo look at for the suitable homomorphism that allows us to preserve the cardinal of this types of sets.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.