Related papers: Linear lambda terms as invariants of rooted trival…
In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…
Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We obtain a classification of $1$-connected $2$-stratifolds in terms of their associated labeled graphs…
The variety of bicommutative algebras consists of all nonassociative algebras satisfying the polynomial identities of right- and left-commutativity $(x_1x_2)x_3=(x_1x_3)x_2$ and $x_1(x_2x_3)=x_2(x_1x_3)$. Let $F_d$ be the free $d$-generated…
The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…
Diagrams enable the use of various algebraic and geometric tools for analysing and classifying knots. In this paper we introduce a new diagrammatic representation of triply periodic entangled structures (TP tangles), which are embeddings of…
This paper provides some technical results needed in "Formalism for Relative Gromov-Witten Invariants." We study line-bundles on the moduli stacks of relative stable and rubber maps that are used to define relative Gromov-Witten invariants…
Invariants of the coadjoint representation of two classes of Lie algebras are calculated. The first class consists of the nilpotent Lie algebras $T(M)$, isomorphic to the algebras of upper triangular $M\times M$ matrices. The Lie algebra…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
In this article, we construct countably many mutually non-isotopic diffeomorphisms of some closed non simply-connected 4-manifolds that are homotopic to but not isotopic to the identity, by surgery along $\Theta$-graphs. As corollaries of…
We propose a categorial grammar based on classical multiplicative linear logic. This can be seen as an extension of abstract categorial grammars (ACG) and is at least as expressive. However, constituents of {\it linear logic grammars (LLG)}…
For any Legendrian link in $\displaystyle \mathbb{R}^{3}$ given by the rainbow closure of a positive braid word, we develop an explicit and computable description of a Legendrian isotopy invariant associated with it, namely the…
Colored tensor models (CTM) is a random geometrical approach to quantum gravity. We scrutinize the structure of the connected correlation functions of general CTM-interactions and organize them by boundaries of Feynman graphs. For rank-$D$…
Lusztig used the symbol invariant to describe the Springer correspondence for classical groups. Similarly, the fingerprint invariant can describe the Kazhdan-Lusztig map. Both invariants pertain to rigid semisimple operators labeled by…
We study polymorphic type assignment systems for untyped lambda-calculi with effects, based on Moggi's monadic approach. Moving from the abstract definition of monads, we introduce a version of the call-by-value computational…
By identifying each standard flag with a trivalent Feynman diagram, the corresponding propagators can be read directly from the flag itself. Within the flag representation, the kinematic Jacobi identity (equivalently, the residue theorem on…
Given a bicovariant differential calculus $(\mathcal{E}, d)$ such that the braiding map is diagonalisable in a certain sense, the bimodule of two-tensors admits a direct sum decomposition into symmetric and anti-symmetric tensors. This is…
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…
String diagrams are a powerful tool for reasoning about composite structures in symmetric monoidal categories. By representing string diagrams as graphs, equational reasoning can be done automatically by double-pushout rewriting. !-graphs…
We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual…
The notion of homomorphism indistinguishability offers a combinatorial framework for characterizing equivalence relations of graphs, in particular equivalences in counting logics within finite model theory. That is, for certain graph…