In the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(P,Q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}A_{l}XB_{l}+overset{v} ‎{underset{s=1}{sum}}C_{s}widetilde{X}D_{s}=F$‎. ‎By this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎When the‎ ‎matrix equation is consistent over...

we shall extend the results of [5] and prove that if f = z o a x ? z [[x]] is algebraic over q (x), where a = 1, ƒ 1 and if ? , ? ,..., ? are p-adic integers, then 1 ? , ? ,..., ? are linkarly independent over q if and only if (1+x) ,(1+x) ,…,(1+x) are algebraically independent over q (x) if and only if f , f ,.., f are algebraically independent over q (x)

let g be a transitive permutation group on a set ? and let m be a positive integer. if no element of g moves any subset of ? by more than m points, then |? | [2mp i (p-1)] wherep is the least odd primedividing |g |. when the bound is attained, we show that | ? | = 2 p q ….. q where ? is a non-negative integer with 2 < p, r 1 and q is a prime satisfying p < q < 2p, ? = 0 or 1, i i n. furthermore...

in the present paper‎, ‎we propose an iterative algorithm for‎ ‎solving the generalized $(p,q)$-reflexive solution of the quaternion matrix‎ ‎equation $overset{u}{underset{l=1}{sum}}a_{l}xb_{l}+overset{v} ‎{underset{s=1}{sum}}c_{s}widetilde{x}d_{s}=f$‎. ‎by this iterative algorithm‎, ‎the solvability of the problem can be determined automatically‎. ‎when the‎ ‎matrix equation is consistent over...