a group $g$ is said to be a c-tidy group if for every element $x in g setminus k(g)$‎, ‎the set $cyc(x)=lbrace y in g mid langle x‎, ‎y rangle ; {rm is ; cyclic} rbrace$ is a cyclic subgroup of $g$‎, ‎where $k(g)=underset{x in g}bigcap cyc(x)$‎. ‎in this short note we determine the structure of finite c-tidy groups‎.

Let Cn be a cyclic group of order n. A sequence S length ℓ over is S=a1⋅a2⋅…⋅aℓ elements in Cn, where repetition allowed and their disregarded. We say that zero-sum if Σi=1ℓai=0 free contains no subsequence. In 2000, Gao obtained construction all sequences n−1−k for 0≤k≤n3. this paper, we consider generalization random subset Cn. R=R(Cn,p) by choosing each element independently with probability...

Uncertainty principles for functions defined on finite Abelian groups generally relate the cardinality of a function to the cardinality of its Fourier transform. We examine how the cardinality of a function is related to the cardinality of its short–time Fourier transform. We illustrate that for some cyclic groups of small order, both, the Fourier and the short–time Fourier case, show a remarka...