نتایج جستجو برای: resolution of morphisms
تعداد نتایج: 21183700 فیلتر نتایج به سال:
We consider words coding exchange of three intervals with permutation (3,2,1), here called 3iet words. Recently, a characterization of substitution invariant 3iet words was provided. We study the opposite question: what are the morphisms fixing a 3iet word? We reveal a narrow connection of such morphisms and morphisms fixing Sturmian words using the new notion of amicability.
in this paper, we formalize the menger probabilistic normed space as a category in which its objects are the menger probabilistic normed spaces and its morphisms are fuzzy continuous operators. then, we show that the category of probabilistic normed spaces is isomorphicly a subcategory of the category of topological vector spaces. so, we can easily apply the results of topological vector spaces...
Institutions were introduced by Goguen and Burstall 8, 9, 10, 11] to formally capture the notion of logical system. Interpreting institutions as functors, and morphisms and representations of institutions as natural transformations, we give elegant proofs for the completeness of the categories of institutions with morphisms and representations, respectively, show that the duality between morphi...
We describe the moduli spaces of morphisms between polarized complex abelian varieties. The discrete invariants, derived from a Poincaré decomposition of morphisms, are the types of polarizations and of lattice homomorphisms occurring in the decomposition. For a given type of morphisms the moduli variety is irreducible, and is obtained from a product of Siegel spaces modulo the action of a disc...
A new relation between morphisms in a category is introduced – roughly speaking (accurately in the categories Set and Top), f ‖ g iff morphisms w : dom(f) → dom(g) never map subobjects of fibres of f non-constantly to fibres of g. (In the algebraic setting replace fibre with kernel.) This relation and a slight weakening of it are used to define “connectedness” versus “disconnectedness” for morp...
We prove formal GAGA for good moduli space morphisms under an assumption of “enough vector bundles” (which holds for instance for quotient stacks). This supports the philosophy that though they are non-separated, good moduli space morphisms largely behave like proper morphisms.
The subword complexity of an infinite word counts the number of subwords of a given length, while the abelian complexity counts this number up to letter permutation. Although a lot of research has been done on the subword complexity of morphic words, i.e., words obtained as fixed points of iterated morphisms, little is known on their abelian complexity. In this paper, we undertake the classific...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید