Related papers: A general form of relative recursion
An automaton is called reachable if every state is reachable from the initial state. This notion has been generalized coalgebraically in two ways: first, via a universal property on pointed coalgebras, namely, that a reachable coalgebra has…
Expanding upon recent work, a new class of $A$-functions is introduced that can be viewed as an appropriate generalization of the class of regular $A$-functions, the class of structured $A$-functions, and the class of perfect $A$-functions.…
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
We describe a universal factorization for a functor with values in finite-dimensional measured algebras. More precisely we contruct the quantum automorphism group of this functor. This general recontruction result allows us to recapture a…
A class of spherical functions is studied which can be viewed as the matrix generalization of Bessel functions. We derive a recursive structure for these functions. We show that they are only special cases of more general radial functions…
Let $G$ and $\tilde G$ be reductive groups over a local field $F$. Let $\eta : \tilde G \to G$ be a $F$-homomorphism with commutative kernel and commutative cokernel. We investigate the pullbacks of irreducible admissible…
Let $R$ denote a 2-fir. The notions of F-independence and algebraic subsets of R are defined. The decomposition of an algebraic subset into similarity classes gives a simple way of translating the F-independence in terms of dimension of…
In this paper, plane polynomial systems having a singular point attracting all orbits in positive time are classified up to topological equivalence. This is done by assigning a combinatorial invariant to the system (a so-called "feasible…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…
We construct the tensor product for f-algebras, including proving a universal property for it, and investigate how it preserves algebraic properties of the factors.
For a given extension $A \subset E$ of associative algebras we describe and classify up to an isomorphism all $A$-complements of $E$, i.e. all subalgebras $X$ of $E$ such that $E = A + X$ and $A \cap X = \{0\}$. Let $X$ be a given…
Starting from a description of various generalized function algebras based on sequence spaces, we develop the general framework for considering linear problems with singular coefficients or non linear problems. Therefore, we prove…
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…
An abstract mathematical framework is presented in this paper as a unification of several deformed or generalized algebra proposed recently in the context of generalized statistical theories intended to treat certain complex thermodynamic…
Principal Component Analysis (PCA) is a well known procedure to reduce intrinsic complexity of a dataset, essentially through simplifying the covariance structure or the correlation structure. We introduce a novel algebraic, model-based…
In this paper we study Appell polynomials by connecting them to random variables. This probabilistic approach yields, e.g., the mean value property which is fundamental in the sense that many other properties can be derived from it. We also…
We introduce a notion of complexity of diagrams (and in particular of objects and morphisms) in an arbitrary category, as well as a notion of complexity of functors between categories equipped with complexity functions. We discuss several…
The phenomenon of an implicit function which solves a large set of second order partial differential equations obtainable from a variational principle is explicated by the introduction of a class of universal solutions to the equations…
In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…