eBook ISBN:  9781470406127 
Product Code:  MEMO/211/995.E 
List Price:  $70.00 
MAA Member Price:  $63.00 
AMS Member Price:  $42.00 
eBook ISBN:  9781470406127 
Product Code:  MEMO/211/995.E 
List Price:  $70.00 
MAA Member Price:  $63.00 
AMS Member Price:  $42.00 

Book DetailsMemoirs of the American Mathematical SocietyVolume: 211; 2011; 82 ppMSC: Primary 81;
DysonSchwinger equations are integral equations in quantum field theory that describe the Green functions of a theory and mirror the recursive decomposition of Feynman diagrams into subdiagrams. Taken as recursive equations, the DysonSchwinger equations describe perturbative quantum field theory. However, they also contain nonperturbative information.
Using the Hopf algebra of Feynman graphs the author follows a sequence of reductions to convert the DysonSchwinger equations to a new system of differential equations.

Table of Contents

Chapters

Foreword

Preface

1. Introduction

2. Background

3. DysonSchwinger equations

4. The first recursion

5. Reduction to one insertion place

6. Reduction to geometric series

7. The second recursion

8. The radius of convergence

9. The second recursion as a differential equation


RequestsReview Copy – for publishers of book reviewsPermission – for use of book, eBook, or Journal contentAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
DysonSchwinger equations are integral equations in quantum field theory that describe the Green functions of a theory and mirror the recursive decomposition of Feynman diagrams into subdiagrams. Taken as recursive equations, the DysonSchwinger equations describe perturbative quantum field theory. However, they also contain nonperturbative information.
Using the Hopf algebra of Feynman graphs the author follows a sequence of reductions to convert the DysonSchwinger equations to a new system of differential equations.

Chapters

Foreword

Preface

1. Introduction

2. Background

3. DysonSchwinger equations

4. The first recursion

5. Reduction to one insertion place

6. Reduction to geometric series

7. The second recursion

8. The radius of convergence

9. The second recursion as a differential equation