Related papers: Exploring the Boundaries of Monad Tensorability on…
The delay monad provides a way to introduce general recursion in type theory. To write programs that use a wide range of computational effects directly in type theory, we need to combine the delay monad with the monads of these effects.…
Monads govern computational side-effects in programming semantics. They can be combined in a ''bottom-up'' way to handle several instances of such effects. Indexed monads and graded monads do this in a modular way. Here, instead, we equip…
Linear extended top-down tree transducers (or synchronous tree-substitution grammars) are popular formal models of tree transformations. The expressive power of compositions of such transducers with and without regular look-ahead is…
A tensor is a multidimensional array of numbers that can be used to store data, encode a computational relation and represent quantum entanglement. In this sense a tensor can be viewed as valuable resource whose transformation can lead to…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
Monadic decomposability is a notion of variable independence, which asks whether a given formula in a first-order theory is expressible as a Boolean combination of monadic predicates in the theory. Recently, Veanes et al. showed the…
Topology in general but also topological objects such as monopoles are a central concept in physics. They are prime examples for the intriguing physics of gauge theories and topological states of matter. Vector monopoles are already…
In this paper, we extend some classes of structured matrices to higher order tensors. We discuss their relationships with positive semi-definite tensors and some other structured tensors. We show that every principal sub-tensor of such a…
Tensors, or multi-linear forms, are important objects in a variety of areas from analytics, to combinatorics, to computational complexity theory. Notions of tensor rank aim to quantify the "complexity" of these forms, and are thus also…
Tensor networks provide succinct representations of quantum many-body states and are an important computational tool for strongly correlated quantum systems. Their expressive and computational power is characterized by an underlying…
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…
This paper extends the univariate Theory of Connections, introduced in (Mortari,2017), to the multivariate case on rectangular domains with detailed attention to the bivariate case. In particular, it generalizes the bivariate Coons surface,…
We describe a general framework for notions of commutativity based on enriched category theory. We extend Eilenberg and Kelly's tensor product for categories enriched over a symmetric monoidal base to a tensor product for categories…
We develop a compositional framework for generalized reversible computing using copy-discard categories and resource theories. We introduce partitioned matrices between partitioned sets as subdistribution matrices which preserve the…
Decompositions of higher-order tensors into sums of simple terms are ubiquitous. We show that in order to verify that two tensors are generated by the same (possibly scaled) terms it is not necessary to compute the individual…
We continue to develop the theory of monads and multitensors. The central result of this paper - the lifting theorem for multitensors - enables us to see the Gray tensor product of 2-categories and the Crans tensor product of Gray…
Given a monad $T$ on $\mathscr{A}$ and a functor $G \colon \mathscr{A} \to \mathscr{B}$, one can construct a monad $G_\#T$ on $\mathscr{B}$ subject to the existence of a certain Kan extension; this is the pushforward of $T$ along $G$. We…
Bilinear maps and their classifying tensor products are well-known in the theory of linear algebra, and their generalization to algebras of commutative monads is a classical result of monad theory. Motivated by constructions needed in…
Invariant tensors play an important role in gauge theories, for example, in dualities of N=1 gauge theories. However, for theories with fields in representations larger than the fundamental, the full set of invariant tensors is often…
We investigate the behavior of extension monads, introduced in the 1990s by the second author, in terms of structure results for infinitely many finitary operations and common constructions in varieties or categories of algebras.…