Related papers: On polarization of spherical codes and designs
In this paper we present two frameworks in which global maximization of a bounded hessian function over a strongly convex set can be reduced to convex optimization. The first presented framework is a continuation of one of our previous…
We establish a majorization-based theory for bounding observables of waves with varied coherence. For any measurement, exact bounds are attained by the maximal and minimal elements in the set of input coherence spectra. The set's supremum…
We study the localization of the poles of the best Mobius approximations for locally univalent functions in the unit disk. Sharp geometric bounds for the pole function are established in terms of Pommerenke's linear invariant orders,…
We obtain universal bounds on the energy of codes and for designs in Hamming spaces. Our bounds hold for a large class of potential functions, allow unified treatment, and can be viewed as a generalization of the Levenshtein bounds for…
Complete determination of the polarisation state of light requires at least four distinct projective measurements of the associated Stokes vector. Stability of state reconstruction, however, hinges on the condition number $\kappa$ of the…
We give a short and elementary proof of an inverse Bernstein-type inequality found by S. Khrushchev for the derivative of a polynomial having all its zeros on the unit circle. The inequality is used to show that equally-spaced points solve…
We use group theoretic ideas and coset space methods to deal with problems in polarization optics of a global nature. These include the possibility of a globally smooth phase convention for electric fields for all points on the Poincar\'{e}…
Let $X$ be any subset of the interval $[-1,1]$. A subset $I$ of the unit sphere in $R^n$ will be called \emph{$X$-avoiding} if $<u,v >\notin X$ for any $u,v \in I$. The problem of determining the maximum surface measure of a $\{ 0…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
We study the relationship between local and global density for sphere packings, and in particular the convergence of packing densities in large, compact regions to the Euclidean limit. We axiomatize key properties of sphere packing bounds…
Spherical coverings on the S2 sphere and their algebraic numbers are given for the putatively optimal global solutions for some n-congruent spherical caps with minimal radius to completely cover the S2 sphere. A few locally optimal…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
We study an optimal M-partition problem for the Yamabe equation on the round sphere, in the presence of some particular symmetries. We show that there is a correspondence between solutions to this problem and least-energy sign-changing…
The general subject considered in this thesis is a recently discovered coding technique, polar coding, which is used to construct a class of error correction codes with unique properties. In his ground-breaking work, Ar{\i}kan proved that…
Some new Frobenius norm bounds of the unique solution to certain structured Sylvester equation are derived. Based on the derived norm upper bounds, new multiplicative perturbation bounds are provided both for subunitary polar factors and…
Based on fundamental properties of light scattering by a particle we reveal the existence of the ultimate upper limit for the light absorption by any partial mode. First, we obtain this result for scattering of a plane wave by a symmetric…
The strongly interacting system created in ultrarelativistic nuclear collisions behaves almost as an ideal fluid with rich patterns of the velocity field exhibiting strong vortical structure. Vorticity of the fluid, via spin-orbit coupling,…
In 2009, Roeglin and Teng showed that the smoothed number of Pareto optimal solutions of linear multi-criteria optimization problems is polynomially bounded in the number $n$ of variables and the maximum density $\phi$ of the semi-random…
We investigate an \(n\)-vector model over \(k\) sites with generic pairwise interactions and spherical constraints. The model is a lifting of the Ising model whereby the support of the spin is lifted to a hypersphere. We show that the…
This paper investigates universal polar coding schemes. In particular, a notion of ordering (called convolutional path) is introduced between probability distributions to determine when a polar compression (or communication) scheme designed…