We present an algorithm that computes the structure of a finite abelian group G from a generating system M . The algorithm executes O(|M | √ |G|) group operations and stores O( √ |G|) group elements.

In many real world problems, data sometimes comes from n agents (n≥2), multipolar information exists. For issues that are associated with uncertainty, this information can not be showed with the values of crisp, fuzzy, intuitionistic or bipolar. Graph is one of the mathematical models widely used in different sciences. Ambiguity in a graph where data depends on the n parameter can not be showed...

following the idea of $l$-fuzzy neighborhood system as introduced byfu-gui shi, and its generalization to $(l,m)$-fuzzy neighborhood system, the relationship between  $(l,m)$-fuzzy topology and $(l,m)$-fuzzy neighborhood system will be further studied. as an application of the obtained results, we will describe the initial structures of $(l,m)$-fuzzy neighborhood subspaces and $(l,m)$-fuzzy top...

Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

In this paper we examine the cardinal structure of inner models that satisfy GCH but do not contain 0. We show, assuming that 0 exists, that such models necessarily contain Mahlo cardinals of high order, but without further assumptions need not contain a cardinal κ which is κ-Mahlo. The principal tools are the Covering Theorem for L and the technique of reverse Easton iteration. Let I denote th...