相关论文: On polarization of spherical codes and designs

We study subsets of the $n$-dimensional vector space over the finite field $\mathbb{F}_q$, for odd $q$, which contain either a sphere for each radius or a sphere for each first coordinate of the center. We call such sets radii spherical…

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 study a discrete model of repelling particles, and we show using linear programming bounds that many familiar families of error-correcting codes minimize a broad class of potential energies when compared with all other codes of the same…

In this work, we investigate a stochastic control framework for global optimization over both Euclidean spaces and the Wasserstein space of probability measures, where the objective function may be non-convex and/or non-differentiable. In…

We use a state-of-the-art physics-based model of electromagnetic scattering to analyze average circular polarization ratios measured for the A and B rings of Saturn at a wavelength of 12.6 cm. This model is directly based on the Maxwell…

One of the main problems in random network coding is to compute good lower and upper bounds on the achievable cardinality of the so-called subspace codes in the projective space $\mathcal{P}_q(n)$ for a given minimum distance. The…

We study the optimization of Steklov eigenvalues with respect to a boundary density function $\rho$ on a bounded Lipschitz domain $\Omega \subset \mathbb{R}^N$. We investigate the minimization and maximization of $\lambda_k(\rho)$, the…

We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…

We consider the problem of finding a near ground state of a $p$-spin model with Rademacher couplings by means of a low-depth circuit. As a direct extension of the authors' recent work [Gamarnik, Jagannath, Wein 2020], we establish that any…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

We determine putative optimal packings of regular spherical polygons via optimization on smooth manifolds. For several cases, we establish maximality by extending the Lov\'asz theta number to Cayley graphs on the special orthogonal group…

We consider the following prescribed scalar curvature problem on $ S^N$ (*)$$\left\{\begin{array}{l} - \Delta_{S^N} u + \frac{N(N-2)}{2} u = \tilde{K} u^{\frac{N+2}{N-2}} {on} S^N, u >0 \end{array}\right. $$ where $ \tilde{K}$ is positive…

Polar codes are a family of capacity-achieving codes that have explicit and low-complexity construction, encoding, and decoding algorithms. Decoding of polar codes is based on the successive-cancellation decoder, which decodes in a bit-…

In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…

We consider the classical three-dimensional motion in a potential which is the sum of $n$ attracting or repelling Coulombic potentials. Assuming a non-collinear configuration of the $n$ centres, we find a universal behaviour for all…

This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\tilde{\Omega}(n^2)$ lower bounds for cornerstone problems,…

We report on an update of the test on the rotation of the plane of linear polarization for light traveling over cosmological distances, using a comparison between the measured direction of the UV polarization in 8 radio galaxies at z>2 and…

The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…

We study the minimum mean-squared error for 2-means clustering when the outcomes of the vector-valued random variable to be clustered are on two touching spheres of unit radius in $n$-dimensional Euclidean space and the underlying…

The galaxy M51 was observed using the Mimir instrument on the Perkins telescope to constrain the resolved H-band (1.6 $\mu$m) polarization across the galaxy. These observations place an upper limit of $P_H<0.05%$ on the $H$-band…