Related papers: Alpay Algebra: A Universal Structural Foundation

We classify abelian subgroups of Out(F_n) up to finite index in an algorithmic and computationally friendly way. A process called disintegration is used to canonically decompose a single rotationless element \phi into a composition of…

For locally compact groups G and H let A(G) denote the Fourier algebra of G and B(H) the Fourier-Stieltjes algebra of H. Any continuous piecewise affine map alpha:Y -> G (where Y is an element of the open coset ring of H) induces a…

The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…

On the predual of a von Neumann algebra, we define a differentiable manifold structure and affine connections by embeddings into non-commutative L_p-spaces. Using the geometry of uniformly convex Banach spaces and duality of the L_p and L_q…

Let $\mathfrak{g}(A)$ be the Kac-Moody algebra with respect to a symmetrizable generalized Cartan matrix $A$. We give an explicit presentation of the fix-point Lie subalgebra $\mathfrak{k}(A)$ of $\mathfrak{g}(A)$ with respect to the…

A real seminormed involutive algebra is a real associative algebra ${\mathcal A}$ endowed with an involutive antiautomorphism $*$ and a submultiplicative seminorm $p$ with $p(a^*) =p(a)$ for $a\in {\mathcal A}$. Then ${\mathop{\tt…

Explaining AI systems is fundamental both to the development of high performing models and to the trust placed in them by their users. The Shapley framework for explainability has strength in its general applicability combined with its…

A lifting of a semilattice S is an algebra A such that the semilattice of compact (=finitely generated) congruences of A is isomorphic to S. The aim of this work is to give a categorical theory of partial algebras endowed with a partial…

We say that a unital C*-algrebra A has the approximate positive factorization property (APFP) if every element of A is a norm limit of products of positive elements of A. (There is also a definition for the nonunital case.) T. Quinn has…

Fixed point theorems are one of the many tools used to prove existence and uniqueness of differential equations. When the data involved contains products of distributions, some of these tools may not be useful. Thus rises the necessity to…

Let $\{\phi_s\}_{s\in S}$ be a commutative semigroup of completely positive, contractive, and weak*-continuous linear maps acting on a von Neumann algebra $N$. Assume there exists a semigroup $\{\alpha_s\}_{s\in S}$ of weak*-continuous…

Let $A(G)$ and $B(H)$ be the Fourier and Fourier-Stieltjes algebras of locally compact groups $G$ and $H$, respectively. Ilie and Spronk have shown that continuous piecewise affine maps $\alpha: Y \subseteq H\rightarrow G$ induce completely…

We develop foundational aspects of stability theory in affine logic. On the one hand, we prove appropriate affine versions of many classical results, including definability of types, existence of non-forking extensions, and other…

Recently, Alfakih and Ye [Lin. Algebra Appl. 438:31--36, 2013] proved that if an $r$-dimensional bar framework $(G,p)$ on $n \geq r+2$ nodes in general position in $\R^r$ admits a positive semidefinite stress matrix with rank $n-r-1$, then…

In this paper we give a new foundational, categorical formulation for operations and relations and objects parameterizing them. This generalizes and unifies the theory of operads and all their cousins including but not limited to PROPs,…

Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…

In this work, a functional variant of the polynomial analogue of the classical Gandy's fixed point theorem is obtained. Sufficient conditions have been found to ensure that the complexity of the recursive function does not go beyond the…

The goal of automatic resource bound analysis is to statically infer symbolic bounds on the resource consumption of the evaluation of a program. A longstanding challenge for automatic resource analysis is the inference of bounds that are…

Within the limited scope of this paper, we argue that artificial general intelligence cannot emerge from current neural network paradigms regardless of scale, nor is such an approach healthy for the field at present. Drawing on various…

For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…