Natural realizations of sparsity matroids

Details Natural realizations of sparsity matroids Natural realizations of sparsity matroids

2007-11-19

arxiv.org/abs/0711.3013v5

Mathematics

Combinatorics

Corrected some typos from the previous version; to appear in Ars Mathematica Contemporanea

Scientific paper

A hypergraph G with n vertices and m hyperedges with d endpoints each is (k,l)-sparse if for all sub-hypergraphs G' on n' vertices and m' edges, m'\le kn'-l. For integers k and l satisfying 0\le l\le dk-1, this is known to be a linearly representable matroidal family. Motivated by problems in rigidity theory, we give a new linear representation theorem for the (k,l)-sparse hypergraphs that is natural; i.e., the representing matrix captures the vertex-edge incidence structure of the underlying hypergraph G.

Affiliated with

Also associated with

No associations

Rating

Natural realizations of sparsity matroids 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 Natural realizations of sparsity matroids, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Natural realizations of sparsity matroids will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-391360