Combinatorial representations

Details Combinatorial representations Combinatorial representations

2011-09-06

arxiv.org/abs/1109.1216v1

Mathematics

Combinatorics

23pp. Submitted to J. Combinatorial Theory (Series A)

Scientific paper

This paper introduces combinatorial representations, which generalise the notion of linear representations of matroids. We show that any family of subsets of the same cardinality has a combinatorial representation via matrices. We then prove that any graph is representable over all alphabets of size larger than some number depending on the graph. We also provide a characterisation of families representable over a given alphabet. Then, we associate a rank function and a rank operator to any representation which help us determine some criteria for the functions used in a representation. While linearly representable matroids can be viewed as having representations via matrices with only one row, we conclude this paper by an investigation of representations via matrices with only two rows.

Affiliated with

Also associated with

No associations

Rating

Combinatorial representations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Combinatorial representations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Combinatorial representations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-93920