Related papers: Small union with large set of centers

We point out that the location of renormalon singularities in theory on a circle-compactified spacetime $\mathbb{R}^{d-1} \times S^1$ (with a small radius $R \Lambda \ll 1$) can differ from that on the non-compactified spacetime…

We introduce a class of automorphisms of compact quantum groups which may be thought of as inner automorphisms and explore the behaviour of normal subgroups of compact quantum groups under these automorphisms. We also define the notion of…

Assume that the interval $I=[0,1)$ is partitioned into finitely many intervals $I_1,\dots,I_r$ and consider a map $T\colon I\to I$ so that $T_{\vert I_s}$ is a translation for each $1 \le s \le r$. We do not assume that the images of these…

We study global solutions to the thin obstacle problem with at most quadratic growth at infinity. We show that every ellipsoid can be realized as the contact set of such a solution. On the other hand, if such a solution has a compact…

We propose a new class of space-filling designs called rotated sphere packing designs for computer experiments. The approach starts from the asymptotically optimal positioning of identical balls that covers the unit cube. Properly scaled,…

There are sequences of directions such that, given any compact set K in R^n, the sequence of iterated Steiner symmetrals of K in these directions converges to a ball. However examples show that Steiner symmetrization along a sequence of…

Let $S$ be a set of $n$ weighted points in the plane and let $R$ be a query range in the plane. In the range closest pair problem, we want to report the closest pair in the set $R \cap S$. In the range minimum weight problem, we want to…

Correlation Clustering is an elegant model that captures fundamental graph cut problems such as Min $s-t$ Cut, Multiway Cut, and Multicut, extensively studied in combinatorial optimization. Here, we are given a graph with edges labeled $+$…

We study scalar conformal field theories whose large $N$ spectrum is fixed by the operator dimensions of either Ising model or Lee-Yang edge singularity. Using numerical bootstrap to study CFTs with $S_N\otimes Z_2$ symmetry, we find a…

This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…

A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…

We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…

Starting from a solution of the problem of a mechanical oscillator coupled to a scalar field inside a reflecting sphere of radius $R$, we study the behaviour of the system in free space as the limit of an arbitrarily large radius in the…

The Busemann-Petty problem asks whether origin symmetric convex bodies in $\R^n$ with smaller hyperplane sections necessarily have smaller volume. The answer is affirmative if $n\leq 3$ and negative if $n\geq 4.$ We consider a class of…

A clone on a set X is a set of finitary operations on X which contains all projections and which is moreover closed under functional composition. Ordering all clones on X by inclusion, one obtains a complete algebraic lattice, called the…

In a classic paper Schr\"oder posed four combinatorial problems about the number of certain types of bracketings of words and sets. Here we address what these bracketings look like on average. For each of the four problems we prove that a…

This paper describes a predictive control method to search for unstable periodic orbits of the generalized tent map. The invariant set containing periodic orbits is a repelling set with a complicated Cantor-like structure. Therefore, a…

Spectral clustering is sensitive to how graphs are constructed from data particularly when proximal and imbalanced clusters are present. We show that Ratio-Cut (RCut) or normalized cut (NCut) objectives are not tailored to imbalanced data…

We consider the problem of computing the data-cube marginals of a fixed order $k$ (i.e., all marginals that aggregate over $k$ dimensions), using a single round of MapReduce. The focus is on the relationship between the reducer size (number…

A typical computational geometry problem begins: Consider a set P of n points in R^d. However, many applications today work with input that is not precisely known, for example when the data is sensed and has some known error model. What if…