Related papers: Algebraic structure behind Odrzywo{\l}ek's EML ope…
Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…
Complex systems are composed of a large number of simple components connected to each other in the form of a network. It is shown that, for some network configurations, the equivalent dynamic behavior of the system is governed by an…
We call an operator algebra A {\em reversible} if A with reversed multiplication is also an abstract operator algebra (in the modern operator space sense). This class of operator algebras is intimately related to the {\em symmetric operator…
The set of natural integers is fundamental for at least two reasons: it is the free induction algebra over the empty set (and at such allows definitions of maps by primitive recursion) and it is the free monoid over a one-element set, the…
Since its introduction by Loday in 1995 with motivation from algebraic K-theory, dendriform dialgebras have been studied quite extensively with connections to several areas in mathematics and physics. A few more similar structures have been…
An important example of a multi-dimensional integrable system is the anti-self-dual Einstein equations. By studying the symmetries of these equations, a recursion operator is found and the associated hierarchy constructed. Owing to the…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…
We begin by introducing an algebraic structure with three constants and one ternary operation to which we call mobi algebra. This structure has been designed to capture the most relevant properties of the unit interval that are needed in…
The use of machine learning algorithms in finance, medicine, and criminal justice can deeply impact human lives. As a consequence, research into interpretable machine learning has rapidly grown in an attempt to better control and fix…
A theorem of Nekrashevych and Sidki shows the Mealy Automata structures one can place on Z^m are parametrized by a family of matrices (called "1/2-integral") and a choice of residuation vector e in Z^m. While the impact of the chosen matrix…
We consider the notions of the replicators, including the duplicator and triplicator, of a binary operad. As in the closely related notions of di-Var-algebra and tri-Var-algebra in [14], they provide a general operadic definition for the…
We present a complete polymorphic effect inference algorithm for an ML-style language with handlers of not only exceptions, but of any other algebraic effect such as input & output, mutable references and many others. Our main aim is to…
We suggest two explicit descriptions of the Poisson q-W algebras which are Poisson algebras of regular functions on certain algebraic group analogues of the Slodowy transversal slices to adjoint orbits in a complex semisimple Lie algebra g.…
The distribution of a given sequence in the set of all sequences with n ones and m = M - n zeros are found by relating the problem to the partitions of a natural number in m natural summands, taking into account the order. The formulas…
We develop techniques at the interface between differential algebra and model theory to study the following problems of exponential algebraicity: Does a given algebraic differential equation admits an exponentially algebraic solution, that…
We provide a general framework for wall-crossing of equivariant K-theoretic enumerative invariants of appropriate moduli stacks $\mathfrak{M}$, by lifting Joyce's homological universal wall-crossing arXiv:2111.04694 to K-theory and to…
Binary trees are fundamental objects in models of evolutionary biology and population genetics. Here, we discuss some of their combinatorial and structural properties as they depend on the tree class considered. Furthermore, the process by…
Let A be a class of objects, equipped with an integer size such that for all n the number a(n) of objects of size n is finite. We are interested in the case where the generating fucntion sum_n a(n) t^n is rational, or more generally…
A data structure for finite bounded acyclic categories has been built, which is useful to encode and manipulate abstract orientable incidence structure. It can be represented as a directed acyclic multigraph with weighted edges, where the…
We show that each irreducible tensor representation of weight 2 of the rotation group of three-dimensional space in the space of rank 3 covariant tensors gives rise to an associative algebra with unity. We find the algebraic relations that…