We construct a locally finite graph and a bounded geometry metric space which do not admit a quasi-isometric embedding into any uniformly convex Banach space. Connections with the geometry of c0 and superreflexivity are discussed. The question of coarse embeddability into uniformly convex Banach spaces became interesting after the recent work of G. Kasparov and G. Yu, who showed the coarse Novi...

Let $M$ be a module over a commutative ring $R$ and let $N$ be a proper submodule of $M$. The total graph of $M$ over $R$ with respect to $N$, denoted by $T(Gamma_{N}(M))$, have been introduced and studied in [2]. In this paper, A generalization of the total graph $T(Gamma_{N}(M))$, denoted by $T(Gamma_{N,I}(M))$ is presented, where $I$ is an ideal of $R$. It is the graph with all elements of $...

Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. Suppose that $phi:S(M)rightarrow S(M)cup lbraceemptysetrbrace$ be a function where $S(M)$ is the set of all submodules of $M$. A proper submodule $N$ of $M$ is called an $(n-1, n)$-$phi$-classical prime submodule, if whenever $r_{1},ldots,r_{n-1}in R$ and $min M$ with $r_{1}ldots r_{n-1}min Nsetminusphi(N)$, then $r_{1...

An enhancement to modular languages called module embedding facilitates the development and utilization of secure generic parallel algorithms.

Endomorphism rings of modules appear as the center of a ring, as the fix ring of a ring with group action or as the subring of constants of a derivation. This note discusses the question whether certain ∗-prime modules have a prime endomorphism ring. Several conditions are presented that guarantee the primeness of the endomorphism ring. The contours of a possible example of a ∗-prime module who...

There is a well-known equivalence between the homotopy types of connected CW-spaces X with πnX=0 for n 6= 1, 2 and the quasi-isomorphism classes of crossed modules ∂ : M → P [16]. When the homotopy groups π1X and π2X are finite one can represent the homotopy type of X by a crossed module in which M and P are finite groups. We define the order of such a crossed module to be |∂| = |M | × |P |, an...

An enhancement to modular languages called module embedding facilitates the development and utilization of secure generic parallel algorithms.

Well-quasi orders in general, and homeomorphic embedding in particular, have gained popularity to ensure online termination of program analysis, specialisation and transformation techniques. It has been recently shown that the homeomorphic embedding relation is strictly more powerful than a large class of involved well-founded approaches. In this paper we provide some additional investigations ...