Onn-Sums in an Abelian Group

DOI10.1017/S0963548315000255zbMath1372.11031OpenAlexW2576028618MaRDI QIDQ5366898

Xingwu Xia, David J. Grynkiewicz, Weidong Gao

Publication date: 10 October 2017

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548315000255

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Finite abelian groups (20K01) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (6)

Representing Sequence Subsums as Sumsets of Near Equal Sized Sets ⋮ Unnamed Item ⋮ Inverse problems associated with subsequence sums in \(C_p \oplus C_p\). II ⋮ Structure of a sequence with prescribed zero-sum subsequences: rank two \(p\)-groups ⋮ Inverse problems associated with \(k\)-sums of sequences over finite abelian groups ⋮ Iterated sumsets and setpartitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Representation of finite abelian group elements by subsequence sums
• A generalization of Kneser's addition theorem
• On subsequence sums of a zero-sum free sequence
• On subsequence sums of a zero-sum free sequence. II.
• Sequences with small subsum sets
• An addition theorem for finite abelian groups
• On the number of subsequences with given sum
• The number of \(k\)-sums modulo \(k\)
• Addition theorems for finite abelian groups
• A combinatorial problem on finite abelian groups
• Zero-sum problems -- a survey
• Structural additive theory. Based on courses given at Karl-Franzens-Universität Graz, Austria, 2008--2012
• Long \(n\)-zero-free sequences in finite cyclic groups
• Sums and \(k\)-sums in abelian groups of order \(k\)
• Conditions for a Zero Sum Modulo n
• On a variant of the Erdős-Ginzburg-Ziv problem
• On some developments of the Erdős–Ginzburg–Ziv Theorem II
• Two addition theorems
• Two combinatorial problems in group theory

This page was built for publication: Onn-Sums in an Abelian Group