Related papers: The local quantization behavior of absolutely cont…

Given a set $\mathsf{P}$ of $n$ points in $\mathbb{R}^d$, we show how to insert a set $\mathsf{X}$ of $O( n^{1-1/d} )$ additional points, such that $\mathsf{P}$ can be broken into two sets $\mathsf{P}_1$ and $\mathsf{P}_2$, of roughly equal…

Suppose $\Pi$ is an exchangeable random partition of the positive integers and $\Pi_n$ is its restriction to $\{1, ..., n\}$. Let $K_n$ denote the number of blocks of $\Pi_n$, and let $K_{n,r}$ denote the number of blocks of $\Pi_n$…

In the paper, we investigate the following fundamental question. For a set $\mathcal{K}$ in $\mathbb{L}^0(\mathbb{P})$, when does there exist an equivalent probability measure $\mathbb{Q}$ such that $\mathcal{K}$ is uniformly integrable in…

The representation of a given quantity with less information is often referred to as `quantization' and it is an important subject in information theory. In this paper, we have considered absolutely continuous probability measures on unit…

We establish for dual quantization the counterpart of Kieffer's uniqueness result for compactly supported one dimensional probability distributions having a $\log$-concave density (also called strongly unimodal): for such distributions,…

In this note we demonstrate that locally optimal functional quantizers for probability distributions on a Banach space lying in the support of $P$ behave exactly like globally optimal functional quantizers in terms of…

Probabilistic circuits (PCs) enable exact and tractable inference but employ data independent mixture weights that limit their ability to capture local geometry of the data manifold. We propose Voronoi tessellations (VT) as a natural way to…

Let $E$ be a Moran set on $\mathbb{R}^1$ associated with a closed interval $J$ and two sequences $(n_k)_{k=1}^\infty$ and $(\mathcal{C}_k=(c_{k,j})_{j=1}^{n_k})_{k\geq1}$. Let $\mu$ be the infinite product measure (Moran measure) on $E$…

An important quantity associated with a complex polynomial $p(z)$ is $\Vert p \Vert_\infty$, the maximum of its modulus over the unit disc $D$. We prove, $z_* \in D$ is a local maximum of $|p(z)|$ if and only if $a_*$ satisfies,…

The idea that many important classes of signals can be well-represented by linear combinations of a small set of atoms selected from a given dictionary has had dramatic impact on the theory and practice of signal processing. For practical…

In [Y.~K.~Hu, K.~A.~Kopotun, X.~M.~Yu, Constr. Approx. 2000], the authors have obtained a characterization of best $n$-term piecewise polynomial approximation spaces as real interpolation spaces between $L^p$ and some spaces of bounded…

Several algorithms with an approximation guarantee of $O(\log n)$ are known for the Set Cover problem, where $n$ is the number of elements. We study a generalization of the Set Cover problem, called the Partition Set Cover problem. Here,…

Let each of n particles starting at the origin in Z^2 perform simple random walk until reaching a site with no other particles. Lawler, Bramson, and Griffeath proved that the resulting random set A(n) of n occupied sites is (with high…

In the planar one-round discrete Voronoi game, two players $\mathcal{P}$ and $\mathcal{Q}$ compete over a set $V$ of $n$ voters represented by points in $\mathbb{R}^2$. First, $\mathcal{P}$ places a set $P$ of $k$ points, then $\mathcal{Q}$…

Quantization for a probability distribution refers to the idea of estimating a given probability by a discrete probability supported by a finite number of points. In this paper, firstly a general approach to this process is outlined using…

Non-separable $D-$dimensional partial differential Schr\"{o}dinger equations are considered at $D=2$ and $D=3$, with the even-parity local potentials $V(x,y,\ldots)$ which are polynomials of degree four (cusp catastrophe resembling case)…

This paper furthers the long historical examination of and debate on the foundations of quantum mechanics (QM) by presenting two local hidden variable (LHV) rules in the context of the EPRB experiment which violate Bell's inequality, but…

It was recently shown that the lossless compression of a single source $X^n$ is achievable with a notion of strong locality; any $X_i$ can be decoded from a constant number of compressed bits, with a vanishing in $n$ probability of error.…

In this paper we consider the classical maximum set packing problem where set cardinality is upper bounded by $k$. We show how to design a variant of a polynomial-time local search algorithm with performance guarantee $(k+2)/3$. This local…

We study the optimization version of the equal cardinality set partition problem (where the absolute difference between the equal sized partitions' sums are minimized). While this problem is NP-hard and requires exponential complexity to…