FeynArts 3.2

Author: t-hahn

Convert31to32.m

@@ -0,0 +1,62 @@
+(*
+	Convert31to32.m
+		renames the ShapeData files of FeynArts 3.1
+		for the new naming scheme of FeynArts 3.2
+		last modified 1 Jul 03 th
+*)
+
+
+Needs["FeynArts`"]
+
+shapeDir = ToFileName[Directory[], "ShapeData"]
+
+If[ FileType[shapeDir] =!= Directory,
+  Print["No directory ", shapeDir, " found"];
+  Abort[]
+]
+
+backupDir = ToFileName[Directory[], "ShapeData-3.1"]
+
+If[ FileType[backupDir] === Directory,
+  Print["Conversion already performed (", backupDir, " exists)."];
+  Abort[]
+]
+
+
+RenameFile[shapeDir, backupDir]
+
+
+MkDir[dir_String] := dir /; FileType[dir] === Directory
+
+MkDir[dir_String] := Check[CreateDirectory[dir], Abort[]]
+
+MkDir[dirs__String] := Fold[MkDir[ToFileName[##]]&, {}, {dirs}]
+
+
+newName[s_String] :=
+Block[ {c, p, int = "0", out = "0", in = "0"},
+  c = Characters[StringReplace[s, ".m" -> ""]];
+  p = Position[c, "+"];
+  If[ p =!= {},
+    p = p[[1, 1]];
+    in = str[Drop[c, p]];
+    c = Take[c, p - 1];
+  ];
+  p = Position[c, "-"];
+  If[ p =!= {},
+    p = p[[1, 1]];
+    out = str[Drop[c, p]];
+    c = Take[c, p - 1];
+  ];
+  int = str[c] <> ".m";
+  CopyFile[s, ToFileName[MkDir[shapeDir, in, out], int]]
+]
+
+str[c_] := StringJoin[Partition[c, 2]//Reverse] /. "" -> "0"
+
+
+
+SetDirectory[backupDir]
+
+newName/@ FileNames[]
+

FA3Guide.ps.gz

@@ -1,8 +1,8 @@
 (*
 
-This is FeynArts, Version 3.1
-Copyright by Sepp Kueblbeck, Hagen Eck, and Thomas Hahn 1991-2003
-last modified 7 Apr 03 by Thomas Hahn
+This is FeynArts, Version 3.2
+Copyright by Sepp Kueblbeck, Hagen Eck, and Thomas Hahn 1991-2007
+last modified 6 Mar 07 by Thomas Hahn
 
 Release notes:
 
@@ -44,17 +44,13 @@
 
 
 Print[""];
-Print["FeynArts 3.1"];
+Print["FeynArts 3.2"];
 Print["by Hagen Eck, Sepp Kueblbeck, and Thomas Hahn"];
-Print["last revised 7 Apr 03"]
+Print["last revised 5 Feb 07"]
 
 
 BeginPackage["FeynArts`"]
 
-FullFileName::usage = "FullFileName[name, path] returns the name of the
-file with its full path appended."
-
-
 (* definitions for Utilities.m *)
 
 FAPrint::usage = "FAPrint[l, s] prints the string s if l <= $Verbose."
@@ -283,8 +279,16 @@ that looks (sort of) like a bicycle."
 CreateVFTopologies::usage = "CreateVFTopologies[l, i -> o] generates all
 topologies with 1PI vertex functions whose total loop order is l."
 
-CanonicalOrder::usage = "CanonicalOrder[top] orders the topology top into
-a (more or less) canonical order."
+TopologySort::usage = "TopologySort[top] sorts the topology top into a
+(more or less) canonical order."
+
+TopologyOrdering::usage = "TopologyOrdering[top] returns the topology
+top sorted into a (more or less) canonical order, together with the
+permutation that brings it into this order, i.e. a list of the positions
+at which the propagators in the sorted version appeared in the unsorted
+version.  A negative integer in the permutation indicates that also the
+vertices in the respective propagator were exchanged with respect to the
+original."
 
 SymmetryFactor::usage = "SymmetryFactor[top] returns the symmetry factor
 for the topology top.  This value is needed if you want to enter new
@@ -343,12 +347,18 @@ is given as a list of symbols which must (or must not, if preceded by
 outparticles\"."
 
 IndexDelta::usage = "IndexDelta[i1, i2] is a symbol in the definition of a
-classes coupling that indicates that the coupling is diagonal in the
-indices i1 and i2."
+classes coupling indicating that the coupling is diagonal in the indices
+i1 and i2."
+
+IndexEps::usage = "IndexEps[i1, i2, i3] is the totally antisymmetric
+symbol in the indices i1, i2, i3."
 
 
 (* definitions for Initialize.m *)
 
+ReadModelFile::usage = "ReadModelFile[modfile, text] reads the model
+file modfile and prints the message text."
+
 InitializeModel::usage = "InitializeModel[MOD] initializes the classes
 model for the model MOD and the generic model given by the GenericModel
 option.  The model information is taken from the file MOD.mod.  
@@ -406,6 +416,12 @@ is given as a list of symbols which must (or must not, if preceded by
 sum of expr in the index i over range.  To execute the sum, replace
 IndexSum by Sum."
 
+AddHC::usage = "AddHC[mat] extends mat by its Hermitian conjugate part,
+e.g. AndHC[A[1, i, j]] returns (A[1, i, j] + Conjugate[A[1, j, i]])/2. 
+AddHC[mat, w] forms the weighted sum with weight function w, e.g.
+AndHC[A[1, i, j], w] returns (w[i, j] A[1, i, j]/2 + Conjugate[w[j, i]]
+Conjugate[A[1, j, i]]/2)."
+
 ReferenceOrder::usage = "ReferenceOrder[x] gives a list of all field
 points of the current model in (unsorted) list form.  x can be Generic or
 Classes."
@@ -630,9 +646,9 @@ as arguments the quantum numbers of the involved fields (times -1 for
 
 TheLabel::usage = "TheLabel[p] returns the PropagatorLabel of particle p."
 
-Appearance::usage = "Appearance[i] gives the rendering information for the
-index i.  For example, Appearance[Index[Lorentz, i_]] := Greek[i + 11]
-makes Lorentz indices appear as \"\\mu\", \"\\nu\", etc."
+IndexStyle::usage = "IndexStyle[i] gives the rendering information for
+the index i.  For example, IndexStyle[Index[Lorentz, i_]] := Greek[i +
+11] makes Lorentz indices appear as \"\\mu\", \"\\nu\", etc."
 
 TheC::usage = "TheC is an internal symbol for storing the coupling
 matrices."
@@ -652,9 +668,9 @@ as arguments the quantum numbers of the involved fields (times -1 for
 ConjugateCoupling::usage = "ConjugateCoupling[coupl] defines how the
 charge-conjugated coupling is derived from coupl.  Typically, one I
 multiplying the coupling constant must not be conjugated because it
-derives from the exponent of the path integral, e.g. I \int d^4x {\cal L}.  
-If no definition is made for ConjugateCoupling, the final amplitudes will
-contain this symbol."
+derives from the exponent of the path integral.  If no definition is
+made for ConjugateCoupling, the final amplitudes will contain this
+symbol."
 
 G::usage = "G[sym][cto][fields][kinpart] is a generic coupling matrix of
 counter-term order cto for fields corresponding to the kinematical object
@@ -717,6 +733,9 @@ as arguments the quantum numbers of the involved fields (times -1 for
 where field #5 is not a S[1], one could use DiagramSelect[diags, FreeQ[#,
 Field[5] -> S[1]]&]."
 
+DiagramComplement::usage = "DiagramComplement[diagall, diag1, diag2,
+...] gives all diagrams in diagall which are not in any of the diagi."
+
 ToFA1Conventions::usage = "ToFA1Conventions[expr] converts expr back to
 FeynArts 1 conventions.  Note that this conversion only renames some
 symbols.  The output may thus not be 100% FeynArts 1 compatible since
@@ -847,12 +866,12 @@ C8 N15 (= topology 1, classes insertion 8, running number 15)."
 
 Shape::usage = "Shape[tops] edits the shapes of the topologies tops."
 
-ShapeData::usage = "ShapeData[topcode] returns the shape data for the
-topology characterized by topcode."
+ShapeData::usage = "ShapeData[topcode] is the database of shapes currently
+in memory.  It is indexed by the three strings given by TopologyCode."
 
-TopologyCode::usage = "TopologyCode[top] returns a string identifying the
-topology.  This string is unique as far painting the topology is
-concerned."
+TopologyCode::usage = "TopologyCode[top] returns a list of three strings
+identifying the topology.  This code is unique as far painting the
+topology is concerned."
 
 
 (* FeynArts system constants *)
@@ -879,26 +898,23 @@ C8 N15 (= topology 1, classes insertion 8, running number 15)."
 P$NonCommuting::usage = "P$NonCommuting is the pattern for the
 non-commuting generic fields."
 
+P$InsertionObjects::usage = "P$InsertionObjects matches the objects
+in the generic amplitude that will be taken for insertions."
+
 
 P$Topology = Topology[__] | Topology[_][__]
 
 P$Generic = F | S | V | U | SV
 
 P$NonCommuting = F | U
 
+P$InsertionObjects = G[_][_][__][__] | Mass[_] | GaugeXi[_] |
+  VertexFunction[_][__]
 
-FullFileName[ file_, path_ ] :=
-Block[ {full},
-  Catch[
-    Scan[
-      If[ FileType[full = ToFileName[#, file]] === File, Throw[full] ] &,
-      path ];
-    file ]
-]
-
-$FeynArts = 3.1
+$FeynArts = 3.2
 
-$FeynArtsDir = SetDirectory[DirectoryName[ FullFileName[$Input, $Path] ]]
+$FeynArtsDir =
+  SetDirectory[DirectoryName[System`Private`FindFile[$Input]]]
 
 ResetDirectory[]
 

FeynArts.m

@@ -2,7 +2,7 @@
 	Analytic.m
 		Translation of InsertFields output into
 		analytic expressions
-		last modified 7 Apr 03 th
+		last modified 22 Mar 06 th
 *)
 
 Begin["`Analytic`"]
@@ -221,9 +221,7 @@ Since momenta on tree propagators (Propagator[Internal])
   amp = CreateAmpGraph[ top,
     gr /. (n_ -> x_. fi_[i__]) :> (n -> x fi[i, orig[x, n]]) ];
   gm = Append[
-    Union[ Cases[amp[[3]],
-      G[_][_][__][__] | Mass[_] | GaugeXi[_] | VertexFunction[_][__],
-      Infinity] ],
+    Union[ Cases[amp[[3]], P$InsertionObjects, Infinity] ],
     RelativeCF ];
   rawgm = gm /.
     s1_. _[__, orig[s2_, fi_], k___] :>
@@ -265,7 +263,7 @@ Since momenta on tree propagators (Propagator[Internal])
     Times@@ DeleteCases[Flatten[scalars], 1] *
       LoopPD[Expand[Times@@ Flatten[prden], PropagatorDenominator]] *
       Times@@ res /.
-      truncru //. M$LastGenericRules /. Mass -> TheMass ]
+      truncru /. Mass -> TheMass ] //. M$LastGenericRules
 ]
 
 
@@ -690,25 +688,17 @@ kinematical expression (for a G[-]).  If neither method resolves TheC,
 ]
 
 
-DefWeedOut[ lev_ ] := (
-  WeedOut[ g:Graph[_, lev == _][__] -> _[] ] = g;
-  WeedOut[ _ -> _[] ] = Sequence[];
-  WeedOut[ a_ ] = a;
-  Rule[_] := Sequence[]
-)
-
-
 Discard[ tops:TopologyList[info__][__], diags__ ] :=
-Block[ {p, lev, WeedOut, Rule},
-  p = Position[tops, Graph[__][__]];
-  lev = ResolveLevel[InsertionLevel /. {info}];
-  If[ FreeQ[lev, Generic], p = Select[p, Length[#] =!= 4 &] ];
+Block[ {p, lev, Rule},
+  lev = Alternatives@@ ResolveLevel[InsertionLevel /. {info}];
+  p = Position[tops, Graph[_, lev == _][__]];
   p = p[[ Union[ Flatten[
     {diags} /. a_Integer (Repeated | RepeatedNull)[b_] :>
                  Range@@ Sort[Floor[{b, a}]] ] ] ]];
   If[ Head[p] === Part, Return[$Failed] ];
-  DefWeedOut[ lev[[-1]] ];
-  Delete[tops, p] /. ins:Insertions[_][__] :> WeedOut/@ ins /.
+  Rule[_] := Sequence[];
+  Delete[tops, p] /.
+    (Graph[__][__] -> _[]) :> Seq[] /.
     (Topology[__][__] -> _[]) :> Seq[]
 ]
 
@@ -719,18 +709,37 @@ kinematical expression (for a G[-]).  If neither method resolves TheC,
 
 
 DiagramSelect[ tops:TopologyList[info__][__], crit_ ] :=
-Block[ {lev, WeedOut, Rule},
+Block[ {lev, Rule},
   lev = ResolveLevel[InsertionLevel /. {info}][[-1]];
-  DefWeedOut[lev];
+  Rule[_] := Sequence[];
   tops /.
-    Graph[_, lev == _][fi__] :> Seq[] /; crit[{fi}] =!= True /.
-    ins:Insertions[_][__] :> WeedOut/@ ins /.
+    Graph[__, lev == _][fi__] :> Seq[] /; crit[{fi}] =!= True /.
+    (Graph[__][__] -> _[]) :> Seq[] /.
     (Topology[__][__] -> _[]) :> Seq[]
 ]
 
 DiagramSelect[ amp_, crit_ ] := Select[amp, crit]
 
 
+DiagramComplement[ tops:TopologyList[info__][___],
+  more:TopologyList[__][___].. ] :=
+Block[ {lev = ResolveLevel[InsertionLevel /. {info}][[-1]]},
+  Fold[DiagramRemove[#2]/@ #1 &, tops, Level[{more}, {2}]]
+]
+
+DiagramRemove[ top_ -> rem_ ][ top_ -> ins_ ] := top -> (
+Block[ {Rule, Graph},
+  Rule[_] := Sequence[];
+  Cases[rem,
+    Graph[_, lev == _][gr__] :> (Graph[_, lev == _][gr] = Sequence[]),
+    Infinity];
+  ins
+] /. (Graph[__][__] -> _[]) :> Seq[] ) /.
+  (Topology[__][__] -> _[]) :> Seq[]
+
+DiagramRemove[ _ ][ t_ ] = t
+
+
 ToJoin[ h:Topology == _, r__ ] := {h, ToJoin[r]}
 
 ToJoin[ r__, h:Number == _ ] := {ToJoin[r], h}