Coder Social home page Coder Social logo

big-e-green / electron-electron_gf_feynman_diagrams Goto Github PK

View Code? Open in Web Editor NEW
1.0 1.0 0.0 63 KB

Generation of all possible electron-electron interaction Green's function corrections, and reduction into irreducible Feynman diagrams

Python 100.00%
feynman-diagrams greens-functions solid-state-physics hartree-fock pertubation

electron-electron_gf_feynman_diagrams's Introduction

Electron-electron Greens function Feynman diagrams

Given the case of an electron-electron interaction in the interaction picture of a one-particle greens function. On application of Wicks theorem, an expression for the full greens function of the system can be found. This expression consists of interactions, vertexes and g-naughts. When these components are put together and determinant for the g's are found, a linear combination of Feynman diagrams can be created. These obtained Feynman diagrams can then be summated, leading to the resultant full greens function.

This code sets out to generate all of these diagrams for any given order of correction. i.e. for any n amount of interactions (for which there are (2n+1)! possible diagrams). From here there are rules on connected diagrams and topologically inequivalent diagrams, which widdle the number of diagrams of each type to (2^n)*n!. Given all of these topologically inequivalent diagrams, the code then graphically generates these in the form of Feynman diagrams.

After the topologically inequivilent connected diagrams are obtained, the self-energy can be found. This is done through the removal of all Hartree and Fock terms. Once the then resultant self-energy diagrams are generated, full green's function self-energy diagrams can be found. This time, through a more rigorous removal of disconnected Hartree and Fock terms. This leaves the fundamental self-energy diagrams with all possible insertions over the full greens functions.

WARNING: given the relationship between the correction and number of diagrams generated is (2n+1)!, increasing increments of n take longer to produce outputs.

electron-electron_gf_feynman_diagrams's People

Contributors

big-e-green avatar

Stargazers

 avatar

Watchers

 avatar

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    ๐Ÿ–– Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. ๐Ÿ“Š๐Ÿ“ˆ๐ŸŽ‰

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google โค๏ธ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.