Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners

DOI10.1016/J.AAM.2024.102778MaRDI QIDQ6632119FDOQ6632119

Authors: Cinzia Bisi, F. Infusino 

Publication date: 4 November 2024

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Recommendations

• Matroid representations by partitions
• Minors of simplicial complexes
• Sequential partitions of nonpure simplicial complexes
• Symmetry geometry by pairings
• Fair representation in dimatroids

zbMATH Keywords

graphsreductsmatroidsattractive pairingsclosable finitary simplicial complexesquasi-attractive pairings

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Combinatorial aspects of simplicial complexes (05E45)

Cites Work

• Graph theory
• A characterization of graphic matroids using non-separating cocircuits
• Title not available (Why is that?)
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Title not available (Why is that?)
• Simplicial complexes of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Combinatorial algebraic topology
• Parallel dynamical systems over directed dependency graphs
• Title not available (Why is that?)
• From clutters to matroids
• Asymmetric graphs
• Graphs with the Circuit Cover Property
• Title not available (Why is that?)
• Filter Monads, Continuous Lattices and Closure Systems
• Matroidal approaches to rough sets via closure operators
• The adjacency matroid of a graph
• Matroids. A geometric introduction
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• Rough sets and matroids from a lattice-theoretic viewpoint
• Nullity-based matroid of rough sets and its application to attribute reduction
• Transformation and decomposition of clutters into matroids
• Clutters and circuits
• Friendship two-graphs
• Set relations and set systems induced by some families of integral domains
• Boundary optimization for rough sets
• Quasi-matroidal classes of ordered simplicial complexes
• The adjacency matrix of a graph as a data table: a geometric perspective
• Basis-exchange properties of sparse paving matroids
• Nesting House-designs
• Prekernels of topologically axiomatized subcategories of concrete categories
• Simplicial complexes and closure systems induced by indistinguishability relations
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• The category of matroids
• Extending bicolorings for Steiner triple systems
• New type of coding problem motivated by database theory
• New perspectives of granular computing in relation geometry induced by pairings
• Solution to the predecessors and gardens-of-Eden problems for synchronous systems over directed graphs
• Alexandroff topologies and monoid actions
• Some classes of abstract simplicial complexes motivated by module theory
• Lattice representations with set partitions induced by pairings
• Functional dependencies distorted by errors
• Real subset sums and posets with an involution

Cited In (1)

• Categorical interpretations of cryptomorphisms and maps arising from matroidal and combinatorial contexts

This page was built for publication: Representation theorems for simplicial complexes and matroidal-like properties of minimal partitioners

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6632119)