18,656 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
Iterated Sumsets and Subsequence Sums
Let
be a finite abelian group with . The Kemperman
Structure Theorem characterizes all subsets satisfying
and has been extended to cover the case when . Utilizing these results, we provide a precise structural description
of all finite subsets with when
(also when is infinite), in which case many of the pathological
possibilities from the case vanish, particularly for large . The structural description is combined with other arguments to
generalize a subsequence sum result of Olson asserting that a sequence of
terms from having length must either have every element of
representable as a sum of -terms from or else have all but
of its terms lying in a common -coset for some . We show
that the much weaker hypothesis suffices to obtain a
nearly identical conclusion, where for the case is trivial we must allow
all but terms of to be from the same -coset. The bound on
is improved for several classes of groups , yielding optimal lower
bounds for . We also generalize Olson's result for -term subsums to
an analogous one for -term subsums when , with the bound
likewise improved for several special classes of groups. This improves previous
generalizations of Olson's result, with the bounds for optimal.Comment: Revised version, with results reworded to appear less technica
On a Conjecture of Hamidoune for Subsequence Sums
Let G be an abelian group of order m, let S be a sequence of terms from G with k distinct terms, let m ∧ S denote the set of all elements that are a sum of some m-term subsequence of S, and let |S| be the length of S. We show that if |S| ≥ m + 1, and if the multiplicity of each term of S is at most m − k + 2, then either |m ∧ S| ≥ min{m, |S| − m + k − 1}, or there exists a proper, nontrivial subgroup Ha of index a, such that m ∧ S is a union of Ha-cosets, Ha ⊆ m ∧ S, and all but e terms of S are from the same Ha-coset, where e ≤ min{|S|−m+k−2 |Ha| − 1, a − 2} and |m ∧ S| ≥ (e + 1)|Ha|. This confirms a conjecture of Y. O. Hamidoune
Algebraic aspects of increasing subsequences
We present a number of results relating partial Cauchy-Littlewood sums,
integrals over the compact classical groups, and increasing subsequences of
permutations. These include: integral formulae for the distribution of the
longest increasing subsequence of a random involution with constrained number
of fixed points; new formulae for partial Cauchy-Littlewood sums, as well as
new proofs of old formulae; relations of these expressions to orthogonal
polynomials on the unit circle; and explicit bases for invariant spaces of the
classical groups, together with appropriate generalizations of the
straightening algorithm.Comment: LaTeX+amsmath+eepic; 52 pages. Expanded introduction, new references,
other minor change
Sequences with small subsum sets
AbstractA conjecture of Gao and Leader, recently proved by Sun, states that if X=(xi)i=1n is a sequence of length n in a finite abelian group of exponent n, then either some subsequence of X sums to zero or the set of all sums of subsequences of X has cardinality at least 2n−1. This conjecture turns out to be a simple consequence of a theorem of Olson and White; we investigate generalizations that are not implied by this theorem. In particular, we prove the following result: if X=(xi)i=1n is a sequence of length n, the terms of which generate a finite abelian group of rank at least 3, then either some subsequence of X sums to zero or the set of all sums of subsequences of X has cardinality at least 4n−5
Representation of Finite Abelian Group Elements by Subsequence Sums
Let be a finite and nontrivial
abelian group with . A conjecture of Hamidoune says that if
is a sequence of integers, all but at most one relatively prime
to , and is a sequence over with ,
the maximum multiplicity of at most , and ,
then there exists a nontrivial subgroup such that every element
can be represented as a weighted subsequence sum of the form
, with a subsequence of . We give two
examples showing this does not hold in general, and characterize the
counterexamples for large .
A theorem of Gao, generalizing an older result of Olson, says that if is
a finite abelian group, and is a sequence over with , then either every element of can be represented as a
-term subsequence sum from , or there exists a coset such that
all but at most terms of are from . We establish some very
special cases in a weighted analog of this theorem conjectured by Ordaz and
Quiroz, and some partial conclusions in the remaining cases, which imply a
recent result of Ordaz and Quiroz. This is done, in part, by extending a
weighted setpartition theorem of Grynkiewicz, which we then use to also improve
the previously mentioned result of Gao by showing that the hypothesis can be relaxed to , where
d^*(G)=\Sum_{i=1}^{r}(n_i-1). We also use this method to derive a variation
on Hamidoune's conjecture valid when at least of the are
relatively prime to
- …