Related papers: Information algebra system of soft sets
We recently introduced the notion of an idempotent system. This linear algebraic object is motivated by the structure of an association scheme. There is a type of idempotent system, said to be symmetric. In the present paper we classify up…
Factoring out the spin $1$ subalgebra of a $ W $ algebra leads to a new $ W $ structure which can be seen either as a rational finitely generated $ W $ algebra or as a polynomial non-linear $ W_\infty$ realization.
Despite the wide usage of information as a concept in science, we have yet to develop a clear & concise scientific definition. This paper is aimed at laying the foundations for a new theory concerning the mechanics of information alongside…
computable functions are defined by abstract finite deterministic algorithms on many-sorted algebras. We show that there exist finite universal algebraic specifications that specify uniquely (up to isomorphism) (i) all abstract computable…
We introduce tabular algebras, which are simultaneous generalizations of cellular algebras (in the sense of Graham-Lehrer) and table algebras (in the sense of Arad-Blau). We show that if a tabular algebra is equipped with a certain kind of…
For any discrete time dynamical system with a rational evolution, we define an entropy, which is a global index of complexity for the evolution map. We analyze its basic properties and its relations to the singularities and the…
In this chapter, concepts related to information and computation are reviewed in the context of human computation. A brief introduction to information theory and different types of computation is given. Two examples of human computation…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
Ideals in the ring of power series in three variables can be classified based on algebra structures on their minimal free resolutions. The classification is incomplete in the sense that it remains open which algebra structures actually…
Mathematical educational soft explore, investigating in a dynamical way, some algebraically, geometrically problems, the expected results being used to involve a lot of mathematical results. One such software soft is GeoGebra. The software…
We illustrate some simple ideas that can be used for obtaining a classification of small-dimensional solvable Lie algebras.Using these we obtain the classification of 3 and 4 dimensional solvable Lie algebras (over fields of any…
An equivalence structure is a set with a single binary relation, satisfying sentences stating that the relation is an equivalence relation. A computable structure A is said to be $\Delta^0_\alpha$ categorical if for any computable structure…
In this paper we introduce arrow algebras, simple algebraic structures which induce elementary toposes through the tripos-to-topos construction. This includes localic toposes as well as various realizability toposes, in particular, those…
This paper is mainly a semi-tutorial introduction to elementary algebraic topology and its applications to Ising-type models of statistical physics, using graphical models of linear and group codes. It contains new material on systematic…
In this paper, we observe that semi-structured tabulated text is ubiquitous; understanding them requires not only comprehending the meaning of text fragments, but also implicit relationships between them. We argue that such data can prove…
Maji\cite{maj-13}, firstly proposed neutrosophic soft sets can handle the indeterminate information and inconsistent information which exists commonly in belief systems. In this paper, we have firstly redefined complement, union and…
Despite the popularity of information measures in analysis of probabilistic systems, proper tools for their visualization are not common. This work develops a simple matrix representation of information transfer in sequential systems,…
It is pointed out that affine Lie algebras appear to be the natural mathematical structure underlying the notion of integrability for two-dimensional systems. Their role in the construction and classification of 2D integrable systems is…
The article suggests a description of a system of tables with a set of special lists absorbing a semantics of data and reflects a fullness of data. It shows how their parallel processing can be constructed based on the descriptions. The…
We define a notion of social machine and envisage an algebra that can describe networks of such. To start with, social machines are defined as tuples of input, output, processes, constraints, state, requests and responses; apart from…