Lattice representations with set partitions induced by pairings
In the paper, quadruples $W= (F, U, \Omega, \Lambda)$ are considered usually refered to as (among others) information systems [\textit{Z. Pawlak}, Rough sets. Theoretical aspects of reasoning about data. Dordrecht: Kluwer Academic Publishers Group (1991; Zbl 0758.68054)] or relational data tables [\textit{D. A. Simovici} and \textit{C. Djeraba}, Mathematical tools for data mining. Set theory, partial orders, combinatorics. 2nd ed. London: Springer (2014; Zbl 1303.68006)]. In this structure, $U$, $\Omega$ and $\Lambda$ are finite non-empty sets and $F$ is a mapping (pairing) from the Cartesian product of $U$ and $\Omega$ to $\Lambda$. $W$ can be regarded as a table indexed by $U$ and $\Omega$ with entries $F(u, a)$. The study reveals some linkages among granular computing (GrC), closure systems and algebraic order theory. The authors use some algebraic granular computing techniques on these quadruples in order to provide two lattice representations with set partitions induced by pairings. The study is self-contained by providing required prerequisites on lattices, closures, families of subsets and pairings. Some illustrative material is also included.
- A matroidal approach to rough set theory
- A new discrete dynamical system of signed integer partitions
- Algebraic structures on graphs
- Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
- Bifinite Chu spaces
- Boundary optimization for rough sets
- Closure operators and projections on involution posets
- Dependency and accuracy measures for directed graphs
- Dependency structures for decision tables
- Extending bicolorings for Steiner triple systems
- Granular computing. An emerging paradigm
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 1043733 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 1748431 (Why is no real title available?)
- scientific article; zbMATH DE number 4195958 (Why is no real title available?)
- scientific article; zbMATH DE number 3245483 (Why is no real title available?)
- Local dissymmetry on graphs and related algebraic structures
- Mathematical tools for data mining. Set theory, partial orders, combinatorics
- Matroidal approaches to rough sets via closure operators
- Nesting House-designs
- New rough approximations for \(n\)-cycles and \(n\)-paths
- Notions from rough set theory in a generalized dependency relation context
- On closed invariant sets in local dynamics
- On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
- On the Antitone Mappings of a Poset
- Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
- Rough sets and matroids from a lattice-theoretic viewpoint
- Simplicial complexes and closure systems induced by indistinguishability relations
- Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
- Symmetric differences on posets with an antitone involution
- The adjacency matrix of a graph as a data table: a geometric perspective
- The granular partition lattice of an information table
- The involutory dimension of involution posets
- Two representations of finite ordered sets
- Pairings and related symmetry notions
- Granular computing on information tables: families of subsets and operators
- The granular partition lattice of an information table
- Embedding coproducts of partition lattices
- scientific article; zbMATH DE number 802723 (Why is no real title available?)
- Real subset sums and posets with an involution
- Rough action on topological rough groups
- A binary operation-based representation of a lattice.
- Some classifications of graphs with respect to a set adjacency relation
- Granular computing on basic digraphs
- On a quotient \(S\)-set induced by countably infinite decreasing chains
- Categorification of a set relation geometry induced by rough operators
- On some categories of structured sets
- Outlier detection in a multiset-valued information system based on rough set theory and granular computing
- Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners
- Algebraic and order properties of maps and structures related to dependence relations arising in topology, algebra and rough set theory
This page was built for publication: Lattice representations with set partitions induced by pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2290345)
