Related papers: Matrix Expression of Finite Boolean-type Algebras
There is a Rota-Baxter algebra structure on the field $A=\mathbf{k}((t))$ with $ P$ being the projection map $A=\mathbf{k}[[t]]\oplus t^{-1}\mathbf{k}[t^{-1}]$ onto $ \mathbf{k}[[ t]]$. We study the representation theory and…
We contribute to the knowledge of the quantifier completions and their applications by using the language of doctrines. This algebraic presentation allows us to properly analyse the behaviour of the existential and universal quantifiers. We…
We survey the development and status quo of a subject best described as "generic representation theory of finite dimensional algebras", which started taking shape in the early 1980s. Let $\Lambda$ be a finite dimensional algebra over an…
In this paper, we investigate finite representations of DatalogMTL models. First, we discuss sufficient conditions for detecting programs that have finite models. Then, we study infinite models that eventually become constant and introduce…
The connection between classical model theoretical types (MT-types) and logically-geometrical types (LG-types) introduced by B. Plotkin is considered. It is proved that MT-types of two $n$-tuples in two universal algebras coincide if and…
Disjunctive Linear Arithmetic (DLA) is a major decidable theory that is supported by almost all existing theorem provers. The theory consists of Boolean combinations of predicates of the form $\Sigma_{j=1}^{n}a_j\cdot x_j \le b$, where the…
We investigate final coalgebras in nominal sets. This allows us to define types of infinite data with binding for which all constructions automatically respect alpha equivalence. We give applications to the infinitary lambda calculus.
We introduce Symbolic Alternating Finite Automata (s-AFA) as an expressive, succinct, and decidable model for describing sets of finite sequences over arbitrary alphabets. Boolean operations over s-AFAs have linear complexity, which is in…
Complete Boolean algebras proved to be an important tool in topology and set theory. Two of the most prominent examples are B(kappa), the algebra of Borel sets modulo measure zero ideal in the generalized Cantor space {0,1}^kappa equipped…
We derive the TBA system of equations from the S-matrix describing integrable massive perturbation of the coset $G_l \times G_m / G_{l+m}$ by the field $(1,1,adj)$ for all the infinite series of the simple Lie algebras $G=A,B,C,D$. In the…
We give a survey on the theory of representation-finite and certain minimal representation-infinite algebras.The main goals are the existence of multiplicative bases and of coverings with good properties. Both are attained via…
We prove a general result on presentations of finitely-generated algebras and apply it to obtain nice presentations for some noncommutative algebras arising in the matrix bispectral problem. By "nice presentation" we mean a presentation…
This research addresses a new tool for data analysis known as Topological Data Analysis TDA It underlies an area of Mathematics known as Combinatorial Algebra or more recently Algebraic Topology which through making strong use of…
The idea in the title is to blow up a finite structure, replacing each 'colour or atom' by infinitely many, using blurs to represent the resulting term algebra, but the blurs are not enough to blur the structure of the finite structure in…
We continue the investigation of Boolean-like algebras of dimension n (nBA) having n constants e1,...,en, and an (n+1)-ary operation q (a "generalised if-then-else") that induces a decomposition of the algebra into n factors through the…
Finite families of biorthogonal rational functions and orthogonal polynomials of Racah-type are studied within a unified algebraic framework based on the meta Racah algebra and its finite-dimensional representations. These functions are…
We study rewriting properties of the column presentation of plactic monoid for any semisimple Lie algebra such as termination and confluence. Littelmann described this presentation using L-S paths generators. Thanks to the shapes of…
Alternating parity automata (APAs) provide a robust formalism for modelling infinite behaviours and play a central role in formal verification. Despite their widespread use, the algebraic theory underlying APAs has remained largely…
In this paper we introduce the concept of L-algebras, which can be seen as a generalization of the structure determined by the Eilenberg-Mac lane transformation and Alexander-Whitney diagonal in chain complexes. In this sense, our main…
In this work we will study the universal labeling algebra A(Gamma), a related algebra B(Gamma), and their behavior as invariants of layered graphs. We will introduce the notion of an upper vertex-like basis, which allows us to recover…