Related papers: Ideal Databases
There is an extensive recent literature on the graded, non-graded, prime, primitive, maximal ideals of Leavitt path algebras. In this introductory level survey, we will be giving an overview of different types of ideals and the…
In this paper we shall consider the Lie algebra of column-finite infinite matrices indexed by positive integers $\mathbb{N}$, describe the lattice of its ideals for arbitrary field $K$ and study its derivations over any commutative, unital…
We present a framework for studying the concept of independence in a general context covering database theory, algebra and model theory as special cases. We show that well-known axioms and rules of independence for making inferences…
We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…
In this article, we introduce a relation including ideals of an evolution algebra and hereditary subsets of vertices of its associated graph and establish some properties among them. This relation allows us to determine maximal ideals and…
The natural join and the inner union combine in different ways tables of a relational database. Tropashko [18] observed that these two operations are the meet and join in a class of lattices-called the relational lattices- and proposed…
This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…
The natural join and the inner union operations combine relations of a database. Tropashko and Spight [24] realized that these two operations are the meet and join operations in a class of lattices, known by now as the relational lattices.…
In this paper using the connections between some subvarieties of residuated lattices, we investigated some properties of the lattice of ideals in commutative and unitary rings. We give new characterizations for commutative rings $A$ in…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
The relational data model requires a theory of relations in which tuples are not only many-sorted, but can also have indexes that are not necessarily numerical. In this paper we develop such a theory and define operations on relations that…
Ideals are one of the main topics of interest to the study of the order structure of an algebra. Due to their nice properties, ideals have an important role both in lattice theory and semigroup theory. Two natural concepts of ideal can be…
The purpose of this paper is twofold. Firstly, to emphasise that the class of Lie algebras with chain lattices of ideals are elementary blocks in the embedding or decomposition of Lie algebras with finite lattice of ideals. Secondly, to…
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…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
In this paper, we propose an abstract definition of dependent type theories as essentially algebraic theories. One of the main advantages of this definition is its composability: simple theories can be combined into more complex ones, and…
Relational lattice is a formal mathematical model for Relational algebra. It reduces the set of six classic relational algebra operators to two: natural join and inner union. We continue to investigate Relational lattice properties with…
The database community lacks a unified relational query language for subset selection and optimisation queries, limiting both user expression and query optimiser reasoning about such problems. Decades of research (latterly under the rubric…
Radical binomial ideals associated with finite lattices are studied. Gr\"obner basis theory turns out to be an efficient tool in this investigation.