Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion doc/manual/float.tex
Original file line number Diff line number Diff line change
Expand Up @@ -47,7 +47,7 @@ \section{Conversion between rational and floating point coefficients}
\item[ToRational] Attempts to convert floating point coefficients to
rational numbers. To this end it uses continued fractions as in
\begin{eqnarray}
x \;\rightarrow\; n_0 + \frac{1}{\,n_1 + \frac{1}{\,n_2 + \frac{1}{\,n_3 + \cdots}}}\;,
x & \;\rightarrow\; & n_0 + \frac{1}{\,n_1 + \frac{1}{\,n_2 + \frac{1}{\,n_3 + \cdots}}}\;,
\nonumber
\end{eqnarray}
with $x$ a floating point number. The algorithm keeps track of the
Expand Down
6 changes: 3 additions & 3 deletions doc/manual/gamma.tex
Original file line number Diff line number Diff line change
Expand Up @@ -77,9 +77,9 @@ \chapter{Dirac algebra}
their origin in the Chisholm\index{Chisholm} relation that is valid in 4
dimensions but not in a general number of dimensions. This relation can be
found in the literature. It is given by:
\begin{equation}
\gamma_\mu Tr[\gamma_\mu S] = 2(S + S^R)
\end{equation}
\begin{eqnarray}
\gamma_\mu Tr[\gamma_\mu S] & = & 2(S + S^R) \nonumber
\end{eqnarray}
\noindent in which S is a string of gamma matrices with an odd number of
matrices ($\gamma_5$ counts for an even number of matrices). $S^R$ is the
reversed string. This relation can be used to combine traces with common
Expand Down
14 changes: 4 additions & 10 deletions doc/manual/statements.tex
Original file line number Diff line number Diff line change
Expand Up @@ -529,7 +529,6 @@ \section{chisholm}
\gamma_a\gamma_\mu\gamma_b \Tr[\gamma_\mu S] & = &
2\gamma_a( S + S^R ) \gamma_b \nonumber
\end{eqnarray}
\setcounter{equation}{2}
in order to contract traces. $S$ is here a string of
gamma\index{gamma matrices} matrices and $S^R$ is the reverse string. This
identity is particularly useful when the matrices $\gamma_6 = 1+\gamma_5$
Expand Down Expand Up @@ -4688,7 +4687,6 @@ \section{ratio}
c^ib^{n-m-i}
\ \ \ \ \ \ \ \hfill m<n \nonumber
\end{eqnarray}
\setcounter{equation}{3}
Of course, such substitutions can be made also by the user in a more
flexible way. This statement has however the advantage of the best speed.
\vspace{4mm}
Expand Down Expand Up @@ -5364,16 +5362,14 @@ \section{stuffle}
\begin{eqnarray}
\sum_{i=1}^N \sum_{i=1}^N & = & \sum_{i=1}^N \sum_{j=1}^{i-1}
+ \sum_{j=1}^N \sum_{i=1}^{j-1}
+ \sum_{i=j=1}^N
+ \sum_{i=j=1}^N \nonumber
\end{eqnarray}
\setcounter{equation}{4}
while in the case of the minus the definition is
\begin{eqnarray}
\sum_{i=1}^N \sum_{i=1}^N & = & \sum_{i=1}^N \sum_{j=1}^{i}
+ \sum_{j=1}^N \sum_{i=1}^{j}
- \sum_{i=j=1}^N
- \sum_{i=j=1}^N \nonumber
\end{eqnarray}
\setcounter{equation}{5}
It is assumed that we have harmonic sums\index{harmonic sum} (see the
summer library in the \FORM\ distribution). For such sums we expect
functions with lists of nonzero integer arguments. Example:
Expand Down Expand Up @@ -5966,9 +5962,8 @@ \section{totensor}
replaced by the specified tensor with all the indices of these vectors. To
make this clearer:
\begin{eqnarray}
p^{\mu_1}p^{\mu_2}p^{\mu_3} \rightarrow t^{\mu_1\mu_2\mu_3} \nonumber
p^{\mu_1}p^{\mu_2}p^{\mu_3} & \rightarrow & t^{\mu_1\mu_2\mu_3} \nonumber
\end{eqnarray}
\setcounter{equation}{6}
and hence
% THIS EXAMPLE IS PART OF THE TESTSUITE. CHANGES HERE SHOULD BE APPLIED THERE AS
% WELL! (Sta_ToTensor_1)
Expand Down Expand Up @@ -6016,9 +6011,8 @@ \section{tovector}
statement. The tensor is replaced by a product of the given vectors, each
with one of the indices of the tensor as in:
\begin{eqnarray}
t^{\mu_1\mu_2\mu_3} \rightarrow p^{\mu_1}p^{\mu_2}p^{\mu_3} \nonumber
t^{\mu_1\mu_2\mu_3} & \rightarrow & p^{\mu_1}p^{\mu_2}p^{\mu_3} \nonumber
\end{eqnarray}\vspace{10mm}
\setcounter{equation}{7}

%--#] tovector :
%--#[ trace4 :
Expand Down
Loading