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

Abstract

A pairing on an arbitrary ground set Ω is a triple P:=(U,F,Λ), with U,Λ two sets and F:U×Ω⟶Λ a map. Several properties of pairings arise after considering the Moore set system MP and the abstract simplicial complex NP on Ω, defined by taking the maximum and the minimal elements of the equivalence collections with respect to a specific equivalence relation ≈P, respectively called minimal and maximum partitioners.In the present work we first detect various sufficient conditions allowing us to represent specific subfamilies of abstract simplicial complexes as the family of all the minimal partitioners of some pairing on the same ground set. Next, we classify two suitable subcollections of pairings by using generalized matroidal-like properties of NP. More in detail, we first determine a sufficient condition on P ensuring that the family NP is a closable finitary simplicial complex and call the resulting pairings attractive. On an arbitrary ground set Ω, attractiveness, together with a finiteness condition, implies that the minimal members of the equivalence collections of each X∈MP with respect to ≈P all have the same cardinality. Nevertheless, the converse does not hold, neither in the finite case. To this regard, we find some counterexamples inducing us to introduce the class of quasi-attractive pairings. We carried out a detailed analysis of quasi-attractive pairings: for instance we characterize them from a lattice-theoretic point of view and, on a finite ground set Ω, also in term of exchange properties of suitable set systems.Finally, by taking the adjacence matrix of a simple undirected graph G as a model of pairing, we show that the Petersen graph induces an attractive pairing, while the Erdös' friendship graphs induce a quasi-attractive, but not attractive, one.