Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Concurrency, Specification and Programming
Article type: Research Article
Authors: Wolski, Marcin | Gomolińska, Anna
Affiliations: Maria Curie-Skłodowska University, Department of Logic and Philosophy of Science, Pl. Marii Curie-Skłodowskiej 4, 20-031 Lublin, Poland. marcin.wolski@umcs.lublin.pl | Białystok University, Institute of Computer Science, Sosnowa 64, 15-887 Białystok, Poland. anna.gom@math.uwb.edu.pl
Note: [] Address for correspondence: Maria Curie-Skłodowska University, Department of Logic and Philosophy of Science, Pl. Marii Curie-Skłodowskiej 4, 20-031 Lublin, Poland
Abstract: Representation theory is a branch of mathematics whose original purpose was to represent information about abstract algebraic structures by means of methods of linear algebra (usually, by linear transformations and matrices). G.-C. Rota in his famous Foundations defined a representation of a locally finite partially ordered set (locally finite poset) P in terms of a module over a ring $\mathbb{A}$, which can further be extended by the addition of a convolution operation to an associative $\mathbb{A}$-algebra called an incidence algebra of P. He applied this construction to solve a number of important problems in combinatorics. Our goal in this paper is to discuss the concept of an incidence algebra as a representation of a Pawlak information system. We shall analyse both incidence algebras and information systems in the context of granular computing, a paradigm which has recently received a lot of attention in computer science. We discuss therefore the concept of an incidence algebra on two levels: the level of objects which form a preordered set and the level of information granules which form a poset. Since incidence algebras induced on these two levels are Morita equivalent, we may focus our attention on the incidence algebra of information granules. We take the lattice of closed ideals of this algebra, where the maximal elements serve as a representation of information granules. The poset of maximal closed ideals obtained in this way is isomorphic to the set of information granules of the Pawlak information system equipped with a natural information order.
Keywords: Pawlak information system, granular computing, representation theory, incidence algebra
DOI: 10.3233/FI-2013-943
Journal: Fundamenta Informaticae, vol. 128, no. 1-2, pp. 223-238, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl