English
Related papers

Related papers: Lambda-presentable morphisms, injectivity and (wea…

200 papers

We describe a type system for the linear-algebraic $\lambda$-calculus. The type system accounts for the linear-algebraic aspects of this extension of $\lambda$-calculus: it is able to statically describe the linear combinations of terms…

Logic in Computer Science · Computer Science 2017-05-12 Pablo Arrighi , Alejandro Díaz-Caro , Benoît Valiron

We introduce the basic elements of the theory of parametrized $\infty$-categories and functors between them. These notions are defined as suitable fibrations of $\infty$-categories and functors between them. We give as many examples as we…

Algebraic Topology · Mathematics 2016-08-15 Clark Barwick , Emanuele Dotto , Saul Glasman , Denis Nardin , Jay Shah

We introduce type-theoretic algebraic weak factorisation systems and show how they give rise to homotopy-theoretic models of Martin-L\"of type theory. This is done by showing that the comprehension category associated to a type-theoretic…

Category Theory · Mathematics 2022-06-30 Nicola Gambino , Marco Federico Larrea

We prove that for any presentably symmetric monoidal $\infty$-category $\mathcal{V}$, the $\infty$-category $\mathbf{Mod}_\mathcal{V}(\mathbf{Pr}^{\mathrm{L}})^{\mathrm{dbl}}$ of dualizable presentable $\mathcal{V}$-modules and internal…

Category Theory · Mathematics 2024-10-30 Maxime Ramzi

We classify affine varieties with an action of a connected, reductive algebraic group such that the group is isomorphic to an open orbit in the variety. This is accomplished by associating a set of one-parameter subgroups of the group to…

Algebraic Geometry · Mathematics 2010-12-20 David Murphy

For a nice-enough category $\mathcal{C}$, we construct both the morphism category ${\rm H}(\mathcal{C})$ of $\mathcal{C}$ and the category ${\rm mod}\mbox{-}\mathcal{C}$ of all finitely presented contravariant additive functors over…

Representation Theory · Mathematics 2023-08-01 Rasool Hafezi , Hossein Eshraghi

A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating…

Logic in Computer Science · Computer Science 2013-04-01 Antonio Bucciarelli , Alberto Carraro , Antonino Salibra

A crossed product functor is said to be injective if it takes injective morphisms to injective morphisms. In this paper we show that every locally compact group $G$ admits a maximal injective crossed product $A\mapsto A\rtimes_{\inj}G$.…

Operator Algebras · Mathematics 2020-10-07 Alcides Buss , Siegfried Echterhoff , Rufus Willett

We prove some injectivity theorems. Our proof depends on the theory of mixed Hodge structures on cohomology groups with compact support. Our injectivity theorems would play crucial roles in the minimal model theory for higher-dimensional…

Algebraic Geometry · Mathematics 2015-07-06 Osamu Fujino

We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…

Category Theory · Mathematics 2020-10-13 Volodymyr Lyubashenko

Borger's theory of $\Lambda$-spaces imbues algebraic spaces, which include schemes, with an additional structure defined by an extension of the Witt vector functor. Motivated by $\mathbb{F}_1$-geometry, we prove the existence of a weak…

Algebraic Geometry · Mathematics 2025-05-08 Kai Machida

We show that given a rigid C*-tensor category, there is an equivalence of categories between normalized irreducible Q-systems, also known as connected unitary Frobenius algebra objects, and compact connected W*-algebra objects. Although…

Operator Algebras · Mathematics 2017-07-10 Corey Jones , David Penneys

We present a categorical model for intuitionistic linear logic where objects are polynomial diagrams and morphisms are simulation diagrams. The multiplicative structure (tensor product and its adjoint) can be defined in any locally…

Logic in Computer Science · Computer Science 2019-02-20 Pierre Hyvernat

We show that for various natural classes of groups and appropriately defined K- and L-theoretic functors, injectivity or bijectivity of the assembly map follows from the Isomorphism Conjecture being true for acyclic groups lying within that…

K-Theory and Homology · Mathematics 2017-03-07 Crichton Ogle , Shengkui Ye

We study the problem of constructing a contragredient functor on the category of admissible locally analytic representations of a p-adic analytic group G. A naive contragredient does not exist. As a best approximation, we construct an…

Number Theory · Mathematics 2007-05-23 Peter Schneider , Jeremy Teitelbaum

We prove the (2,1)-categorical analogue of the small object argument and give a (2,1)-model structure on the category of small coherent categories, coherent functors and natural isomorphisms. It is induced by a higher dimensional example of…

Category Theory · Mathematics 2022-02-17 Kristóf Kanalas

The present note has three aims. First, to complement the theory of cofibrant generation of algebraic weak factorisation systems (AWFSs) to cover some important examples that are not locally presentable categories. Secondly, to prove that…

Category Theory · Mathematics 2019-01-23 Ignacio Lopez Franco

In this paper we generalize a shift theorem, which plays a key role in studying representations of FI$^m$, the product category of the category of finite sets and injections, and classify finitely generated injective FI$^m$-modules over a…

Representation Theory · Mathematics 2022-07-18 Duo Zeng

This paper develops various foundational results in the locally analytic representation theory of p-adic groups. In particular, we define the functor ``pass to locally analytic vectors'', which attaches to any continuous representation of a…

Representation Theory · Mathematics 2007-05-23 Matthew Emerton

The elementary affine lambda-calculus was introduced as a polyvalent setting for implicit computational complexity, allowing for characterizations of polynomial time and hyperexponential time predicates. But these results rely on type…

Logic in Computer Science · Computer Science 2019-08-15 Lê Thành Dũng Nguyen
‹ Prev 1 4 5 6 7 8 10 Next ›