Related papers: Combinatorics and algebra of tensor calculus
Functor coalgebras capture a wide range of transition systems that must however evolve in discrete steps. We introduce graded coalgebras of graded monads and propose them to model continuous-time transition systems. We develop the theory of…
Graded modal logics generalise standard modal logics via families of modalities indexed by an algebraic structure whose operations mediate between the different modalities. The graded "of-course" modality $!_r$ captures how many times a…
The structure of the category of matroids and strong maps is investigated: it has coproducts and equalizers, but not products or coequalizers; there are functors from the categories of graphs and vector spaces, the latter being faithful;…
An operad describes a category of algebras and a (co)homology theory for these algebras may be formulated using the homological algebra of operads. A morphism of operads $f:\mathcal{O}\rightarrow\mathcal{P}$ describes a functor allowing a…
We investigate the extent to which the weak equivalences in a model category can be equipped with algebraic structure. We prove, for instance, that there exists a monad T such that a morphism of topological spaces admits T-algebra structure…
We propose a new numerical algorithm for computing the tensor rank decomposition or canonical polyadic decomposition of higher-order tensors subject to a rank and genericity constraint. Reformulating this computational problem as a system…
In this paper we consider a special class of polymorphisms with invariant measure, - (cf.[1])- the algebraic polymorphisms of compact groups. A general polymorphism is -- by definition -- a many-valued map with invariant measure, and the…
We present a categorical viewpoint of probability measures by showing that a probability measure can be viewed as a weakly averaging affine measurable functional taking values in the unit interval which preserves limits. The probability…
Algebra and representation theory in modular tensor categories can be combined with tools from topological field theory to obtain a deeper understanding of rational conformal field theories in two dimensions: It allows us to establish the…
We give combinatorial formulas for F-polynomials in cluster algebras of classical types in terms of the weighted paths in certain directed graphs. As a consequence we prove the positivity of F-polynomials in cluster algebras of classical…
To any nodal curve $C$ is associated the degree class group, a combinatorial invariant which plays an important role in the compactification of the generalised Jacobian of $C$ and in the construction of the N\'eron model of the Picard…
It is well-known that the category of Kleisli algebras for a monoidal monad carries a canonical monoidal structure. We define the notion of a commutative graded monad and present a strictly two-categorical proof that Kleisli algebras for…
In the paper I considered algebra of polynomials over associative D-algebra with unit. Using the tensor notation allows to simplify the representation of polynomial. I considered questions related to divisibility of polynomial of any power…
It is known that the notion of graded differential algebra coincides with the notion of monoid in the monoidal category of complexes. By using the monoidal structure introduced by M. Kapranov for the category of $N$-complexes we define the…
Inspired by recent work of Batanin and Berger on the homotopy theory of operads, a general monad-theoretic context for speaking about structures within structures is presented, and the problem of constructing the universal ambient structure…
This paper presents a many-sorted polyadic modal logic that generalizes some of the existing approaches. The algebraic semantics has led us to a many-sorted generalization of boolean algebras with operators, for which we prove the analogue…
In this paper we develop a functional calculus for a countable system of generators of contraction strongly continuous semigroups. As a symbol class of such calculus we use the algebra of polynomial tempered distributions. We prove a…
Monads are a useful tool for structuring effectful features of computation such as state, non-determinism, and continuations. In the last decade, several generalisations of monads have been suggested which provide a more fine-grained model…
The paper surveys some new results and open problems connected with such fundamental combinatorial concepts as polytopes, simplicial complexes, cubical complexes, and subspace arrangements. Particular attention is paid to the case of…
Starting from a biased definition of a properad, we describe explicitly algebras over the cobar construction of a properad. Equivalent description in terms of solutions of generalized master equations, which can be interpreted as…