Changes between Initial Version and Version 1 of MadGraph5


Ignore:
Timestamp:
03/20/12 16:17:12 (7 years ago)
Author:
trac
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • MadGraph5

    v1 v1  
     1
     2
     3== MadGraph5: a version 5 of MadGraph entirely in Python ==
     4
     5=== First step: a topology generator for MadGraph2 ===
     6
     7==== Why ? ====
     8The big limitation of current MG2 is the way topologies are generated, ie in a way completely independent of the interaction structure of the model, thus rather inefficient. As a first step, we propose an external Python script helping MG2 on this. This script can evolve to a full version when we have more info on how the HELAS routines are going to be organized.
     9
     10==== What ? ====
     11Input: particles.dat, interactions.dat and proc_card.dat
     12
     13Output: A set of text files (one per subprocess) containing list of valid topologies (empty diagrams) in a way which is readable by mg2. A set of postscript files with the Feynman diagrams.
     14
     15==== How ? ====
     16Two steps process:
     17   * Identify which topologies are OK with a new algorithm
     18   * Fill them to produce feynman diagrams (filling for matrix element is done by old mg2)
     19
     20New algorithm:
     21   1. From interactions.dat, create a (pseudo) dictionary (Python surclassing with new routines to take care of lists in a transparent way) which, giving two lists of particles (potentially only one particle in a list) output a list of possible particle to complete a 3-vertex (with order ?). All k-vertices are divided into k-2 3-vertices and a pseudo particle.
     22   1. Loop over all possible subprocesses
     23   1. Give a tag to each particle in the subproc (1,2 initial state, 3 to n for the other ones)
     24   1. Order these tags according to the number of possible interactions of the associated particle (a=lowest,...) (that is the great idea!!!)
     25   1. Look at a and b in the dictionary and stop if empty output. If no empty output, replace a and b by this list, increment order counter (stop if counter too high), and restart diagram analysis
     26   1. restart previous step until the end, if it does not stop before, it's a valid topology, write it down like ((a,b),c) (intermediate particles are not identified!
     27   1. Once it is done, fill topologies like in MG, and draw diagrams (with FeynMF ? with feynpy ?)
     28
     29
     30
     31
     32
     33   
     34
     35
     36
     37-- Main.MichelHerquet - 14 Aug 2008