Simplicial complexes and closure systems induced by indistinguishability relations
From MaRDI portal
Publication:2408539
DOI10.1016/j.crma.2017.09.010zbMath1371.05327OpenAlexW2759887118MaRDI QIDQ2408539
Giampiero Chiaselotti, F. Infusino, Tommaso Gentile
Publication date: 12 October 2017
Published in: Comptes Rendus. Mathématique. Académie des Sciences, Paris (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.crma.2017.09.010
Hypergraphs (05C65) Planar graphs; geometric and topological aspects of graph theory (05C10) Combinatorial aspects of simplicial complexes (05E45)
Related Items
Notions from rough set theory in a generalized dependency relation context ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Locally finite complexes, modules and generalized information systems ⋮ Alexandroff topologies and monoid actions ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ SYMMETRY GEOMETRY BY PAIRINGS ⋮ Pairings and related symmetry notions ⋮ New perspectives of granular computing in relation geometry induced by pairings ⋮ Dependency relations ⋮ Lattice representations with set partitions induced by pairings ⋮ Set relations and set systems induced by some families of integral domains ⋮ Local dissymmetry on graphs and related algebraic structures ⋮ Some classifications of graphs with respect to a set adjacency relation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new discrete dynamical system of signed integer partitions
- Intersection properties of maximal directed cuts in digraphs
- Rectangular groupoids and related structures
- A geometry of approximation. Rough set theory: logic, algebra and topology of conceptual patterns.
- Power contexts and their concept lattices
- A bijective toolkit for signed partitions
- Orthogonal partitions in designed experiments
- Hypergraph families with bounded edge cover or transversal number
- Orderly algorithm to enumerate central groupoids and their graphs
- Nullity-based matroid of rough sets and its application to attribute reduction
- Lower bounds for three algorithms for transversal hypergraph generation
- Cayley graphs as classifiers for data mining: the influence of asymmetries
- Symmetry transformations in indefinite metric spaces. A generalization of Wigner's theorem
- Union-closed families
- Eulerian stratification of polyhedra
- The geometric cone relations for simplicial and cubical complexes
- Directed graphs and combinatorial properties of semigroups
- Parallel and sequential dynamics of two discrete models of signed integer partitions
- Simple graphs in granular computing
- Dominance order on signed integer partitions
- On the connection of hypergraph theory with formal concept analysis and rough set theory
- Orthogonality preserving transformations on indefinite inner product spaces: Generalization of Uhlhorn's version of Wigner's theorem
- On transitive Cayley graphs of groups and semigroups
- An extension principle for closure operators
- A matroidal approach to rough set theory
- Recognizing Helly edge-path-tree graphs and their clique graphs
- On the Galois lattice of bipartite distance hereditary graphs
- The adjacency matrix of a graph as a data table: a geometric perspective
- Generated envelopes
- Dependency structures for decision tables
- The maximum vertex coverage problem on bipartite graphs
- Combinatorics of sequential dynamical systems
- New results related to a conjecture of Manickam and Singhi
- Rough matroids based on relations
- A natural extension of the Young partition lattice
- Improved Approximation of Maximum Vertex Coverage Problem on Bipartite Graphs
- Metric and Symmetric Spaces
- Identifying the Minimal Transversals of a Hypergraph and Related Problems
- A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture
- Euler’s “De Partitio Numerorum”
- Metrization of Symmetric Spaces and Regular Maps
- Asymmetric graphs
- Sequential dynamical systems over words
- Graph homotopy and Graham homotopy
