On the number of fully weighted zero-sum subsequences

Abstract: Let

G

be a finite additive abelian group with exponent

n

and

S = g_{1} c d o t s g_{t}

be a sequence of elements in

G

. For any element

g

of

G

and

A s u b s e t e q 1, 2, l d o t s, n - 1

, let

N_{A, g} (S)

denote the number of subsequences

T = p r o d_{i i n I} g_{i}

of

S

such that

s u m_{i i n I} a_{i} g_{i} = g

, where

I s u b s e t e q l e f t 1, l d o t s, t i g h t

and

a_{i} i n A

. In this paper, we prove that

N_{A, 0} (S) g e q 2^{| S | - D_{A} (G) + 1}

, when

A = l e f t 1, l d o t s, n - 1 i g h t

, where

D_{A} (G)

is the smallest positive integer

l

, such that every sequence

S

over

G

of length at least

l

has nonempty subsequence

T = p r o d_{i i n I} g_{i}

such that

s u m_{i i n I} a_{i} g_{i} = 0

,

I s u b s e t e q l e f t 1, l d o t s, t i g h t

and

a_{i} i n A

. Moreover, we classify the sequences such that

N_{A, 0} (S) = 2^{| S | - D_{A} (G) + 1}

, where the exponent of

G

is an odd number.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: On the number of fully weighted zero-sum subsequences