Related papers: JuliBootS: a hands-on guide to the conformal boots…
The modern conformal bootstrap program often employs the method of linear functionals to derive the numerical or analytical bounds on the CFT data. These functionals must have a crucial "swapping" property, allowing to swap infinite…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains. In this paper, the conjugate function method is extended to cover conformal mappings between Riemannian…
Motivation: Estimating model parameters from experimental observations is one of the key challenges in systems biology and can be computationally very expensive. While the Julia programming language was recently developed as a high-level…
This paper describes an Open Source Software (OSS) project: PythonRobotics. This is a collection of robotics algorithms implemented in the Python programming language. The focus of the project is on autonomous navigation, and the goal is…
The analytic conformal bootstrap is an array of techniques to characterize, constrain, and solve strongly interacting quantum field theories using symmetries, causality, unitarity, and other general principles. In the last decade, bolstered…
We use the numerical conformal bootstrap to study six-dimensional $\mathcal{N}=(1,0)$ superconformal field theories with flavor symmetry $\mathfrak{so}_{4k}$. We present evidence that minimal $(D_k, D_k)$ conformal matter saturates the…
Many authors have studied the numerical computation of conformal mappings (numerical conformal mapping), and there are nowadays several efficient numerical schemes. Among them, Amano's method offers a straightforward numerical procedure for…
In research problems that involve the use of numerical methods for solving systems of ordinary differential equations (ODEs), it is often required to select the most efficient method for a particular problem. To solve a Cauchy problem for a…
Simulation of non-adiabatic dynamics of a quantum system coupled to dissipative environments poses significant challenges. New sophisticated methods are regularly being developed with an eye towards moving to larger systems and more…
Applications of the bootstrap program to superconformal field theories promise unique new insights into their landscape and could even lead to the discovery of new models. Most existing results of the superconformal bootstrap were obtained…
The conjugate function method is an algorithm for numerical computation of conformal mappings for simply and multiply connected domains on surfaces. In this paper the conjugate function method, earlier used for simply connected domains, is…
The paper contributes to an ongoing effort to extend the conformal bootstrap beyond its traditional focus on systems of four-point correlation functions. Recently, it was demonstrated that semidefinite programming can be used to formulate a…
We present Colibri, an open-source Python code that provides a general and flexible tool for PDF fits. The code is built so that users can implement their own PDF model, and use the built-in functionalities of Colibri for a fast computation…
In this note we report an improved determination of the scaling dimensions and OPE coefficients of the minimal supersymmetric extension of the 3d Ising model using the conformal bootstrap. We also show how this data can be used as input to…
This paper is concerned with finite sample approximations to the supremum of a non-degenerate $U$-process of a general order indexed by a function class. We are primarily interested in situations where the function class as well as the…
We survey the main numerical techniques for finite-dimensional nonlinear optimal control. The chapter is written as a guide to practitioners who wish to get rapidly acquainted with the main numerical methods used to efficiently solve an…
The extremal functional method determines approximate solutions to the constraints of crossing symmetry, which saturate bounds on the space of unitary CFTs. We show that such solutions are characterized by extremality conditions, which may…
Geometric computing with chain complexes allows for the computation of the whole chain of linear spaces and (co)boundary operators generated by a space decomposition into a cell complex. The space decomposition is stored and handled with…
We develop a novel numerical bootstrap for unitary, crossing-symmetric conformal field theories, focusing on moment observables defined as weighted averages over conformal data. Providing a global and coarse-grained probe of the operator…
Bootstrapping was designed to randomly resample data from a fixed sample using Monte Carlo techniques. However, the original sample itself defines a discrete distribution. Convolutional methods are well suited for discrete distributions,…