arXiv subjects
Publications and source records attributed to Mohammad Obiedat.
A relationship between real, complex, and quaternionic vector fields on spheres is given by using a relationship between the corresponding standard inner products. The number of linearly independent complex vector fields on the standard $(4n-1)$-sphere is shown to be twice the number of linearly independent quaternionic vector fields plus $d$, where $ d = 1 \mbox{ or } 3$.
Lattice data structures are space efficient and cache-suitable data structures. The basic searching, insertion, and deletion operations are of time complexity $O(\sqrt{N})$. We give a jump searching algorithm of time complexity $O(J(L)\log(N))$, where $J(L)$ is the jump factor of the lattice. $J(L)$ approaches $4$ when the degree of sortedness of the lattice approaches $\sqrt{N}$. A sorting procedure of time complexity $O(\sqrt{N})$ that can be used, during the system idle time, to increase the degree of sortedness of the lattice is given.
Let $KO(CP^m)$ be the KO-ring of the complex projective space $CP^m.$ By means of methods of rational D-series, a formula for the J-orders of elements of $KO(CP^m)$ is given. Explicit formulas are given for computing the J-orders of the canonical generators of $KO(CP^m)$ and the J-order of any complex line bundle over $CP^m.$
Let $\widetilde{JO}(X)=\widetilde{KO}(X)/TO(X)$ be the J-group of a connected finite CW complex X. We Obtain two computable formulas of $TO(X)_{(p)}$, the localization of $TO(X)$ at a prime p. Then we show how to use these two formulas of $TO(X)_{(p)}$ to find the J-orders of elements of $\widetilde{KO}(CP^m)$, at least the 2 and 3 primary factors of the canonical generators of $\widetilde{JO}(CP^m).$ Here $CP^m$ is the complex projective space.