SearcharxivSearch

arXiv subjects

Jonathan Lorand

Publications and source records attributed to Jonathan Lorand.

8 recordsLinked to original sources

Categorification of Negative Information using Enrichment

In many engineering applications it is useful to reason about "negative information". For example, in planning problems, providing an optimal solution is the same as giving a feasible solution (the "positive" information) together with a proof of the fact that there cannot be feasible solutions better than the one given (the "negative" information). We model negative information by introducing the concept of "norphisms", as opposed to the positive information of morphisms. A "nategory" is a category that has "nom"-sets in addition to hom-sets, and specifies the interaction between norphisms and morphisms. In particular, we have composition rules of the form morphism + norphism $\to$ norphism. Norphisms do not compose by themselves; rather, they use morphisms as catalysts. After providing several applied examples, we connect nategories to enriched category theory. Specifically, we prove that categories enriched in de Paiva's dialectica categories GC, in the case C = Set and equipped with a modified monoidal product, define nategories which satisfy additional regularity properties. This formalizes negative information categorically in a way that makes negative and positive morphisms equal citizens.

math.CT

(Co)isotropic triples and poset representations

We study triples of coisotropic or isotropic subspaces in symplectic vector spaces; in particular, we classify indecomposable structures of this kind. The classification depends on the ground field, which we only assume to be perfect and not of characteristic 2. Our work uses the theory of representations of partially ordered sets with (order reversing) involution; for (co)isotropic triples, the relevant poset is "$2 + 2 + 2$" consisting of three independent ordered pairs, with the involution exchanging the members of each pair. A key feature of the classification is that any indecomposable (co)isotropic triple is either "split" or "non-split". The latter is the case when the poset representation underlying an indecomposable (co)isotropic triple is itself indecomposable. Otherwise, in the "split" case, the underlying representation is decomposable and necessarily the direct sum of a dual pair of indecomposable poset representations; the (co)isotropic triple is a "symplectification". In the course of the paper we develop the framework of "symplectic poset representations", which can be applied to a range of problems of symplectic linear algebra. The classification of linear Hamiltonian vector fields, up to conjugation, is an example; we briefly explain the connection between these and (co)isotropic triples. The framework lends itself equally well to studying poset representations on spaces carrying a non-degenerate symmetric bilinear form; we mainly keep our focus, however, on the symplectic side.

math.SG

Morita Bicategories of Algebras and Duality Involutions

The notion of a weak duality involution on a bicategory was recently introduced by Shulman in [arXiv:1606.05058]. We construct a weak duality involution on the fully dualisable part of $\text{Alg}$, the Morita bicategory of finite-dimensional k-algebras. The 2-category $\text{KV}$ of Kapranov-Voevodsky k-vector spaces may be equipped with a canonical strict duality involution. We show that the pseudofunctor $\text{Rep}: \text{Alg}^{fd} \to \text{KV}$ sending an algebra to its category of finite-dimensional modules may be canonically equipped with the structure of a duality pseudofunctor. Thus $\text{Rep}$ is a strictification in the sense of Shulman's strictification theorem for bicategories with a weak duality involution. Finally, we present a general setting for duality involutions on the Morita bicategory of algebras in a semisimple symmetric finite tensor category.

math.CT

Biochemical Coupling Through Emergent Conservation Laws

Bazhin has analyzed ATP coupling in terms of quasiequilibrium states where fast reactions have reached an approximate steady state while slow reactions have not yet reached equilibrium. After an expository introduction to the relevant aspects of reaction network theory, we review his work and explain the role of emergent conserved quantities in coupling. These are quantities, left unchanged by fast reactions, whose conservation forces exergonic processes such as ATP hydrolysis to drive desired endergonic processes.

q-bio.MN

Decomposition of (co)isotropic relations

We identify thirteen isomorphism classes of indecomposable coisotropic relations between Poisson vector spaces and show that every coisotropic relation between finite-dimensional Poisson vector spaces may be decomposed as a direct sum of multiples of these indecomposables. We also find a list of thirteen invariants, each of which is the dimension of a space constructed from the relation, such that the 13-vector of multiplicities and the 13-vector of invariants are related by an invertible matrix over $\mathbb Z$. It turns out to be simpler to do the analysis above for isotropic relations between presymplectic vector spaces. The coisotropic/Poisson case then follows by a simple duality argument.

math.SG

(Co)isotropic Pairs in Poisson and Presymplectic Vector Spaces

We give two equivalent sets of invariants which classify pairs of coisotropic subspaces of finite-dimensional Poisson vector spaces. For this it is convenient to dualize; we work with pairs of isotropic subspaces of presymplectic vector spaces. We identify ten elementary types which are the building blocks of such pairs, and we write down a matrix, invertible over $\mathbb{Z}$, which takes one 10-tuple of invariants to the other.

math.SG

Classifying Linear Canonical Relations

In this Master's thesis, we consider the problem of classifying, up to conjugation by linear symplectomorphisms, linear canonical relations (lagrangian correspondences) from a finite-dimensional symplectic vector space to itself. We give an elementary introduction to the theory of linear canonical relations and present partial results toward the classification problem. This exposition should be accessible to undergraduate students with a basic familiarity with linear algebra.

math.SG

Coisotropic Pairs

We give two equivalent sets of invariants which classify pairs of coisotropic subspaces of a finite-dimensional symplectic vector space. We identify five elementary types of coisotropic pairs and show that any coisotropic pair decomposes in an appropriate sense as the direct sum of coisotropic pairs of elementary type.

math.SG