Lattice representations with set partitions induced by pairings

DOI10.37236/8786zbMath1454.06001OpenAlexW3002213091MaRDI QIDQ2290345

Giampiero Chiaselotti, F. Infusino, Tommaso Gentile

Publication date: 27 January 2020

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i1p19

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07) Reasoning under uncertainty in the context of artificial intelligence (68T37)

Related Items (8)

Real subset sums and posets with an involution ⋮ 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 ⋮ Unnamed Item ⋮ Some classifications of graphs with respect to a set adjacency relation ⋮ Granular computing on basic digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new discrete dynamical system of signed integer partitions
• Matroidal approaches to rough sets via closure operators
• New rough approximations for \(n\)-cycles and \(n\)-paths
• Boundary optimization for rough sets
• Symmetric differences on posets with an antitone involution
• Nesting House-designs
• Algebraic structures on graphs
• Notions from rough set theory in a generalized dependency relation context
• Rough sets and matroids from a lattice-theoretic viewpoint
• Predecessors and Garden-of-Eden configurations in parallel dynamical systems on maxterm and minterm Boolean functions
• A matroidal approach to rough set theory
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• The granular partition lattice of an information table
• The adjacency matrix of a graph as a data table: a geometric perspective
• Simplicial complexes and closure systems induced by indistinguishability relations
• Dependency structures for decision tables
• Dependency and accuracy measures for directed graphs
• On commuting polynomial automorphisms of \({\mathbb{C}}^{k}\), \(k \geq 3\)
• On closed invariant sets in local dynamics
• Closure operators and projections on involution posets
• Applications of Bipartite Graphs and their Adjacency Matrices to Covering-based Rough Sets
• Bifinite Chu Spaces
• Local dissymmetry on graphs and related algebraic structures
• Extending bicolorings for Steiner triple systems
• On the Antitone Mappings of a Poset
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• Granular computing. An emerging paradigm
• The involutory dimension of involution posets

This page was built for publication: Lattice representations with set partitions induced by pairings