Related papers: Algebraic foundations for qualitative calculi and …
In this paper we focus on the structure of the variety of Lie algebras with a finite number of ideals and their graph representations using Hasse diagrams. The large number of necessary conditions on the algebraic structure of this type of…
We characterize completey (give a necessary and suffcient condition using special neat embeddings)for a relation algebra to belong to the amalgamation, strong amalgamation, and superamalgamation base of the class of representable algebras.…
The so-called algebraic approach to the constraint satisfaction problem (CSP) has been a prevalent method of the study of complexity of these problems since early 2000's. The core of this approach is the notion of polymorphisms which…
The concept of causal abstraction got recently popularised to demystify the opaque decision-making processes of machine learning models; in short, a neural network can be abstracted as a higher-level algorithm if there exists a function…
In order to choose a neural network architecture that will be effective for a particular modeling problem, one must understand the limitations imposed by each of the potential options. These limitations are typically described in terms of…
Algebraic neural networks (AlgNNs) are composed of a cascade of layers each one associated to and algebraic signal model, and information is mapped between layers by means of a nonlinearity function. AlgNNs provide a generalization of…
A finite algebra $\bA=\alg{A;\cF}$ is \emph{dualizable} if there exists a discrete topological relational structure $\BA=\alg{A;\cG;\cT}$, compatible with $\cF$, such that the canonical evaluation map $e\_{\bB}\colon \bB\to \Hom(…
Let $\Lambda$ be a finite dimensional algebra over an algebraically closed field. Criteria are given which characterize existence of a fine or coarse moduli space classifying, up to isomorphism, the representations of $\Lambda$ with fixed…
Although traditionally binary visual representations are mainly designed to reduce computational and storage costs in the image retrieval research, this paper argues that binary visual representations can be applied to large scale…
Composition and demonic refinement $\sqsubseteq$ of binary relations are defined by \begin{align*} (x, y)\in (R;S)&\iff \exists z((x, z)\in R\wedge (z, y)\in S) R\sqsubseteq S&\iff (dom(S)\subseteq dom(R) \wedge…
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave)…
In this paper we study some algebraic properties of the rack structure as well as the representation theory of it, following the ideas given by M. Elhamdadi and E. M. Moutuou in \cite{Elhamdadi}. We establish a correspondence between the…
We study the family of functions that are represented by a linear convolutional neural network (LCN). These functions form a semi-algebraic subset of the set of linear maps from input space to output space. In contrast, the families of…
G\"odel's second incompleteness theorem is standardly understood as showing that no sufficiently strong, consistent theory of arithmetic can prove its own consistency, a result typically interpreted against a model-theoretic background in…
The congruence lattices of all algebras defined on a fixed finite set $A$ ordered by inclusion form a finite atomistic lattice $\mathcal E$. We describe the atoms and coatoms. Each meet-irreducible element of $\mathcal E$ being determined…
We initiate the study of computable presentations of real and complex C*-algebras under the program of effective metric structure theory. With the group situation as a model, we develop corresponding notions of recursive presentations and…
An important and long-standing open problem in universal algebra asks whether every finite lattice is isomorphic to the congruence lattice of a finite algebra. Until this problem is resolved, our understanding of finite algebras is…
We consider the following question, concerning associative algebras R over an algebraically closed field k: When can the space of (equivalence classes of) finite dimensional irreducible representations of R be topologically embedded into a…
This paper introduces the notion of calibrated representations for affine Hecke algebras and classifies and constructs all finite dimensional irreducible calibrated representations. The main results are that (1) irreducible calibrated…
To an arbitrary directed graph we associate a row-finite directed graph whose C*-algebra contains the C*-algebra of the original graph as a full corner. This allows us to generalize results for C*-algebras of row-finite graphs to…