Matrix: JGD_Margulies/flower_8_4

Description: Combinatorial optimization as polynomial eqns, Susan Margulies, UC Davis

JGD_Margulies/flower_8_4 graph
(bipartite graph drawing)

JGD_Margulies/flower_8_4 dmperm of JGD_Margulies/flower_8_4

  • Home page of the UF Sparse Matrix Collection
  • Matrix group: JGD_Margulies
  • Click here for a description of the JGD_Margulies group.
  • Click here for a list of all matrices
  • Click here for a list of all matrix groups
  • download as a MATLAB mat-file, file size: 835 KB. Use UFget(2162) or UFget('JGD_Margulies/flower_8_4') in MATLAB.
  • download in Matrix Market format, file size: 1 MB.
  • download in Rutherford/Boeing format, file size: 1 MB.

    Matrix properties
    number of rows55,081
    number of columns125,361
    structural full rank?yes
    structural rank55,081
    # of blocks from dmperm210
    # strongly connected comp.1
    explicit zero entries0
    nonzero pattern symmetry 0%
    numeric value symmetry 0%
    Cholesky candidate?no
    positive definite?no

    authorS. Margulies
    editorJ.-G. Dumas
    kindcombinatorial problem
    2D/3D problem?no


    Combinatorial optimization as polynomial eqns, Susan Margulies, UC Davis
    From Jean-Guillaume Dumas' Sparse Integer Matrix Collection,                      
    Expressing Combinatorial Optimization Problems by Systems of Polynomial 
    Equations and the Nullstellensatz                                       
    Authors: J.A. De Loera, J. Lee, Susan Margulies, S. Onn                 
    (Submitted on 5 Jun 2007)                                               
    Abstract: Systems of polynomial equations over the complex or real      
    numbers can be used to model combinatorial problems. In this way, a     
    combinatorial problem is feasible (e.g. a graph is 3-colorable,         
    hamiltonian, etc.) if and only if a related system of polynomial        
    equations has a solution. In the first part of this paper, we construct 
    new polynomial encodings for the problems of finding in a graph its     
    longest cycle, the largest planar subgraph, the edge-chromatic number,  
    or the largest k-colorable subgraph.  For an infeasible polynomial      
    system, the (complex) Hilbert Nullstellensatz gives a certificate that  
    the associated combinatorial problem is infeasible. Thus, unless P =    
    NP, there must exist an infinite sequence of infeasible instances of    
    each hard combinatorial problem for which the minimum degree of a       
    Hilbert Nullstellensatz certificate of the associated polynomial system 
    grows.  We show that the minimum-degree of a Nullstellensatz            
    certificate for the non-existence of a stable set of size greater than  
    the stability number of the graph is the stability number of the graph. 
    Moreover, such a certificate contains at least one term per stable set  
    of G. In contrast, for non-3- colorability, we found only graphs with   
    Nullstellensatz certificates of degree four.                            
    Filename in JGD collection: Margulies/flower_8_4.sms                    

    Ordering statistics:result
    nnz(V) for QR, upper bound nnz(L) for LU, with COLAMD1,666,537,768
    nnz(R) for QR, upper bound nnz(U) for LU, with COLAMD307,990,767

    For a description of the statistics displayed above, click here.

    Maintained by Tim Davis, last updated 12-Mar-2014.
    Matrix pictures by cspy, a MATLAB function in the CSparse package.
    Matrix graphs by Yifan Hu, AT&T Labs Visualization Group.