Related papers: An Isbell Duality Theorem for Type Refinement Syst…
The humble $\dagger$ ("dagger") is used to denote two different operations in category theory: Taking the adjoint of a morphism (in dagger categories) and finding the least fixed point of a functional (in categories enriched in domains).…
A transformation on homogeneous polynomials is proposed, which is further applied to parametric Feynman integrals. The two representations related through this transformation are dual to each other. It naturally leads to dualities of Landau…
In this article, I introduce a group-theoretical method to prove positivity of certain linear combinations (with coefficients generally lying in $\mathbb{C}$) of exponential functions under a set of semidefinite linear constraints. The…
A choice of optimization objective is immensely pivotal in the design of a recommender system as it affects the general modeling process of a user's intent from previous interactions. Existing approaches mainly adhere to three categories of…
We study sheaves in the context of a duality theory for lattice structure endowed with extra operations, and in the context of forcing in a topos. Using Sheaf duality theory of Comer for cylindric algebras, we give a representation theorem…
We describe a noncommutative deformation theory for presheaves and sheaves of modules that generalizes the commutative deformation theory of these global algebraic structures, and the noncommutative deformation theory of modules over…
We introduce coefficient systems of pro-\'etale motives and pro-\'etale motivic spectra with coefficients in any condensed ring spectrum and show that they afford the six operations. Over locally \'etale bounded schemes, \'etale motivic…
We present a domain-specific type theory for constructions and proofs in category theory. The type theory axiomatizes notions of category, functor, profunctor and a generalized form of natural transformations. The type theory imposes an…
We introduce a theory of modules over a representation of a small category taking values in entwining structures over a semiperfect coalgebra. This takes forward the aim of developing categories of entwined modules to the same extent as…
Deep learning, despite its remarkable achievements, is still a young field. Like the early stages of many scientific disciplines, it is marked by the discovery of new phenomena, ad-hoc design decisions, and the lack of a uniform and…
We develop and investigate a general theory of representations of second-order functionals, based on a notion of a right comodule for a monad on the category of containers. We show how the notion of comodule representability naturally…
We collect in one place a variety of known and folklore results in enriched model category theory and add a few new twists. The central theme is a general procedure for constructing a Quillen adjunction, often a Quillen equivalence, between…
We study representations of the double affine Lie algebra associated to a simple Lie algebra. We construct a family of indecomposable integrable representations and identify their irreducible quotients. We also give a condition for the…
This paper presents a sequent calculus and a dual domain semantics for a theory of definite descriptions in which these expressions are formalised in the context of complete sentences by a binary quantifier $I$. $I$ forms a formula from two…
We give a natural-deduction-style type theory for symmetric monoidal categories whose judgmental structure directly represents morphisms with tensor products in their codomain as well as their domain. The syntax is inspired by Sweedler…
We present new induction principles for the syntax of dependent type theories, which we call relative induction principles. The result of the induction principle relative to a functor F into the syntax is stable over the codomain of F. We…
Any modality in homotopy type theory gives rise to an orthogonal factorization system of which the left class is stable under pullbacks. We show that there is a second orthogonal factorization system associated to any modality, of which the…
The goal of this paper is to generalize several basic results from the theory of $\cal{D}$-modules to the representation theory of rational Cherednik algebras. We relate characterizations of holonomic modules in terms of singular support…
When writing a constraint program, we have to choose which variables should be the decision variables, and how to represent the constraints on these variables. In many cases, there is considerable choice for the decision variables.…
Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…