نتایج جستجو برای: morphism
تعداد نتایج: 2326 فیلتر نتایج به سال:
1 Affine Morphisms Definition 1. Let f : X −→ Y be a morphism of schemes. Then we say f is an affine morphism or that X is affine over Y , if there is a nonempty open cover {Vα}α∈Λ of Y by open affine subsets Vα such that for every α, fVα is also affine. If X is empty (in particular if Y is empty) then f is affine. Any morphism of affine schemes is affine. Any isomorphism is affine, and the aff...
We define a morphism based upon a Latin square that generalizes the Thue-Morse morphism. We prove that fixed points of this morphism are overlap-free sequences, generalizing results of Allouche Shallit and Frid.
Model verification is to check the correctness of the model implementation comparing with a model specification. The specification is modeling and description properties of a real system. The implementation is the ready to simulation model described from model specification. Our proposed frame work is system morphism based approach, which has various levels of morphism depending on system descr...
Definition 1. Let A be a ring. A graded A-algebra is an A-algebra R which is also a graded ring in such a way that if r ∈ Rd then ar ∈ Rd for all a ∈ A. That is, Rd is an A-submodule of R for all d ≥ 0. Equivalently a graded A-algebra is a morphism of graded rings A −→ R where we grade A by setting A0 = A,An = 0 for n > 0. A morphism of graded A-algebras is a morphism of A-algebras which preser...
The orientation morphism $Or(\cdot)(P)\colon \gamma\mapsto\dot{P}$ associates differential-polynomial flows $\dot{P}=Q(P)$ on spaces of bi-vectors $P$ finite-dimensional affine manifolds $N^d$ with (sums of) finite unoriented graphs $\gamma$ ordered sets edges and without multiple one-cycles. It is known that $d$-cocycles $\boldsymbol{\gamma}\in\ker d$ respect to the vertex-expanding differenti...
This paper examines the concept of simulation from a modelling viewpoint. How can one Mealy machine simulate the other one? We create formalism for simulation of Mealy machines. The injective s–morphism of the machine semigroups induces the simulation of machines [1]. We present the example of s–morphism such that it is not a homomorphism of semigroups. The story for the surjective s–morphisms ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید