Discrete Mathematics and Combinatorics Commons^™

Intersection Cohomology Of Rank One Local Systems For Arrangement Schubert Varieties, Shuo Lin

Doctoral Dissertations

In this thesis we study the intersection cohomology of arrangement Schubert varieties with coefficients in a rank one local system on a hyperplane arrangement complement. We prove that the intersection cohomology can be computed recursively in terms of certain polynomials, if a local system has only $\pm 1$ monodromies. In the case where the hyperplane arrangement is generic central or equivalently the associated matroid is uniform and the local system has only $\pm 1$ monodromies, we prove that the intersection cohomology is a combinatorial invariant. In particular when the hyperplane arrangement is associated to the uniform matroid of rank $n-1$ …

Matroid Generalizations Of Some Graph Results, Cameron Crenshaw

LSU Doctoral Dissertations

The edges of a graph have natural cyclic orderings. We investigate the matroids for which a similar cyclic ordering of the circuits is possible. A full characterization of the non-binary matroids with this property is given. Evidence of the difficulty of this problem for binary matroids is presented, along with a partial result for binary orderable matroids.

For a graph G, the ratio of |E(G)| to the minimum degree of G has a natural lower bound. For a matroid M that is representable over a finite field, we generalize this to a lower bound on …