Natural realizations of sparsity matroids

@article{Streinu2011NaturalRO,
  title={Natural realizations of sparsity matroids},
  author={Ileana Streinu and Louis Theran},
  journal={ArXiv},
  year={2011},
  volume={abs/0711.3013}
}
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… 
Extended formulations of lower-truncated transversal polymatroids
TLDR
This note interprets results on -lower-truncated transversal polymatroids by the first author in 1983, from the viewpoint of extended formulations, and shows the same bound when and a better bound when k<l.
Problems in generic combinatorial rigidity: sparsity, sliders, and emergence of components
Rigidity theory deals in problems of the following form: given a structure defined by geometric constraints on a set of objects, what information about its geometric behavior is implied by the
Sparse (0, 1) arrays and perfect phylogeny
TLDR
It is reported in the paper that the existence of perfect phylogeny for a partition system is equivalent to some sparsity requirements on its associated (0, 1) array, and a simple algorithm is proposed to construct all minimum displaying trees for a sparse (1, 2) array.
Sparse ( 0 , 1 ) array and perfect phylogeny ∗ 1
TLDR
It is reported in the paper that the existence of perfect phylogeny for a partition system is equivalent to some sparsity requirements on its associated (0, 1) array, and a simple algorithm is proposed to construct all minimum displaying trees for a sparse (1, 2) array.
Extended formulations for sparsity matroids
TLDR
A polynomial-size extended formulation for the base polytope of a k-sparsity matroid using the technique developed by Faenza et al. recently that uses a randomized communication protocol is shown.
Strong Algorithms for the Ordinal Matroid Secretary Problem
TLDR
The main result is the introduction of a technique based on forbidden sets to design algorithms with strong probability-competitive ratios on many matroid classes, and improves upon the guarantees for almost every matroid class considered in the MSP literature.
Generic Rigidity with Forced Symmetry and Sparse Colored Graphs
We review some recent results in the generic rigidity theory of planar frameworks with forced symmetry, giving a uniform treatment to the topic. We also give new combinatorial characterizations of
Ratio-of-Distance Rigidity Theory With Application to Similar Formation Control
TLDR
A ratio-of-distance (RoD) rigidity theory is developed to study when a framework can be uniquely determined by a set of RoD constraints up to similar transformations (translation, rotation, scaling, and reflection).

References

SHOWING 1-10 OF 43 REFERENCES
On decomposing a hypergraph into k connected sub-hypergraphs
Sparse Hypergraphs and Pebble Game Algorithms
A matroid on hypergraphs, with applications in scene analysis and geometry
TLDR
The plane pictures of vertices and faces which lift to sharp three-dimensional scenes with plane faces are characterized, combinatorially, and two generalizations of Laman's theorem on infinitesimally rigid plane frameworks are proved.
Graded Sparse Graphs and Matroids
TLDR
A new family called graded sparse graphs is defined, arising from generically pinned (completely immobilized) bar-and-joint frameworks and it is proved that they also form matroids.
Characterizing Sparse Graphs by Map Decompositions
TLDR
This work characterize graphs which admit a decomposition into edge-disjoint maps after: (1) the addition of {\it any} $\ell$ edges; (2) the additions of some of the edges of these graphs.
Sparsity-certifying Graph Decompositions
TLDR
The authors' colored pebbles generalize and strengthen the previous results of Lee and Streinu and give a new proof of the Tutte-Nash-Williams characterization of arboricity, and present a new decomposition that certifies sparsity based on the (k, ℓ)-pebble game with colors.
Pebble game algorithms and sparse graphs
The rigidity of graphs
We regard a graph G as a set { 1,...,v) together with a nonempty set E of two-element subsets of (1, . . ., v). Letp = (Pi, . . . &) be an element of RIv representing v points in RI. Consider the
Constructive characterizations for packing and covering with trees
Rigidity of multi-graphs. I. Linking rigid bodies in n-space
  • T. Tay
  • Mathematics
    J. Comb. Theory, Ser. B
  • 1984
...
...