Let S be a principally embedded ???????? 2 -subalgebra in n for n?3. A special case of results the third author and Gregg Zuckerman implies that there exists positive integer b(n) such any finite-dimensional irreducible -representation, V, an S-representation embedding V with dimension at most b(n). In 2017 paper (joint Hassan Lhou), they prove b(n)=n is sharpest possible bound, also address em...

The main target of this article is to study about Lie Groups, Algebras. This will enrich our knowledge Algebraic properties manifolds, how Groups and Algebras are working with their properties. Finally, we have discussed an example by showing all the Algebra,Lie for a special Group Theorem has established. Dhaka Univ. J. Sci. 71(1): 82-86, 2023 (Jan)

This paper studies the zero properties of blocked linear systems resulting from blocking of linear timeinvariant systems. Themain idea is to establish a relation between the zero properties of blocked systems and the zero properties of their corresponding unblocked systems. In particular, it is shown that the blocked system has a zero if and only if the associated unblocked system has a zero. F...

In this paper we will prove that the simple group $G_2(q)$, where $2 < q equiv 1(mod3)$ is recognizable by the set of its order components, also other word we prove that if $G$ is a finite group with $OC(G)=OC(G_2(q))$, then $G$ is isomorphic to $G_2(q)$.

In this letter, we discussed some properties of characteristic generators for a finite Abelian group code, proved that any two characteristic generators can not start (end) at the same position and have the same order of the starting (ending) components simultaneously, and that the number of all characteristic generators can be directly computed from the group code itself. These properties are ...

The order bound for the minimum distance of algebraic geometry codes was originally defined for the duals of one-point codes and later generalized for arbitrary algebraic geometry codes. Another bound of order type for the minimum distance of general linear codes, and for codes from order domains in particular, was given in [1]. Here we investigate in detail the application of that bound to one...