Related papers: The Conformal Packing Problem
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed non-overlapping and orthogonal, i.e., axis-parallel. We present an…
Given $n$ weighted points (positive or negative) in $d$ dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorithm for this problem is based on a reduction to a related…
We study canonical conformal gravity in four dimensions and construct the gauge generators and the associated charges. Using slightly generalized boundary conditions compared to those in \cite{Grumiller:2013mxa} we find that the charges…
We study a natural generalization of the maximum weight many-to-one matching problem. We are given an undirected bipartite graph $G= (A \cup P, E)$ with weights on the edges in $E$, and with lower and upper quotas on the vertices in $P$. We…
We compute asymptotic symmetry algebras of conformal gravity. Due to more general boundary conditions allowed in conformal gravity in comparison to those in Einstein gravity, we can classify the corresponding algebras. The highest algebra…
Consider the classical Bin Packing problem with $d$ different item sizes $s_i$ and amounts of items $a_i.$ The support of a Bin Packing solution is the number of differently filled bins. In this work, we show that the lower bound on the…
We investigate the conformal bootstrap approach to $O(N)$ symmetric CFTs in five dimension with particular emphasis on the lower bound on the current central charge. The bound has a local minimum for all $N>1$, and in the large $N$ limit we…
The calculation of physical quantities in certain quantum field theories such as those of the Argyres-Douglas type is notoriously hard, due to the lack of a Lagrangian description. Here we tackle this problem following two alternative…
The crossing equations of a conformal field theory can be systematically truncated to a finite, closed system of polynomial equations. In certain cases, solutions of the truncated equations place strict bounds on the space of all unitary…
The vector-valued mock modular forms of umbral moonshine may be repackaged into meromorphic Jacobi forms of weight one. In this work we constructively solve two cases of the meromorphic module problem for umbral moonshine. Specifically, for…
In this paper we prove a general result saying that under certain hypothesis an embedding of an affine vertex algebra into an affine $W$--algebra is conformal if and only if their central charges coincide. This result extends our previous…
We formulate the problem of generating dense packings of nonoverlapping, non-tiling polyhedra within an adaptive fundamental cell subject to periodic boundary conditions as an optimization problem, which we call the Adaptive Shrinking Cell…
We formulate new boundary conditions that prove well defined variational principle and finite response functions for conformal gravity (CG). In the Anti--de Sitter/conformal field theory framework, gravity theory that is considered in the…
We study the convex-concave bilinear saddle-point problem $\min_x \max_y f(x) + y^\top Ax - g(y)$, where both, only one, or none of the functions $f$ and $g$ are strongly convex, and suitable rank conditions on the matrix $A$ hold. The…
The zoo of two-dimensional conformal models has been supplemented by a series of nonunitary conformal models obtained by cosetting minimal models. Some of them coincide with minimal models, some do not have even Kac spectrum of conformal…
Cardinality constrained bin packing or bin packing with cardinality constraints is a basic bin packing problem. In the online version with the parameter k \geq 2, items having sizes in (0,1] associated with them are presented one by one to…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
We study the optimal lower and upper complexity bounds for finding approximate solutions to the composite problem $\min_x\ f(x)+h(Ax-b)$, where $f$ is smooth and $h$ is convex. Given access to the proximal operator of $h$, for strongly…
We set up a strategy for studying large families of logarithmic conformal field theories by using the enlarged symmetries and non--semi-simple associative algebras appearing in their lattice regularizations (as discussed in a companion…
Almost four decades ago, Bergman and Milton independently showed that the isotropic effective electric permittivity of a two-phase composite material with a given volume fraction is constrained to lie within lens-shaped regions in the…