The notion of $\Gamma$-semigroups has been introduced by Sen and Saha in 1986. This author the concept with apartness analyzed
 their properties within Bishop's constructive orientation. Many classical notions processes semigroups have extended to apartness. Co-ordered studied also. In this paper, as a continuation previous research, investigates specificity two forms first isomorphism the...

We give the geometric version of a construction Colmez-Niziol which establishes comparison theorem between arithmetic p-adic nearby cycles and syntomic sheaves. The local period isomorphism uses $(\phi,\Gamma)$-modules theory is obtained by reducing to cohomologies Lie algebras. By applying method "more general coordinates" used Bhatt-Morrow-Scholze, we construct global isomorphism. In particul...

Introduction-The question whether an isomorphism test for two graphs may be found, which is polynomial in the number of vertices, , n stands open for quite a while now. The purpose of the present article is to answer this question affirmatively by presenting an algorithm which decides whether two graphs are isomorphic or not and showing that the number of n independent elementary operations nee...

The classical Morita Theorem for rings established the equivalence of three statements, involving categorical equivalences, isomorphisms between corners finite matrix rings, and bimodule homomorphisms. A fourth equivalent statement (established later) involves an isomorphism infinite rings. In our main result, we establish analogous statements graded homomorphisms,

Abstract Let be a regular local ring and non‐zero element of . A theorem due to Knörrer states that there are finitely many isomorphism classes maximal Cohen–Macaulay (CM) ‐modules if only the same is true for double branched cover , is, hypersurface which defined by in We consider an analogue this statement case instead In particular, we show hypersurface, refer as ‐fold has finite CM represen...

Let K be a family of structures, closed under isomorphism, in a fixed computable language. We consider e↵ective lists of structures from K such that every structure in K is isomorphic to exactly one structure on the list. Such a list is called a computable classification of K, up to isomorphism. Using the technique of Friedberg enumeration, we show that there is a computable classification of t...