Related papers: On the linear structure of cones
We prove a variety results on tensor product factorizations of finite dimensional Hopf algebras (more generally Hopf algebras satisfying chain conditions in suitable braided categories). The results are analogs of well-known results on…
Exponential-constructible functions are an extension of the class of constructible functions. This extension was formulated by Cluckers-Loeser in the context of semi-algebraic and sub-analytic structures, when they studied stability under…
We define a symmetric monoidal category modelling fuzzy concepts and fuzzy conceptual reasoning within G\"ardenfors' framework of conceptual (convex) spaces. We propose log-concave functions as models of fuzzy concepts, showing that these…
We introduce a category Prob of probability spaces whose objects are all probability spaces and arrows are corresponding to measurable functions satisfying an absolutely continuous requirement. We can consider a Prob-arrow as an evolving…
In this paper (propositional) probability logic ($PL$) is investigated from model theoretic point of view. First of all, the ultraproduct construction is adapted for $\sigma$-additive probability models, and subsequently when this class of…
We introduce the notion of consistent error bound functions which provides a unifying framework for error bounds for multiple convex sets. This framework goes beyond the classical Lipschitzian and H\"olderian error bounds and includes…
Concurrency and probability are both much studied extensions of sequential computation. Within concurrency theory, there is a broad divide between interleaving models and logics, which model concurrency by non-determinism, and `truly…
For a root system R, a field K and a "choice of coefficients in K" we define a category of graded spaces with operators and study some of its properties. Then we assume that the coefficients are given by quantum binomials. We use basic…
Classical computations can not capture the essence of infinite computations very well. This paper will focus on a class of infinite computations called convergent infinite computations}. A logic for convergent infinite computations is…
We recall P. Balmer's definition of tensor triangular Chow group for a tensor triangulated category $\mathcal{K}$ and explore some of its properties. We give a proof that for a suitably nice scheme $X$ it recovers the usual notion of Chow…
The commutative Hopf monoid of set compositions is a fundamental Hopf monoid internal to vector species, having undecorated bosonic Fock space the combinatorial Hopf algebra of quasisymmetric functions. We construct a geometric realization…
On a smooth projective threefold, we construct an essentially surjective functor $\mathcal{F}$ from a category of two-term complexes to a category of quotients of coherent sheaves, and describe the fibers of this functor. Under a coprime…
This paper begins by noting that, in a 1969 paper in the Transactions, M.C.McCord introduced a construction that can be interpreted as a model for the categorical tensor product of a based space and a topological abelian group. This can be…
Category theory provides a means through which many far-ranging fields of mathematics can be related by their similar structure. In a paper by Robinson [2], this interconnectivity afforded by categorical perspectives allowed for the…
Adjoint logic is a general approach to combining multiple logics with different structural properties, including linear, affine, strict, and (ordinary) intuitionistic logics, where each proposition has an intrinsic mode of truth. It has…
We present an approach to defining Hilbert spaces of functions depending on infinitely many variables or parameters, with emphasis on a weighted tensor product construction based on stable space splittings, The construction has been used in…
We define graded hyper-algebras of vector-valued Siegel modular forms, which allow us to study tensor products of the latter. We also define vector-valued Hecke operators for Siegel modular forms at all places of ${\mathbb Q}$, acting on…
Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus. Later a deep inference system BV was developed with…
One may formulate the dependent product types of Martin-L\"of type theory either in terms of abstraction and application operators like those for the lambda-calculus; or in terms of introduction and elimination rules like those for the…
Parametric models in vector spaces are shown to possess an associated linear map. This linear operator leads directly to reproducing kernel Hilbert spaces and affine- / linear- representations in terms of tensor products. From the…