Zobrazeno 1 - 10
of 7 669
pro vyhledávání: '"math.CT"'
Autor:
Ben-Bassat, Oren, Kremnizer, Kobi
Publikováno v:
Theory and Applications of Categories 39 9 (2023) 207-266
We study several aspects of the study of Ind-Banach modules over Banach rings thereby synthesizing some aspects of homological algebra and functional analysis. This includes a study of nuclear modules and of modules which are flat with respect to the
Externí odkaz:
http://arxiv.org/abs/2002.11608
Publikováno v:
Journal of Algebra. 631:517-557
\emph{Proto-exact categories}, introduced by Dyckerhoff and Kapranov, are a generalization of Quillen exact categories which provide a framework for defining algebraic K-theory and Hall algebras in a \emph{non-additive} setting. This formalism is wel
Autor:
Gratz, Sira, Zvonareva, Alexandra
Publikováno v:
Gratz, S & Zvonareva, A 2023, ' Lattices of t-structures and thick subcategories for discrete cluster categories ', Journal of the London Mathematical Society, pp. 973-1001 . https://doi.org/10.1112/jlms.12705
We classify t-structures and thick subcategories in discrete cluster categories $\mathcal{C}(\mathcal{Z})$ of Dynkin type $A$, and show that the set of all t-structures on $\mathcal{C}(\mathcal{Z})$ is a lattice under inclusion of aisles, with meet g
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 1 (April 1, 2011) lmcs:1177
Higher-order recursion schemes are recursive equations defining new operations from given ones called "terminals". Every such recursion scheme is proved to have a least interpreted semantics in every Scott's model of \lambda-calculus in which the ter
Externí odkaz:
http://arxiv.org/abs/1101.4929
Autor:
Lumsdaine, Peter LeFanu
Publikováno v:
Logical Methods in Computer Science, Volume 6, Issue 3 (September 17, 2010) lmcs:1062
We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster. Precisely, we construct a contractible globular operad of definable compositi
Externí odkaz:
http://arxiv.org/abs/0812.0409
Autor:
Lanari, Edoardo, Scoccola, Luis
Publikováno v:
Algebraic & Geometric Topology. 23:803-832
The homotopy interleaving distance, a distance between persistent spaces, was introduced by Blumberg and Lesnick and shown to be universal, in the sense that it is the largest homotopy-invariant distance for which sublevel-set filtrations of close-by
Publikováno v:
Journal of Algebra. 621:1-40
We present and study the concept of $m$-periodic Gorenstein objects relative to a pair $(\mathcal{A,B})$ of classes of objects in an abelian category, as a generalization of $m$-strongly Gorenstein projective modules over associative rings. We prove
Publikováno v:
Journal of Algebra. 620:452-477
In this article, we introduce the notion of pre-$(n+2)$-angulated categories as higher dimensional analogues of pre-triangulated categories defined by Beligiannis-Reiten. We first show that the idempotent completion of a pre-$(n+2)$-angulated categor
Autor:
Thibault Decoppet
Publikováno v:
Journal of Algebra. 620:89-112
We give a formula for the relative Deligne tensor product of two indecomposable finite semisimple module categories over a pointed braided fusion category over an algebraically closed field.
Minor corrections
Minor corrections
Autor:
Giuseppe Greco, Alessandra Palmigiano
Publikováno v:
ACM Transactions on Computational Logic, 24(2):3570919, 1-56. Association for Computing Machinery (ACM)
Greco, G & Palmigiano, A 2023, ' Linear Logic Properly Displayed ', ACM Transactions on Computational Logic, vol. 24, no. 2, 3570919, pp. 1-56 . https://doi.org/10.1145/3570919
Greco, G & Palmigiano, A 2023, ' Linear Logic Properly Displayed ', ACM Transactions on Computational Logic, vol. 24, no. 2, 3570919, pp. 1-56 . https://doi.org/10.1145/3570919
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut elimination and subformula property. Based on the same design, we introduc