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

DOI10.1016/j.aam.2024.102778MaRDI QIDQ6632119

F. Infusino, Cinzia Bisi

Publication date: 4 November 2024

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

zbMATH Keywords

graphsmatroidsreductsattractive pairingsclosable finitary simplicial complexesquasi-attractive pairings

Mathematics Subject Classification ID

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

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The adjacency matroid of a graph
• From clutters to matroids
• Matroidal approaches to rough sets via closure operators
• Transformation and decomposition of clutters into matroids
• Friendship two-graphs
• Clutters and circuits
• Boundary optimization for rough sets
• Quasi-matroidal classes of ordered simplicial complexes
• Nullity-based matroid of rough sets and its application to attribute reduction
• Nesting House-designs
• Rough sets and matroids from a lattice-theoretic viewpoint
• The category of matroids
• New type of coding problem motivated by database theory
• Basis-exchange properties of sparse paving matroids
• 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
• Set relations and set systems induced by some families of integral domains
• The adjacency matrix of a graph as a data table: a geometric perspective
• A characterization of graphic matroids using non-separating cocircuits
• Simplicial complexes and closure systems induced by indistinguishability relations
• Parallel dynamical systems over directed dependency graphs
• Simplicial complexes of graphs
• Functional dependencies distorted by errors
• Prekernels of topologically axiomatized subcategories of concrete categories
• An Algorithm for Determining Whether a Given Binary Matroid is Graphic
• Filter Monads, Continuous Lattices and Closure Systems
• THE LATTICE THEORY OF FUNCTIONAL DEPENDENCIES AND NORMAL DECOMPOSITIONS
• Graphs with the Circuit Cover Property
• Real subset sums and posets with an involution
• Extending bicolorings for Steiner triple systems
• Asymmetric graphs
• Mathematical tools for data mining. Set theory, partial orders, combinatorics
• Combinatorial algebraic topology

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