Connecting cominrule.v0.1.txt and Schubert.v0.1.txt
(both available at http://www.math.umn.edu/~ayong/papers.html)
--------------------------------------------------------------

The reader of  "A combinatorial rule for (co)miniscule Schubert calculus"
might be interested in how to computer check the rule
given in that paper using the two Maple packages stated above.
(The proof itself is _not_ by computer.)

Let me describe a quick translation in types E6, E7:

   65431
   542
  243
65431
 
        7
        6
        5
       24
    76543
    65431
    542
   243
765431

These are labellings of the boxes of \Lambda_{E6} and 
\Lambda_{E7} respectively. Given a shape in one of these
two posets, the associated reduced word is obtained by
reading the rows right to left and top down. For example

    X
   XXX
XXXXXX

in the latter poset corresponds to [5,3,4,2,1,3,4,5,6,7],
which then can be used in Schubert.v0.1.txt.

Naturally, cominrule.v0.1.txt is much faster than 
Schubert.v0.1.txt, in the cases that it handles. This is
mainly due to the fact that even if the input of Knutson's
algorithm used in Schubert.v0.1.txt begins with cominuscule
data, the recursion passes through all of the Weyl group.