Search Results

You are looking at 1 - 5 of 5 items for

  • Author or Editor: Alfred Geroldinger x
  • Refine by Access: All Content x
Clear All Modify Search
Restricted access

Abstract  

Let
\documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$G = C_{n_1 } \oplus \cdots \oplus C_{n_r }$$ \end{document}
with 1 < n 1 | … | n r be a finite abelian group, d*(G) = n 1 +…+n r r, and let d(G) denote the maximal length of a zerosum free sequence over G. Then d(G) ≥ d*(G), and the standing conjecture is that equality holds for G = C n r . We show that equality does not hold for C 2C 2n r , where n ≥ 3 is odd and r ≥ 4. This gives new information on the structure of extremal zero-sum free sequences over C 2n r .
Restricted access
Acta Mathematica Hungarica
Authors:
Alfred Geroldinger
,
David J. Grynkiewicz
, and
Wolfgang A. Schmid

Abstract

For a finite abelian group G and a positive integer d, let s d(G) denote the smallest integer ∊ℕ0 such that every sequence S over G of length |S|≧ has a nonempty zero-sum subsequence T of length |T|≡0 mod d. We determine s d(G) for all d≧1 when G has rank at most two and, under mild conditions on d, also obtain precise values in the case of p-groups. In the same spirit, we obtain new upper bounds for the Erdős–Ginzburg–Ziv constant provided that, for the p-subgroups G p of G, the Davenport constant D(G p ) is bounded above by 2exp  (G p )−1. This generalizes former results for groups of rank two.

Restricted access
Acta Mathematica Hungarica
Authors:
Rui Chi
,
Shuyan Ding
,
Weidong Gao
,
Alfred Geroldinger
, and
Wolfgang A. Schmid

Summary For a finite abelian group G, we investigate the invariant  s(G) (resp.  the invariant  s0(G)) which is defined as the smallest integer l ? N such that every sequence S in G of length |S| = l has a subsequence T with sum zero and length |T|= exp(G) (resp. length |T|=0 mod exp(G)).

Restricted access