On Sun, Jun 11, 2017 at 11:30 AM, John H Palmieri
The example which gives strange output is the bipyramid complex:
S = SimplicialComplex(maximal_faces=[(1,2,3), (1,2,4),\
(1,2,5), (1,3,4),(1,3,5),(2,3,4),(2,3,5)])
which has 9 1-faces. I'm computing the list of all stable configurations,
namely vectors c in ZZ^9 having non-negative components which cannot
fire (in the sense of chip-firing - see Duval, Klivans, Martin
https://arxiv.org/pdf/1101.3981.pdf) with respect to the 1-dimls simplicial
spanning tree given by the 1-faces (1, 4), (1,5), (2,5), (3,4). On an old
mac running OS 10.11.6 and sage 7.2.b0, the output is usually 268125,
after about a day, but once I also got 137500. On a linux machine running
ubuntu and sage 7.3, I always get 395625. These computations use
the S.chain_complex.differential method to compute the 1-diml
combinatorial up Laplacian, Q, then does a time-consuming search.
(Basically, I check that no column vector q of Q, except possibly one
corresponding to a face in the spanning tree, has the property that
all components of c-q remain non-negative, except possibly those
corresponding to a face in the spanning tree.)
A similar computation using the 3-simplex is relatively quick and
always produces
2500 stable configurations for both machines.