Related papers: Improving Modular Bootstrap Bounds with Integralit…
In the recent study of Virasoro action on characters, we discovered that it gets especially simple for peculiar linear combinations of the Virasoro operators: particular harmonics of $\hat w$-operators. In this letter, we demonstrate that…
We advocate a strategy of bootstrapping Feynman integrals from just knowledge of their singular behavior. This approach is complementary to other bootstrap programs, which exploit non-perturbative constraints such as unitarity, or…
Matrix perturbation bounds play an essential role in the design and analysis of spectral algorithms. In this paper, we use a "contour bootstrapping" argument to derive several new perturbation bounds. As applications, we discuss new bounds…
We study the implications of modular invariance on 2d CFT partition functions with abelian or non-abelian currents when chemical potentials for the charges are turned on, i.e. when the partition functions are "flavored". We begin with a new…
We revisit a class of integer optimal control problems for which a trust-region method has been proposed and analyzed in arXiv:2106.13453v3 [math.OC]. While the algorithm proposed in arXiv:2106.13453v3 [math.OC] successfully solves the…
The holomorphic bootstrap attempts to classify rational conformal field theories. The straight ahead approach is hard to implement when the number of characters become large. We combine all characters of an RCFT to form a vector valued…
We improve the efficiency of algorithms for stochastic \emph{combinatorial semi-bandits}. In most interesting problems, state-of-the-art algorithms take advantage of structural properties of rewards, such as \emph{independence}. However,…
A compact Riemannian manifold is associated with geometric data given by the eigenvalues of various Laplacian operators on the manifold and the triple overlap integrals of the corresponding eigenmodes. This geometric data must satisfy…
The purpose of the ``bootstrap program'' for integrable quantum field theories in 1+1 dimensions is to construct a model in terms of its Wightman functions explicitly. In this article, this program is mainly illustrated in terms of the…
An efficient integral equation based solver is constructed for the electrostatic problem on domains with cuboidal inclusions. It can be used to compute the polarizability of a dielectric cube in a dielectric background medium at virtually…
Submodularity is a key property in discrete optimization. Submodularity has been widely used for analyzing the greedy algorithm to give performance bounds and providing insight into the construction of valid inequalities for mixed-integer…
Implied-integer detection is a well-known presolving technique that is used by many Mixed-Integer Linear Programming solvers. Informally, a variable is said to be implied integer if its integrality is enforced implicitly by integrality of…
We use analytical bootstrap techniques to study supersymmetric monodromy defects in the critical Wess-Zumino model. In preparation for this result we first study two related systems which are interesting on their own: general monodromy…
By double ideal quotient, we mean $(I:(I:J))$ where ideals $I$ and $J$. In our previous work [11], double ideal quotient and its variants are shown to be very useful for checking prime divisor and generating primary component. Combining…
Conformal field theories that exhibit spontaneous breaking of conformal symmetry (a moduli space of vacua) must satisfy a set of bootstrap constraints, involving the usual data (scaling dimensions and OPE coefficients) as well as new data…
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality…
In this paper, we present lower bounds on the rank of the split closure, the multi-branch closure and the lattice-free closure for packing sets as a function of the integrality gap. We also provide a similar lower bound on the split rank of…
The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…
A long-standing open question in Integer Programming is whether integer programs with constraint matrices with bounded subdeterminants are efficiently solvable. An important special case thereof are congruency-constrained integer programs…
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…