New cyclic group codes oflength 2"1 over (m j)-bit symbols are introduced. These codes can be systematically encoded and decoded algebraically. The code rates are very close to Reed-Solomon (RS) codes and are much better than BoseChaudhuri-Hocquenghem (BCH) codes (a former alternative). The binary (m j)tuples are identified with a subgroup of the binary m-tuples which represent the field GF(2m)...

Any integer program may be relaxed to a group problem. We define the master cyclic group problem and several master knapsack problems, show the relationship between the problems, and give several classes of facet-defining inequalities for each problem, as well as a set of mappings that take facets from one type of master polyhedra to another.

in this paper we provide explicit formulas for the number of elements/subgroups/cyclic subgroups of a given order and for the total number of subgroups/cyclic subgroups in a finite hamiltonian group. the coverings with three proper subgroups and the principal series of such a group are also counted. finally, we give a complete description of the lattice of characteristic subgroups of a finite h...

objective: cell vital function has correlation with mechanical loadings that cell experiences. here, effects of in-vitro combined cyclic-static stretch on proliferation of human mesenchymal stem cell (hmsc) were evaluated. materials and methods: hmscs were cultured on gelatin coated elastic membranes, and exposed to stretch loading. four different regimes of cyclic, static, combined cyclic-sta...

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.