Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • AMS Subject Classification (1991) Classes:  90C05, 52B12, 68Q25  (1)
  • affine hyperplane arrangement  (1)
Material
Years
Keywords
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of algebraic combinatorics 1 (1992), S. 283-300 
    ISSN: 1572-9192
    Keywords: matroid ; β-invariant ; broken-circuit complex ; shellability ; affine hyperplane arrangement
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The broken-circuit complex is fundamental to the shellability and homology of matroids, geometric lattices, and linear hyperplane arrangements. This paper introduces and studies the β-system of a matroid, βnbc(M), whose cardinality is Crapo's β-invariant. In studying the shellability and homology of base-pointed matroids, geometric semilattices, and afflne hyperplane arrangements, it is found that the β-system acts as the afflne counterpart to the broken-circuit complex. In particular, it is shown that the β-system indexes the homology facets for the lexicographic shelling of the reduced broken-circuit complex $$\overline {BC} (M)$$ , and the basic cycles are explicitly constructed. Similarly, an EL-shelling for the geometric semilattice associated with M is produced,_and it is shown that the β-system labels its decreasing chains.Basic cycles can be carried over from $$\overline {BC} (M)$$ The intersection poset of any (real or complex) afflnehyperplane arrangement Α is a geometric semilattice. Thus the construction yields a set of basic cycles, indexed by βnbc(M), for the union ⋃Α of such an arrangement.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Combinatorica 18 (1998), S. 349-372 
    ISSN: 1439-6912
    Keywords: AMS Subject Classification (1991) Classes:  90C05, 52B12, 68Q25
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: The analysis of two most natural randomized pivot rules on the Klee-Minty cubes leads to (nearly) quadratic lower bounds for the complexity of linear programming with random pivots. Thus we disprove two bounds (for the expected running time of the random-edge simplex algorithm on Klee-Minty cubes) conjectured in the literature. At the same time, we establish quadratic upper bounds for the expected length of a path for a simplex algorithm with random pivots on the classes of linear programs under investigation. In contrast to this, we find that the average length of an increasing path in a Klee-Minty cube is exponential when all paths are taken with equal probability.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...