On decomposition of finite Abelian groups

The name of the pictureThe name of the pictureThe name of the pictureClash Royale CLAN TAG#URR8PPP











up vote
1
down vote

favorite












It is easy to see that for any finite Abelian group $G$ and any numbers $a,b$ with $|G|=ab$ there exist a subgroup $Asubset G$ and a subset $Bsubset G$ such that $|A|=a$, $|B|=b$ and $G=A+B$, where $A+B=a+b:ain A,;bin B$.




Problem. Is it true that for any finite abelian group $G$ and numbers $a,b$ with $abge|G|$ there are two subsets $A,Bsubset G$ of cardinality $|A|le a$ and $|B|le b$ such that $A+B=G$?




Remark. The answer is affirmative if the group $G$ is cyclic.










share|cite|improve this question























  • If $G$ has exponent 3 and $A=1,a$ has cardinal 2, then the injectivity of the sum map $Atimes Bto G$ implies its injectivity on $1,a,a^2times B$. This yields many further counterexamples.
    – YCor
    6 hours ago














up vote
1
down vote

favorite












It is easy to see that for any finite Abelian group $G$ and any numbers $a,b$ with $|G|=ab$ there exist a subgroup $Asubset G$ and a subset $Bsubset G$ such that $|A|=a$, $|B|=b$ and $G=A+B$, where $A+B=a+b:ain A,;bin B$.




Problem. Is it true that for any finite abelian group $G$ and numbers $a,b$ with $abge|G|$ there are two subsets $A,Bsubset G$ of cardinality $|A|le a$ and $|B|le b$ such that $A+B=G$?




Remark. The answer is affirmative if the group $G$ is cyclic.










share|cite|improve this question























  • If $G$ has exponent 3 and $A=1,a$ has cardinal 2, then the injectivity of the sum map $Atimes Bto G$ implies its injectivity on $1,a,a^2times B$. This yields many further counterexamples.
    – YCor
    6 hours ago












up vote
1
down vote

favorite









up vote
1
down vote

favorite











It is easy to see that for any finite Abelian group $G$ and any numbers $a,b$ with $|G|=ab$ there exist a subgroup $Asubset G$ and a subset $Bsubset G$ such that $|A|=a$, $|B|=b$ and $G=A+B$, where $A+B=a+b:ain A,;bin B$.




Problem. Is it true that for any finite abelian group $G$ and numbers $a,b$ with $abge|G|$ there are two subsets $A,Bsubset G$ of cardinality $|A|le a$ and $|B|le b$ such that $A+B=G$?




Remark. The answer is affirmative if the group $G$ is cyclic.










share|cite|improve this question















It is easy to see that for any finite Abelian group $G$ and any numbers $a,b$ with $|G|=ab$ there exist a subgroup $Asubset G$ and a subset $Bsubset G$ such that $|A|=a$, $|B|=b$ and $G=A+B$, where $A+B=a+b:ain A,;bin B$.




Problem. Is it true that for any finite abelian group $G$ and numbers $a,b$ with $abge|G|$ there are two subsets $A,Bsubset G$ of cardinality $|A|le a$ and $|B|le b$ such that $A+B=G$?




Remark. The answer is affirmative if the group $G$ is cyclic.







co.combinatorics gr.group-theory finite-groups additive-combinatorics abelian-groups






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 7 hours ago









Martin Sleziak

2,75432028




2,75432028










asked 7 hours ago









Taras Banakh

14.1k12882




14.1k12882











  • If $G$ has exponent 3 and $A=1,a$ has cardinal 2, then the injectivity of the sum map $Atimes Bto G$ implies its injectivity on $1,a,a^2times B$. This yields many further counterexamples.
    – YCor
    6 hours ago
















  • If $G$ has exponent 3 and $A=1,a$ has cardinal 2, then the injectivity of the sum map $Atimes Bto G$ implies its injectivity on $1,a,a^2times B$. This yields many further counterexamples.
    – YCor
    6 hours ago















If $G$ has exponent 3 and $A=1,a$ has cardinal 2, then the injectivity of the sum map $Atimes Bto G$ implies its injectivity on $1,a,a^2times B$. This yields many further counterexamples.
– YCor
6 hours ago




If $G$ has exponent 3 and $A=1,a$ has cardinal 2, then the injectivity of the sum map $Atimes Bto G$ implies its injectivity on $1,a,a^2times B$. This yields many further counterexamples.
– YCor
6 hours ago










1 Answer
1






active

oldest

votes

















up vote
6
down vote



accepted










I don't think it's true for $G=mathbbF_2^3$ and $a=b=3$.



If there were such sets $A$ and $B$, they must have exactly three elements each.



By applying a translation and a group automorphism, we may as well take
$$A=(0,0,0),(1,0,0),(0,1,0).$$



Then $B$ either has at most one element with third coordinate zero, in which case $A+B$ has at most three of the four elements with third coordinate zero, or it has at most one element with third coordinate one, in which case $A+B$ has at most three of the four elements with third coordinate one.






share|cite|improve this answer




















  • Yes indeed, you're right.
    – YCor
    6 hours ago










Your Answer




StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");

StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);

else
createEditor();

);

function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
convertImagesToLinks: true,
noModals: false,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);



);













 

draft saved


draft discarded


















StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f312731%2fon-decomposition-of-finite-abelian-groups%23new-answer', 'question_page');

);

Post as a guest






























1 Answer
1






active

oldest

votes








1 Answer
1






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
6
down vote



accepted










I don't think it's true for $G=mathbbF_2^3$ and $a=b=3$.



If there were such sets $A$ and $B$, they must have exactly three elements each.



By applying a translation and a group automorphism, we may as well take
$$A=(0,0,0),(1,0,0),(0,1,0).$$



Then $B$ either has at most one element with third coordinate zero, in which case $A+B$ has at most three of the four elements with third coordinate zero, or it has at most one element with third coordinate one, in which case $A+B$ has at most three of the four elements with third coordinate one.






share|cite|improve this answer




















  • Yes indeed, you're right.
    – YCor
    6 hours ago














up vote
6
down vote



accepted










I don't think it's true for $G=mathbbF_2^3$ and $a=b=3$.



If there were such sets $A$ and $B$, they must have exactly three elements each.



By applying a translation and a group automorphism, we may as well take
$$A=(0,0,0),(1,0,0),(0,1,0).$$



Then $B$ either has at most one element with third coordinate zero, in which case $A+B$ has at most three of the four elements with third coordinate zero, or it has at most one element with third coordinate one, in which case $A+B$ has at most three of the four elements with third coordinate one.






share|cite|improve this answer




















  • Yes indeed, you're right.
    – YCor
    6 hours ago












up vote
6
down vote



accepted







up vote
6
down vote



accepted






I don't think it's true for $G=mathbbF_2^3$ and $a=b=3$.



If there were such sets $A$ and $B$, they must have exactly three elements each.



By applying a translation and a group automorphism, we may as well take
$$A=(0,0,0),(1,0,0),(0,1,0).$$



Then $B$ either has at most one element with third coordinate zero, in which case $A+B$ has at most three of the four elements with third coordinate zero, or it has at most one element with third coordinate one, in which case $A+B$ has at most three of the four elements with third coordinate one.






share|cite|improve this answer












I don't think it's true for $G=mathbbF_2^3$ and $a=b=3$.



If there were such sets $A$ and $B$, they must have exactly three elements each.



By applying a translation and a group automorphism, we may as well take
$$A=(0,0,0),(1,0,0),(0,1,0).$$



Then $B$ either has at most one element with third coordinate zero, in which case $A+B$ has at most three of the four elements with third coordinate zero, or it has at most one element with third coordinate one, in which case $A+B$ has at most three of the four elements with third coordinate one.







share|cite|improve this answer












share|cite|improve this answer



share|cite|improve this answer










answered 7 hours ago









Jeremy Rickard

20k15393




20k15393











  • Yes indeed, you're right.
    – YCor
    6 hours ago
















  • Yes indeed, you're right.
    – YCor
    6 hours ago















Yes indeed, you're right.
– YCor
6 hours ago




Yes indeed, you're right.
– YCor
6 hours ago

















 

draft saved


draft discarded















































 


draft saved


draft discarded














StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f312731%2fon-decomposition-of-finite-abelian-groups%23new-answer', 'question_page');

);

Post as a guest













































































Comments

Popular posts from this blog

What does second last employer means? [closed]

Installing NextGIS Connect into QGIS 3?

One-line joke