exploring
getting the right number of points in the 1BZ now.  Had to add epsilon to 0 and 1 to get the precision to work right
Got the number of Kpoints in 1BZ right.  Used Gus' sphere search to multiply the rows of M, before finding max/mins, and added epsilon to 1.0 and 0.0
Got the number of kpoints right in 1BZ.  Used Gus' sphere search to multiply each row of M before taking min/max of search.  Also added epsilon to 0.0 and 1.0 before testing.
Got reduced BZ working, but not sure why the ratio of total/reduced is not an integer.
Finally figured out the limits on the multiples on the K basis vectors to make up the points in the 1BZ:
    #The rows of M determine how each vector (column) of K is used in the sum.    
    #The 1BZ parallelpiped must go from (0,0,0) to each of the other vertices 
    #the close vertices are at B1,B2,B3.  So each element of each row must be considered.
    #The far verictecs are at  for these three vectors taken in paris. 
    #To reach the diagonal point of the parallelpiped, 
    #which means that the sums of the rows must be part of the limits.
    #To reach the three far vertices (not the tip), we have to take the columns of M in pairs:, 
    #which means that we check the limits of the pairs among the elements of each row.
    #in other words, the limits on the search for each row i of (coefficients of grid basis vector Ki) are the partial sums
    #of the elements of each row:  min(0,a,b,c,a+b,a+c,b+c,a+b+c), max(0,a,b,c,a+b,a+c,b+c,a+b+c)