On zero-sum free sequences contained in random subsets of finite cyclic groups

From MaRDI portal



Abstract: Let Cn be a cyclic group of order n. A sequence S of length ell over Cn is a sequence of ell elements in Cn, where a repetition of elements is allowed and their order is disregarded. We say that S is a zero-sum sequence if Sigmai=1ellai=0 and that S is a zero-sum free sequence if S contains no zero-sum subsequence. Let R be a random subset of Cn obtained by choosing each element in Cn independently with probability p. Let Nn−1−kR be the number of zero-sum free sequences of length n−1−k in R. Also, let Nn−1−k,dR be the number of zero-sum free sequences of length n−1−k having d distinct elements in R. We obtain the expectation of Nn−1−kR and Nn−1−k,dR for . We also show a concentration result on Nn−1−kR and Nn−1−k,dR when k is fixed.














This page was built for publication: On zero-sum free sequences contained in random subsets of finite cyclic groups

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