arXiv (All)
open access
Truncated Polyakov bootstrap
We set up a truncated numerical approach in the Polyakov bootstrap (PB) framework. We employ a gradient descent optimization to solve PB sum rules numerically, and hence solve crossing for arbitrary deformations of the generalized free field (GFF) spectrum in an iterative way starting from a perturb
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1043098
- Sudakov factorization and resummation#321937
- Extending Sheldon M. Ross's Method for Efficient Large-Scale Variance Computation#173232
Record · ID 822162
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive