• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4
  • Tagged with
  • 4
  • 3
  • 2
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • 1
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
1

Operads, algebras and modules in model categories and motives

Spitzweck, Markus. Unknown Date (has links) (PDF)
University, Diss., 2003--Bonn. / Erscheinungsjahr an der Haupttitelstelle: 2001.
2

Structure of the space of extensions of barcodes / Strukturen hos mängden av utvidgningar av barcodes

Åkesson, Hugo January 2023 (has links)
Motivated by the recent development of noise systems, we try to describe, for fixed persistence modules \(X\) and \(Y\), the set of all persistence modules that are extensions of \(X\) by \(Y\), as well as their sizes. We restrict ourselves to tame persistence modules indexed by nonnegative numbers, and our notion of size is \((p,C)\)-norms, which is a generalization of \(p\)-norms. We prove that when \(X\) is a single bar, there is a monotone bijection between a set of antichains in the barcode of \(Y\) and the mentioned set of all extensions. A corollary is that the antichain consisting of maximal elements corresponds to the extension with maximal norm. Without this assumption on \(X\), we can reuse the previous result to construct a surjection from a set of tuples of antichains to the set of all extensions. We also conjecture that, with regards to this surjection, the tuple consisting of maximal antichains is mapped to the extension with maximal norm. We also provide some experimental justification for this conjecture. / Med anledning av det nyligen utvecklade begreppet noise system, försöker vi, för givna \(X\) och \(Y\), beskriva mängden av alla persistensmoduler som är utvidgningar av \(X\) med \(Y\), liksom deras storlekar. Vi begränsar oss till fallet med tama persistensmoduler, och där vi med storlek avser \((p,C)\)-normen, vilket är en generalisering av \(p\)-normen. I fallet när \(X\) består av en enda bar, konstruerar vi en monoton bijektion mellan en mängd av antikedjor och den nämnda mängden av alla utvidgningar. Ett korollarium är att antikedjan som består av maximala element motsvarar utvidgningen med störst norm. Vi använder sedan den nämnda bijektionen för att i det generella fallet konstruera en surjektion från en mängd av tuplar av antikedjor till mängden av alla utvidgningar. Vi formulerar även ett experimentellt bestyrkt påstående, nämligen att tupeln bestående av maximala antikedjor avbildas på utvidgningen med störst norm, av den nämnda surjektionen.
3

Mezi homogenitou a rigiditou / Between homogeneity and rigidity

Grebík, Jan January 2016 (has links)
Studujeme nespočetné struktury, které splňují exstension property vzhledem k nějaké Fraïssé třídě C. Takovým strukturám říkáme Fraïssé-like struktury. Tyto struktury nejsou většinou jednoznačně určeny. Je známo, že pokud existuje Katětov funktor pro C, pak existují Fraïssé-like struktury libovolné kardinality s bohatou grupou automorfismů. Ukážeme, že v případě třídy všech konečných grafů a všech konečných metrických prostorů existuje Fraïssé-like struktura, která má kardinalitu ℵ1 a její grupa automorfismů je triviální. Dále zodpovíme otázku z W. Kubi's, D. Mašulovi'c, Katětov functors, to appear in Applied Categorical Structures tak, že nalezneme Fraïssé třídu bez Katětova funktoru. 1
4

Algebraická a kripkovská sémantika substrukturálních logik / Algebraic and Kripke semantics of substructural logics

Arazim, Pavel January 2011 (has links)
This thesis is about the distributive full Lambek calculus, i.e., intuicionistic logic without the structural rules of exchange, contraction and weakening and particularly about the two semantics of this logic, one of which is algebraic, the other one is a Kripke semantic. The two semantics are treated in separate chapters and some results about them are shown, for example the disjunction property is proven by amalgamation of Kripke models. The core of this thesis is nevertheless the relation of these two semantics, since it is interesting to study what do they have in common and how can they actually differ, both being a semantics of the same logic. We show how to translate frames to algebras and algebras to frames, and, moreover, we extend such translation to morphisms, thus constructing two functors between the two categories. Key words:distributive FL logic, distributive full Lambek calculus, structural rules, distributive residuated lattice, Kripke frames, frame morphisms, category, functor 2

Page generated in 0.0321 seconds