On the number of subsequences with given sum

DOI10.1016/S0012-365X(98)00121-6MaRDI QIDQ1296977zbMATH OpenOpenAlexFDO

Authors Weidong Gao

Publication date 3 March 2000

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0012-365x(98)00121-6

zbMATH Keywords

finite Abelian groupssubsequence sums

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Other combinatorial number theory (11B75) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Finite abelian groups (20K01)

Review text

Let \(G\) be a finite Abelian group of order \(n\) and let \(\sigma\) be a sequence of elements of \(G\) of length \(2n-1\). The author obtains a lower bound for the number of subsequences of \(\sigma\) of length \(n\) with a given sum.

Recommendations

• On the number of subsequences with a given sum in a finite abelian group
• On the number of subsequences with given sum of sequences over finite abelian \(p\)-groups
• On the number of zero-sum subsequences
• On zero-sum subsequences of length not exceeding a given number
• On zero sum subsequences of restricted size

Cites work

• A Generalization of an Addition Theorem for Solvable Groups
• A problem of Erdős on Abelian groups
• An addition theorem for finite cyclic groups
• Bounds for counter-examples to addition theorems in solvable groups
• scientific article; zbMATH DE number 426326 (Why is no real title available?)
• scientific article; zbMATH DE number 524125 (Why is no real title available?)
• scientific article; zbMATH DE number 3102822 (Why is no real title available?)
• On a combinatorial problem of Erdős, Ginzburg, and Ziv
• On the Erdős-Ginzburg-Ziv theorem and the Ramsey numbers for stars and matchings
• On the number of zero sum subsequences
• The number of zero sums modulo m in a sequence of length n
• Two addition theorems
• Two addition theorems on groups of prime order
• Zero-sum problems -- a survey

Cited in

(12)

• Subsequence summation and the m function
• Formulas for the numbers of sequences containing a given pattern given number of times
• An extremal problem in subsequence sum
• Approximating the maximum consecutive subsums of a sequence
• On the number of subsequences with given sum of sequences over finite abelian \(p\)-groups
• scientific article; zbMATH DE number 5014481 (Why is no real title available?)
• Onn-Sums in an Abelian Group
• On the number of fully weighted zero-sum subsequences
• On the number of subsequences with a given sum in a finite abelian group
• The Largest Sum-Free Subsequence from a Sequence of n Numbers
• All sums of \(h\) distinct terms of a sequence
• Zero-sum problems in finite Abelian groups: a survey

This page was built for publication: On the number of subsequences with given sum

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296977)