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

DOI10.1016/J.AAM.2024.102778MaRDI QIDQ6632119zbMATH OpenFDO

Authors Cinzia Bisi, F. Infusino

Publication date 4 November 2024

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

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)

Recommendations

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

Cites work

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

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)