Solve question
- To: mathgroup at smc.vnet.net
- Subject: [mg48848] Solve question
- From: Arturas Acus <acus at itpa.lt>
- Date: Sat, 19 Jun 2004 04:30:48 -0400 (EDT)
- Sender: owner-wri-mathgroup at wolfram.com
Dear group,
Suppose we have a system of linear equations eqns, with more variables,
than can be solved. The question is. Do the number of solved variables
can depend on the order of how these variables are listed in second
Solve argument?
Suppose not.
The original problem, why I need to know this, is an attempt
to eliminate dummy indices in formal sum involving Clebsch Gordan
coefficients:
CG[{j1,m1},{j2,m2},{j3,m3}]*CG[{j4,m4},{j3,m3},{j6,m6}]*...
To calculate the sum explicitly. Dummy indices inside CG coefficient
satisfy well known relations:
m1+m2==m3, m4+m3==m6,...
Not all indices are dummy, some of them are fixed or numbers. Sum may
involve other objects, so generally there can be more or, rarely, less
variables than can be solved. It is of primary
interest then how Solve will act in these cases, and most important, how
the solution it provides depends on the variables ordering.
Sincerely, Arturas Acus