Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Gerhard: I tried to reduce one of the spheres 50 times. Only 4 times the reductions were imperfect. Once, the reduced complex had a 3x3 boundary matrix with highest entry 17, twice 4x4 matrices with highest entries 45 and 84, and finally one 5x5 matrix with highest entry 172.
Greg, thank you for the references. I was aware that counting in GL_n(Z) was not trivial, but hoped that the fraction could be estimated even though both numerator and denominator could not. It seems that the consensus is that unit entry matrices have measure zero as you indicate.
Gerhard: quite the opposite, actually. I am finding that over 80% of the time I do in fact end up in the perfect situation with only two cells. This surprised me also, which is why I want the question answered as a control experiment: if GL_n(Z) elements typically lack units, then the computations are not just "getting lucky".
Gerhard: this is a theorem when the determinant is a unit (which it must be in the general linear group over Z): see [here][1] for instance. [1]: math.stackexchange.com/questions/19528/…
How is your input presented: is there a simplicial decomposition, or do you just have an arbitrary collection of boundary matrices over the coefficient ring?
There are an infinite number of sets that can be constructed using ZF axioms, that hardly makes set theory devoid of mathematical content. Maybe I have misunderstood what you are saying.
Theo, you were definitely on the right track here, except I suspect that the name coming to mind was "Papadimitriou". On a somewhat tangential note, Googling "Papadopoulos math" brings up at least 6 seemingly distinct Papadopouloses, none of whom seem to have worked on Brouwer fixed points :)