نتایج جستجو برای: weighted bi(co)limits

تعداد نتایج: 100806  

Journal: :ECEASST 2010
Wolfram Kahl

We previously defined collagories essentially as “distributive allegories without zero morphisms”. Collagories are sufficient for accommodating the relation-algebraic approach to graph transformation, and closely correspond to the adhesive categories important for the categorical DPO approach to graph transformation. Heindel and Sobociński have recently characterised the Van-Kampen colimits use...

2008
Tobias Heindel

In adhesive categories, pushouts along monomorphisms are Van Kampen (vk) squares, a special case of a more general notion called vk-diagram. Other examples of vk-diagrams include coproducts in extensive categories and strict initial objects. Extensive and adhesive categories characterise useful exactness properties of, respectively, coproducts and pushouts along monos and have found several app...

2009
Tobias Heindel Pawel Sobocinski

The exactness properties of coproducts in extensive categories and pushouts along monos in adhesive categories have found various applications in theoretical computer science, e.g. in program semantics, data type theory and rewriting. We show that these properties can be understood as a single universal property in the associated bicategory of spans. To this end, we first provide a general noti...

Given a pseudomonad $mathcal{T} $ on a $2$-category $mathfrak{B} $, if a right biadjoint $mathfrak{A}tomathfrak{B} $ has a lifting to the pseudoalgebras $mathfrak{A}tomathsf{Ps}textrm{-}mathcal{T}textrm{-}mathsf{Alg} $ then this lifting is also right biadjoint provided that $mathfrak{A} $ has codescent objects. In this paper, we give  general results on lifting of biadjoints. As a consequence, ...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده مدیریت 1392

data envelopment analysis (dea) is a powerful tool for measuring relative efficiency of organizational units referred to as decision making units (dmus). in most cases dmus have network structures with internal linking activities. traditional dea models, however, consider dmus as black boxes with no regard to their linking activities and therefore do not provide decision makers with the reasons...

2006
Eduardo J. Dubuc

Résumé. Nous définissons la notion de 2-catégorie 2-filtrante et donnons une construction explicite du bicolimite d’un 2-foncteur à valeurs dans les catégories. Une catégorie considérée une 2-catégorie triviale est 2-filtrante si et seulement si c’est une catégorie filtrante, et notre construction conduit à une catégorie équivalente à la catégorie qui s’obtient par la construction usuelle de co...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه فردوسی مشهد - دانشکده علوم 1377

chapter one is devoted to a moderate discussion on preliminaries, according to our requirements. chapter two which is based on our work in (24) is devoted introducting weighted semigroups (s, w), and studying some famous function spaces on them, especially the relations between go (s, w) and other function speces are invesigated. in fact this chapter is a complement to (32). one of the main fea...

Hamid Vaezi Mostafa Hassanlou,

In this paper, we characterize the bonudedness and compactness of weighted composition operators from weighted Bergman spaces to weighted Bloch spaces. Also, we investigate weighted composition operators on weighted Bergman spaces and extend the obtained results in the unit ball of $mathbb{C}^n$.

Journal: :bulletin of the iranian mathematical society 2015
y. x. liang z. h. zhou

we give some sufficient conditions under which the tuple of the adjoint of weighted composition operators $(c_{omega_1,varphi_1}^*‎ , ‎c_{omega_2,varphi_2}^*)$ on the hilbert space $mathcal{h}$ of analytic functions is supercyclic‎.

Journal: :transactions on combinatorics 2016
kannan pattabiraman p. kandan

in this paper, the weighted szeged indices of cartesian product and corona product of twoconnected graphs are obtained. using the results obtained here, the weighted szeged indices ofthe hypercube of dimension n, hamming graph, c4 nanotubes, nanotorus, grid, t− fold bristled,sunlet, fan, wheel, bottleneck graphs and some classes of bridge graphs are computed.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید