Related papers: A General Probabilistic Framework in IMALL: A Conc…
Springer resolution of the set of nilpotent elements in a semisimple Lie algebra plays a central role in geometric representation theory. A new structure on this variety has arisen in several representation theoretic constructions, such as…
The category $_{A}\mathbb{S}_{A}$ of bisemimodules over a semialgebra $A,$ with the so called Takahashi's tensor product $-\boxtimes_{A}-,$ is semimonoidal but not monoidal. Although not a unit in $_{A}\mathbb{S}%_{A},$ the base semialgebra…
For an inclusion of the form $\Bbb C\subseteq M_n(\Bbb C)$, where $M_n(\Bbb C)$ is endowed with a state with diagonal weights $\lambda=(\lambda_1, ..., \lambda_n)$, we use Popa's construction, for non-tracial states, to obtain an…
In the first part of this paper, we define two resource aware typing systems for the {\lambda}{\mu}-calculus based on non-idempotent intersection and union types. The non-idempotent approach provides very simple combinatorial…
We study a family of distributors-induced bicategorical models of lambda-calculus, proving that they can be syntactically presented via intersection type systems. We first introduce a class of 2-monads whose algebras are monoidal categories…
For an additive category $\mathbf{P}$ we provide an explict construction of a category $\mathcal{Q}( \mathbf{P} )$ whose objects can be thought of as formally representing $\frac{\mathrm{im}( \gamma )}{\mathrm{im}( \rho ) \cap \mathrm{im}(…
Imprecise probability is concerned with uncertainty about which probability distributions to use. It has applications in robust statistics and machine learning. We look at programming language models for imprecise probability. Our…
Elaborating on our joint work with Abramsky in quant-ph/0402130 we further unravel the linear structure of Hilbert spaces into several constituents. Some prove to be very crucial for particular features of quantum theory while others…
This paper is about a categorical approach to model a very simple Semantically Linear lambda calculus, named Sll-calculus. This is a core calculus underlying the programming language SlPCF. In particular, in this work, we introduce the…
We exhibit a functor from the category OUS of order unit spaces and positive, unit-preserving mappings into the category $\Prob$ of probabilistic models (test spaces with designated state spaces) and morphisms thereof. Restricted to any…
The cluster multipole (CMP) expansion for magnetic structures provides a scheme to systematically generate candidate magnetic structures specifically including noncollinear magnetic configurations adapted to the crystal symmetry of a given…
Let g be a finite-dimensional complex simple Lie algebra. Fix a non-negative integer l, we consider the set of dominant weights {\lambda} of g such that l{\Lambda}_0+{\lambda} is a dominant weight for the corresponding untwisted affine…
A notion of probabilistic lambda-calculus usually comes with a prescribed reduction strategy, typically call-by-name or call-by-value, as the calculus is non-confluent and these strategies yield different results. This is a break with one…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
Modular functors, i.e. consistent systems of projective representations of mapping class groups of surfaces, have been constructed for non-semisimple modular categories already decades ago. Concepts from homological algebra have not been…
Interest in combinatorial interpretations of mathematical entities stems from the convenience of the concrete models they provide. Finding a bijective proof of a seemingly obscure identity can reveal unsuspected significance to it. Finding…
We construct a modular functor which takes its values in the monoidal bicategory of finite categories, left exact functors and natural transformations. The modular functor is defined on bordisms that are 2-framed. Accordingly we do not need…
We show that bounded type implies finite type for a constructible subcategory of the module category of a finitely generated algebra over a field, which is a variant of the first Brauer-Thrall conjecture. A full subcategory is constructible…
We propose a graphical language that accommodates two monoidal structures: a multiplicative one for pairing and an additional one for branching. In this colored PROP, whether wires in parallel are linked through the multiplicative structure…
We develop a denotational semantics of muLL, a version of propositional Linear Logic with least and greatest fixed points extending David Baelde's propositional muMALL with exponentials. Our general categorical setting is based on the…