a non-abelian finite group is called sequenceable if for some positive integer , is -generated ( ) and there exist integers such that every element of is a term of the -step generalized fibonacci sequence , , , . a remarkable application of this definition may be find on the study of random covers in the cryptography. the 2-step generalized sequences for the dihedral groups studied for their pe...

By using the finite element $p$-Version in convection-diffusion problems, we can attain to a stabilized and accurate results. Furthermore, the fundamental of the finite element $p$-Version is augmentation degrees of freedom. Based on the fact that the finite element and the meshless methods have similar concept, it is obvious that many ideas in the finite element can be easily used in the meshl...

in this paper, a new smooth second order sliding mode control is proposed. this algorithm is a modified form of super twisting algorithm. the super twisting guarantees the asymptotic stability, but the finite time stability of proposed method is proved with introducing a new particular lyapunov function. the proposed algorithm which is able to control nonlinear systems with matched structured u...

let $g$ be a finite group‎. ‎we say that $g$ has emph{spread} r if for any set of distinct non-trivial elements of $g$ $x:={x_1,ldots‎, ‎x_r}subset g^{#}$ there exists an element $yin g$ with the property that $langle x_i,yrangle=g$ for every $1leq ileq r$‎. ‎we say $g$ has emph{exact spread} $r$ if $g$ has spread $r$ but not $r+1$‎. ‎the spreads of finite simple groups and their decorations ha...

let $g $ be a finite group and let $gamma(g)$ be the prime graph‎ ‎of g‎. ‎assume $2 < q = p^{alpha} < 100$‎. ‎we determine finite groups‎ ‎g such that $gamma(g) = gamma(u_3(q))$ and prove that if $q neq‎ ‎3‎, ‎5‎, ‎9‎, ‎17$‎, ‎then $u_3(q)$ is quasirecognizable by prime graph‎, ‎i.e‎. ‎if $g$ is a finite group with the same prime graph as the‎ ‎finite simple group $u_3(q)$‎, ‎then $g$ has a un...

‎in 1970‎, ‎menegazzo [gruppi nei quali ogni sottogruppo e intersezione di sottogruppi massimali‎, ‎ atti accad‎. ‎naz‎. ‎lincei rend‎. ‎cl‎. ‎sci‎. ‎fis‎. ‎mat‎. ‎natur. 48 (1970)‎, ‎559--562.] gave a complete description of the structure of soluble $im$-groups‎, ‎i.e.‎, ‎groups in which every subgroup can be obtained as intersection of maximal subgroups‎. ‎a group $g$ is said to have the $fm$...

A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...

In this paper we define S algebras and show that every finite group can be found in some S algebra.  We define and study the S degree of a finite group and determine the S degree of several classes of finite groups such as cyclic groups, elementary abelian $p$-groups, and dihedral groups $D_p$.

In this paper, without using the classification of finite simple groups, we determine the structure of  finite simple groups whose Sylow 3-subgroups are of the order 9. More precisely, we classify finite simple groups whose Sylow 3-subgroups are elementary abelian of order 9.