Related papers: Improving Modular Bootstrap Bounds with Integralit…
While Branch and Bound based algorithms are a standard approach to solve single-objective (mixed-)integer optimization problems, multi-objective Branch and Bound methods are only rarely applied compared to the predominant objective space…
The computational cost of the boundary-condition-enforced immersed boundary method (IBM) increases in the order of $\mathcal{O}(N^2)$ as the number of Lagrangian points, $N$, increases. This is due to the time-consuming calculation of the…
Using the large-charge expansion, we prove a necessary condition for a CFT to exhibit conformal symmetry breaking, under the assumption that a continuous global symmetry is ${\it also}$ broken on the moduli space: there must be a tower of…
We introuduce a unified method which can be applied to any WZW model at arbitrary level to search systematically for modular invariant physical partition functions. Our method is based essentially on modding out a known theory on group…
The optimization of submodular functions on the integer lattice has received much attention recently, but the objective functions of many applications are non-submodular. We provide two approximation algorithms for maximizing a…
We propose an algorithm for solving bound-constrained mathematical programs with complementarity constraints on the variables. Each iteration of the algorithm involves solving a linear program with complementarity constraints in order to…
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…
In this article, we establish a class of new accelerated modulus-based iteration methods for solving the linear complementarity problem. When the system matrix is an $H_+$-matrix, we present appropriate criteria for the convergence…
In this note, we show that the algebraicity of the Fourier coefficients of half-integral weight modular forms can be determined by checking the algebraicity of the first few of them. We also give a necessary and sufficient condition for a…
The present article is concerned with the s*-compressibility of classical boundary integral operators in anisotropic wavelet coordinates. Having the s*-compressibility at hand, one can design adaptive wavelet algorithms which are…
The Bonferroni adjustment, or the union bound, is commonly used to study rate optimality properties of statistical methods in high-dimensional problems. However, in practice, the Bonferroni adjustment is overly conservative. The extreme…
Submodular functions and their optimization have found applications in diverse settings ranging from machine learning and data mining to game theory and economics. In this work, we consider the constrained maximization of a submodular…
The paper proposes a new bootstrap approach to the Pesaran, Shin and Smith's bound tests in a conditional equilibrium correction model with the aim to overcome some typical drawbacks of the latter, such as inconclusive inference and…
We propose a spectrum for a class of gauged non-compact G/Ad(H) WZNW models, including spectrally flowed images of highest, lowest, and mixed extremal weight modules. These are combined into blocks whose characters, due to the Lorentzian…
We consider constraints on the S-matrix of any gapped, Lorentz invariant quantum field theory in 1 + 1 dimensions due to crossing symmetry and unitarity. In this way we establish rigorous bounds on the cubic couplings of a given theory with…
In this article, we explore the problem of constructing high-dimensional expanders through the study of relations between expansion constants over different rings. We investigate expansion constants of integer matrices regarded as morphisms…
This paper studies the problem of testing whether a system of linear equality and inequality constraints admits a solution when the coefficients of that system may have to be estimated. We show that a wide range of inferential questions in…
Inference for functional linear models in the presence of heteroscedastic errors has received insufficient attention given its practical importance; in fact, even a central limit theorem has not been studied in this case. At issue,…
We present a new procedure to infer size bounds for integer programs automatically. Size bounds are important for the deduction of bounds on the runtime complexity or in general, for the resource analysis of programs. We show that our…
This paper introduces the notion of upper-linearizable/quadratizable functions, a class that extends concavity and DR-submodularity in various settings, including monotone and non-monotone cases over different convex sets. A general…