Automatic generation of vertices for the Schroedinger functional
Shinji Takeda, Ulli Wolff

TL;DR
This paper introduces a recursive algorithm for automatically generating vertices in the Schroedinger functional framework, facilitating perturbative calculations across various lattice actions.
Contribution
The authors develop a novel recursive multiplication algorithm for vertices, enabling automated perturbative computations in the Schroedinger functional with diverse actions.
Findings
Derived ratios of lambda parameters between lattice and MS schemes.
Computed one-loop Schroedinger functional coupling for lattice T=L±a.
Algorithm supports automatic perturbative calculations.
Abstract
We present a multiplication algorithm to recursively construct vertices for the Schroedinger functional in the abelian background field case. The algorithm is suited for automatic perturbative calculations with a variety of actions. As first applications, we derive ratios of the lambda parameters between the lattice scheme (improved gauge actions including six link loops) and the scheme, and one-loop results for the Schroedinger functional coupling with a lattice , which is motivated by considering staggered fermions.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParticle physics theoretical and experimental studies · Quantum Chromodynamics and Particle Interactions · Distributed and Parallel Computing Systems
