Related papers: Lower bounds for designs in symmetric spaces

Let N(n, t) be the minimal number of points in a spherical t-design on the unit sphere S^n in R^{n+1}. For each n >= 3, we prove a new asymptotic upper bound N(n, t) <= C(n)t^{a_n}, where C(n) is a constant depending only on n, a_3 <= 4,…

A relatively simple algebraic framework is given, in which all the compact symmetric spaces can be described and handled without distinguishing cases. We also give some applications and further results.

Let $X$ be a finite-dimensional normed space and let $Y \subseteq X$ be its proper linear subspace. The set of all minimal projections from $X$ to $Y$ is a convex subset of the space all linear operators from $X$ to $X$ and we can consider…

Suppose Gamma is an S-arithmetic subgroup of a connected, semisimple algebraic group G over a global field Q (of any characteristic). It is well known that Gamma acts by isometries on a certain CAT(0) metric space X_S that is a Cartesian…

We analyze a real one-parameter family of quasiconformal deformations of a hyperbolic rational map known as {\em spinning}. We show that under fairly general hypotheses, the limit of spinning either exists and is unique, or else converges…

In this paper we present a new semidefinite programming hierarchy for covering problems in compact metric spaces. Over the last years, these kind of hierarchies were developed primarily for geometric packing and for energy minimization…

A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…

The concept of spherical $t$-design, which is a finite subset of the unit sphere, was introduced by Delsarte-Goethals-Seidel (1977). The concept of Euclidean $t$-design, which is a two step generalization of spherical design in the sense…

Universal bounds for the potential energy of weighted spherical codes are obtained by linear programming. The universality is in the sense of Cohn-Kumar -- every attaining code is optimal with respect to a large class of potential functions…

The two basic equations satisfied by the parameters of a block design define a three-dimensional affine variety $\mathcal{D}$ in $\mathbb{R}^{5}$. A point of $\mathcal{D}$ that is not in some sense trivial lies on four lines lying in…

We give a short proof, in the tradition of the classical work of de Giorgi and Miranda on flat space, that the reduced boundary of a set of least perimeter in a Riemannian manifold of dimension $\leq 7$ is a smooth minimal hypersurfaces.

Let $G$ be a nonempty bounded domain in a finite-dimensional Euclidean space. The main results are general estimates from below at points from $G$ for an arbitrary subharmonic function $u\not\equiv -\infty$ on the closure of the domain $G$…

This paper develops new tools for understanding surfaces with more than one end (and usually, of infinite topology) which properly minimally embed into Euclidean three-space. On such a surface, the set of ends forms a compact Hausdorff…

We show that closed, immersed, minimal hypersurfaces in a compact symmetric space satisfy a lower bound on the index plus nullity, which depends linearly on their first Betti number. Moreover, if either the minimal hypersurface satisfies a…

A ringed finite space is a ringed space whose underlying topological space is finite. The category of ringed finite spaces contains, fully faithfully, the category of finite topological spaces and the category of affine schemes. Any ringed…

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…

A point set $M$ in $m$-dimensional Euclidean space is called an integral point set if all the distances between the elements of $M$ are integers, and $M$ is not situated on an $(m-1)$-dimensional hyperplane. We improve the linear lower…

Solution and analysis of mathematical programming problems may be simplified when these problems are symmetric under appropriate linear transformations. In particular, a knowledge of the symmetries may help reduce the problem dimension, cut…

We generalize simplicial minisuperspace models associated with restricting the topology of the universe to be that of a cone over a closed connected combinatorial $3-$manifold by considering the presence of a massive scalar field. By…

We consider one dimensional scattering and show how the presence of a mild positive barrier separating the interaction region from infinity implies that the bound and antibound states are symmetric modulo exponentially small errors in 1/h.…