Related papers: Binding bigraphs as symmetric monoidal closed theo…
First, we extend Leifer-Milner RPO theory, by giving general conditions to obtain IPO labelled transition systems (and bisimilarities) with a reduced set of transitions, and possibly finitely branching. Moreover, we study the weak variant…
A {\em blink} is a plane graph with an arbitrary bipartition of its edges. As a consequence of a recent result of Martelli, I show that the homeomorphisms classes of closed oriented 3-manifolds are in 1-1 correspondence with specific…
This thesis deals with the specification and construction of syntax and operational semantics of a programming language. We work with a general notion of signature for specifying objects of a given category as initial objects in a suitable…
The $\pi$-calculus is used as a model for programming languages. Its contexts exhibit arbitrary concurrency, making them very discriminating. This may prevent validating desirable behavioural equivalences in cases when more disciplined…
The category of open games, which provides a strongly compositional foundation of economic game theory, is intermediate between symmetric monoidal and compact closed. More precisely it has counits with no corresponding units, and a…
Mixed-integer programming (MIP) technology offers a generic way of formulating and solving combinatorial optimization problems. While generally reliable, state-of-the-art MIP solvers base many crucial decisions on hand-crafted heuristics,…
We generalize the classical operad pair theory to a new model for $E_\infty$ ring spaces, which we call ring operad theory, and establish a connection with the classical operad pair theory, allowing the classical multiplicative infinite…
Bimonotone subdivisions in two dimensions are subdivisions all of whose sides are either vertical or have nonnegative slope. They correspond to statistical estimates of probability distributions of strongly positively dependent random…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
We introduce a binary embedding framework, called Proximity Preserving Code (PPC), which learns similarity and dissimilarity between data points to create a compact and affinity-preserving binary code. This code can be used to apply fast…
Cyclomatic complexity is an incompletely specified but mathematically principled software metric that can be usefully applied to both source and binary code. We consider the application of path homology as a stronger analogue of cyclomatic…
Analytic-bilinear approach is used to study continuous and discrete non-isospectral symmetries of the generalized KP hierarchy. It is shown that M\"obius symmetry transformation for the singular manifold equation leads to continuous or…
We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…
Given any category $\mathcal{C}$ with pullbacks and a terminal object, we show that the data consisting of the objects of $\mathcal{C}$, the spans of $\mathcal{C}$, and the isomorphism classes of spans of spans of $\mathcal{C}$, forms a…
Lenses are a mathematical structure for maintaining consistency between a pair of systems. In their ongoing research program, Johnson and Rosebrugh have sought to unify the treatment of symmetric lenses with spans of asymmetric lenses. This…
Finding structural similarities in graph data, like social networks, is a far-ranging task in data mining and knowledge discovery. A (conceptually) simple reduction would be to compute the automorphism group of a graph. However, this…
We show that the category of numerically generated pointed spaces is complete, cocomplete, and monoidally closed with respect to the smash product, and then utilize these features to establish a simple but flexible method for constructing…
The structure space S(M) of a closed topological m-manifold M classifies bundles whose fibers are closed m-manifolds equipped with a homotopy equivalence to M. We construct a highly connected map from S(M) to a concoction of algebraic…
For a Poisson manifold $M$ we develop systematic methods to compute its Picard group $Pic(M)$, i.e., its group of self Morita equivalences. We establish a precise relationship between $Pic(M)$ and the group of gauge transformations up to…
In our article [arXiv:1511.05226], we studied the commutant $\mathcal{C}'\subset \operatorname{Bim}(R)$ of a unitary fusion category $\mathcal{C}$, where $R$ is a hyperfinite factor of type $\rm II_1$, $\rm II_\infty$, or $\rm III_1$, and…