Related papers: Extended Connectors: Structuring Glue Operators in…
In this paper, we develop the mathematical formulation of metric string structures. These play a crucial role in the formulation of certain six-dimensional superconformal field theories and we believe that they also underlie potential…
We analyze various consequences in relation to the extension of operators $T:X\to Y$ that are $p$-compact, as well as the extension of operators $T:X\to Y$ whose adjoints $T^*:Y^*\to X^*$ are $p$-compact. In most cases, we discuss these…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
In interactive theorem provers (ITPs), extensible syntax is not only crucial to lower the cognitive burden of manipulating complex mathematical objects, but plays a critical role in developing reusable abstractions in libraries. Most ITPs…
In a previous paper, we presented several extensions of ACP with conditional expressions, including one with a retrospection operator on conditions to allow for looking back on conditions under which preceding actions have been performed.…
Probabilistic argumentation is an alternative to causal modeling with Bayesian networks. Probabilistic argumentation structures (PAS) are defined on families of compatible frames (f.c.f). This is a generalization of the usual multivariate…
Fixpoint operators are tools to reason on recursive programs and data types obtained by induction (e.g. lists, trees) or coinduction (e.g. streams). They were given a categorical treatment with the notion of categories with fixpoints. A…
We present a general framework in the setting of difference ring extensions that enables one to find improved representations of indefinite nested sums such that the arising denominators within the summands have reduced degrees. The…
In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust trees overlay. Our key result can be stated as follows. Consider a…
In this paper, we address the representation of coordinate constructions in Enhanced Universal Dependencies (UD), where relevant dependency links are propagated from conjunction heads to other conjuncts. English treebanks for enhanced UD…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
Biological networks are customarily described as structurally robust. This means that they often function extremely well under large forms of perturbations affecting both the concentrations and the kinetic parameters. In order to explain…
The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since…
Interaction nets are a graphical formalism inspired by Linear Logic proof-nets often used for studying higher order rewriting e.g. \Beta-reduction. Traditional presentations of interaction nets are based on graph theory and rely on…
This dissertation investigates integer linear programming (ILP) formulation of Bayesian Network structure learning problem. We review the definition and key properties of Bayesian network and explain score metrics used to measure how well…
We introduce the notion of implicative algebra, a simple algebraic structure intended to factorize the model constructions underlying forcing and realizability (both in intuitionistic and classical logic). The salient feature of this…
We study the problem of modeling a binary operation that satisfies some algebraic requirements. We first construct a neural network architecture for Abelian group operations and derive a universal approximation property. Then, we extend it…
We generalise gauge theory on a graph so that the gauge group becomes a finite-dimensional ribbon Hopf algebra, the graph becomes a ribbon graph, and gauge-theoretic concepts such as connections, gauge transformations and observables are…
In [H5] (q-alg/9512024) and [H7] (q-alg/9704008), the author introduced the notion of intertwining operator algebra, a nonmeromorphic generalization of the notion of vertex operator algebra involving monodromies. The problem of constructing…
Algebra extensions A < B where A is a left B-module such that the B-action extends the multiplication in A are ubiquitous. We encounter examples of such extensions in the study of group actions, group gradings or more general Hopf actions…