Name: Vladyslav Shtabovenko Date: 06/22/17-12:02:05 PM Z
I’m actually not so sure if
$Ranklimit={2,10}
is supported in the code of Tarcer.
May be Rolf could comment on that?
Cheers,
Vladyslav
Am 22.06.2017 um 10:30 schrieb Philipp Schicho:
> I was trying to generate the Tarcer .mx file with the Ranklimit of
{2,10} as I have a few appearences of
>
> TFI[D, SPD[q, q], {0, 0, 6, 4, 0}, {{5, mG}, {3, mG},
{0, 0}, {0, 0}, {0, 0}}]
> TFI[D, SPD[q, q], {0, 0, 6, 4, 0}, {{5, mG}, {4, mG},
{0, 0}, {0, 0}, {0, 0}}]
> TFI[D, SPD[q, q], {0, 0, 6, 4, 0}, {{6, mG}, {3, mG},
{0, 0}, {0, 0}, {0, 0}}]
> TFI[D, SPD[q, q], {0, 0, 6, 4, 0}, {{6, mG}, {4, mG},
{0, 0}, {0, 0}, {0, 0}}]
>
>
> However during the generation there seems to appear an error telling
me that for certain TFIs I have protected values in the recursion:
>
> Set::write: Tag Equal in Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{Subscript[\[Nu], 5],Subscript[m, 5]},
(d) 000100]==945/32 Subscript[\[Nu], 5]
(1+Subscript[\[Nu], 5])
(2+Subscript[\[Nu], 5])
(3+Subscript[\[Nu], 5])
(4+Subscript[\[Nu], 5]) (p^2)^5 Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{5+Subscript[\[Nu], 5],Subscript[m, 5]},
(10+d)]+4725/32 Subscript[\[Nu], 3]
Subscript[\[Nu], 5] (1+Subscript[\[Nu],
5]) (2+Subscript[\[Nu], 5])
(3+Subscript[\[Nu], 5]) (p^2)^5 Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{1+Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{4+Subscript[\[Nu], 5],Subscript[m, 5]},
(10+d)]+<<48>>+<<811>> is Protected.
>
> Set::write: Tag Equal in Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{Subscript[\[Nu], 5],Subscript[m, 5]},
(d) 000100]==945/32 Subscript[\[Nu], 5]
(1+Subscript[\[Nu], 5])
(2+Subscript[\[Nu], 5])
(3+Subscript[\[Nu], 5])
(4+Subscript[\[Nu], 5]) (p^2)^5 Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{5+Subscript[\[Nu], 5],Subscript[m, 5]},
(10+d)]+4725/32 Subscript[\[Nu], 3]
Subscript[\[Nu], 5] (1+Subscript[\[Nu],
5]) (2+Subscript[\[Nu], 5])
(3+Subscript[\[Nu], 5]) (p^2)^5 Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{1+Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{4+Subscript[\[Nu], 5],Subscript[m, 5]},
(10+d)]+<<48>>+<<811>> is Protected.
>
> Set::write: Tag Equal in Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{Subscript[\[Nu], 3],Subscript[m,
3]}{Subscript[\[Nu], 4],Subscript[m,
4]}{Subscript[\[Nu], 5],Subscript[m, 5]},
(d) 01000100]==10395/32 DP Subscript[\[Nu], 4]
Subscript[\[Nu], 5] (1+Subscript[\[Nu],
5]) (2+Subscript[\[Nu], 5])
(3+Subscript[\[Nu], 5])
(4+Subscript[\[Nu], 5])
(5+Subscript[\[Nu], 5]) (p^2)^5 Subsuperscript[F,
{Subscript[\[Nu], 1],Subscript[m,
1]}{Subscript[\[Nu], 2],Subscript[m,
2]}{Subscript[\[Nu], 3],Subscript[m,
3]}{1+Subscript[\[Nu], 4],Subscript[m,
4]}{6+Subscript[\[Nu], 5],Subscript[m, 5]},
(12+d)]+<<49>>+<<1119>> is Protected.
>
> General::stop: Further output of Set::write will be suppressed
during this calculation.
>
> Is there a limit to the rank? Or can this be resolved somehow?
>
> Cheers,
> Philipp
>