-
Notifications
You must be signed in to change notification settings - Fork 0
/
TODO
77 lines (38 loc) · 1.15 KB
/
TODO
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
External/Release
================
- hepforge
- account
- page
- TTP page
- really GPLv3?
Internal/Code
=============
- shorter loading message
- etc/: revise Mma qgraf styles
- check/:
- gather stuff (diss.)
- clean-up
- doc/: clean-up
- examples/:
- gather stuff
- clean-up
- TODO.dir: clean-up
- check whether TopoID:Cuts can handle 3 or more connectivity components
- TODO stuff from Todoist
- Polynomial.m: sort zeros
- Add "Integral.m" sub-package? (Pattern, index handling routines, ...?)
- Verbosity -> Global`
Topology.m:
- T*MomentaFlows[], T*Masses[]: adapt for eikonal props.
Graph.m:
- GraphTopologies[]: n[], p[]
* new symmetrization scheme, cf. Laporta.txt
* IBPs:
lightweight reduction -> MIs (and seeds)
* optimal momenta flows (better representations)
* IBP generator for an external reduction package
* good choice of irreducible scalar products
embedded in generalized graph? obtained from pinching and unpinching
box subgraphs (s-, t-, u-channels)? which one is the best? can this be
done on base of linear combinations alone? what about linear
dependency of props. in this graph. And completeness?