621 research outputs found
Arithmetic-Progression-Weighted Subsequence Sums
Let be an abelian group, let be a sequence of terms
not all contained in a coset of a proper subgroup of
, and let be a sequence of consecutive integers. Let
which is a particular kind of weighted restricted sumset. We show that , that if , and also
characterize all sequences of length with . This
result then allows us to characterize when a linear equation
where are
given, has a solution modulo with all
distinct modulo . As a second simple corollary, we also show that there are
maximal length minimal zero-sum sequences over a rank 2 finite abelian group
(where and ) having
distinct terms, for any . Indeed, apart from
a few simple restrictions, any pattern of multiplicities is realizable for such
a maximal length minimal zero-sum sequence
Zero-sum problems with congruence conditions
For a finite abelian group and a positive integer , let denote the smallest integer such that
every sequence over of length has a nonempty zero-sum
subsequence of length . We determine for all when has rank at most two and, under mild
conditions on , also obtain precise values in the case of -groups. In the
same spirit, we obtain new upper bounds for the Erd{\H o}s--Ginzburg--Ziv
constant provided that, for the -subgroups of , the Davenport
constant is bounded above by . This
generalizes former results for groups of rank two
Some recent results and open problems on sets of lengths of Krull monoids with finite class group
Some of the fundamental notions related to sets of lengths of Krull monoids
with finite class group are discussed, and a survey of recent results is given.
These include the elasticity and related notions, the set of distances, and the
structure theorem for sets of lengths. Several open problems are mentioned
Long zero-free sequences in finite cyclic groups
A sequence in an additively written abelian group is called zero-free if each
of its nonempty subsequences has sum different from the zero element of the
group. The article determines the structure of the zero-free sequences with
lengths greater than in the additive group \Zn/ of integers modulo .
The main result states that for each zero-free sequence of
length in \Zn/ there is an integer coprime to such that if
denotes the least positive integer in the congruence class
(modulo ), then . The answers to a number of
frequently asked zero-sum questions for cyclic groups follow as immediate
consequences. Among other applications, best possible lower bounds are
established for the maximum multiplicity of a term in a zero-free sequence with
length greater than , as well as for the maximum multiplicity of a
generator. The approach is combinatorial and does not appeal to previously
known nontrivial facts.Comment: 13 page
- …