Related papers: A Compositional Framework for Passive Linear Netwo…
In this paper we describe an approach to construct large extendable collections of vectors in predefined spaces of given dimensions. These collections are useful for neural network latent space configuration and training. For classification…
Variational wave function is proposed to describe electronic properties of an array of one-dimensional conductors coupled by transverse hopping and interaction. For weak or intermediate in-chain interaction the wave function has the…
On contact manifolds we describe a notion of (contact) finite-type for linear partial differential operators satisfying a natural condition on their leading terms. A large class of linear differential operators are of finite-type in this…
We introduce a symmetric monoidal $\infty$-category $\mathrm{GrCob}$ of graph cobordisms between spaces, and use the homology of its morphism spaces to define string operations. Precisely, for an $E_\infty$-ring spectrum $R$ and an oriented…
Given a symplectic manifold M, we consider a category with objects finite ordered families of Lagrangian submanifolds of M (subject to certain additional constraints) and with morphisms Lagrangian cobordisms relating them. We construct a…
We here show that the family of continuous-time linear systems (of prescribed dimensions) can be characterized through the structure of maximal, matrix-convex, cones, closed under inversion. Moreover, this observation unifies three setups:…
In this paper, we introduce a graph structure called linear dependence graph of a finite dimensional vector space over a finite field. Some basic properties of the graph like connectedness, completeness, planarity, clique number, chromatic…
The quantum mechanics of superconducting circuits is derived by starting from a classical Hamiltonian dynamical system describing a dissipationless circuit, usually made of capacitive and inductive elements. However, standard approaches to…
In this paper we describe a model of concurrency together with an algebraic structure reflecting the parallel composition. For the sake of simplicity we restrict to linear concurrent programs i.e. the ones with no loops nor branching. Such…
The relative cell complexes with respect to a generating set of cofibrations are an important class of morphisms in any model structure. In the particular case of the standard (algebraic) model structure on $\textbf{Top}$, we give a new…
A class of parametric functions formed by alternating compositions of multivariate polynomials and rectification style monomial maps is studied (the layer-wise exponents are treated as fixed hyperparameters and are not optimized). For this…
The asynchronous systems are the non-deterministic models of the asynchronous circuits from the digital electrical engineering, where non-determinism is a consequence of the fact that modelling is made in the presence of unknown and…
Predictive coding (PC) networks are a biologically interesting class of neural networks. Their layered hierarchy mimics the reciprocal connectivity pattern observed in the mammalian cortex, and they can be trained using local learning rules…
The data for many useful bidirectional constructions in applied category theory (optics, learners, games, quantum combs) can be expressed in terms of diagrams containing "holes" or "incomplete parts", sometimes known as comb diagrams. We…
We show that every linear optical component can be completely described as a device that converts one set of orthogonal input modes, one by one, to a matching set of orthogonal output modes. This result holds for any linear optical…
We consider the logarithmic negativity and related quantities of time evolution operators. We study free fermion, compact boson, and holographic conformal field theories (CFTs) as well as numerical simulations of random unitary circuits and…
Control theory uses "signal-flow diagrams" to describe processes where real-valued functions of time are added, multiplied by scalars, differentiated and integrated, duplicated and deleted. These diagrams can be seen as string diagrams for…
We extend the category of (super)manifolds and their smooth mappings by introducing a notion of microformal or "thick" morphisms. They are formal canonical relations of a special form, constructed with the help of formal power expansions in…
We introduce a new framework for learning dense correspondence between deformable 3D shapes. Existing learning based approaches model shape correspondence as a labelling problem, where each point of a query shape receives a label…
The symmetric interaction combinators are an equally expressive variant of Lafont's interaction combinators. They are a graph-rewriting model of deterministic computation. We define two notions of observational equivalence for them,…