Related papers: Lower bounds for projective designs, cubature form…
A recursive construction is presented for the projective cubature formulas of index $p$ on the unit spheres $S(m,K)\subset K^m$ where $K$ is $R$ or $C$, or $H$. This yields a lot of new upper bounds for the minimal number of nodes…
The isometric embeddings $\ell_{2;K}^m\to\ell_{p;K}^n$ ($m\geq 2$, $p\in 2\N$) over a field $K\in{R, C, H}$ are considered, and an upper bound for the minimal $n$ is proved. In the commutative case ($K\neq H$) the bound was obtained by…
Cubature formulas and geometrical designs are described in terms of reproducing kernels for Hilbert spaces of functions on the one hand, and Markov operators associated to orthogonal group representations on the other hand. In this way,…
We derive general linear programming bounds for spherical $(k,k)$-designs. This includes lower bounds for the minimum cardinality and lower and upper bounds for minimum and maximum energy, respectively. As applications we obtain a universal…
We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…
We study cubature formulas for d-dimensional integrals with an arbitrary symmetric weight function of tensor product form. We present a construction that yields a high polynomial exactness: for fixed degree l=5 or l=7 and large dimension,…
We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…
We investigate universal bounds on spherical codes and spherical designs that could be obtained using Delsarte's linear programming methods. We give a lower estimate for the LP upper bound on codes, and an upper estimate for the LP lower…
We show that every spherical 2-Dupin submanifold that is not a hypersurface is conformally congruent to the standard embedding of the real, complex, quaternionic or octonionic projective plane. We also classify 2-CPC, 2-umbilical and weakly…
It is verified that the number of vertices in a $d$-dimensional cubical pseudomanifold is at least $2^{d+1}$. Using Adin's cubical $h$-vector, the generalized lower bound conjecture is established for all cubical 4-spheres, as well as for…
An $L$-spherical code is a set of Euclidean unit vectors whose pairwise inner products belong to the set $L$. We show, for a fixed $\alpha,\beta>0$, that the size of any $[-1,-\beta]\cup\{\alpha\}$-spherical code is at most linear in the…
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds…
We provide integral curvature bounds for compact Riemannian manifolds that allow isometric immersions into a Euclidean space with low codimension in terms of the Betti numbers.
We construct cubature formulas on spheres supported by homothetic images of shells in some Euclidian lattices. Our analysis of these cubature formulas uses results from the theory of modular forms. Examples are worked out on the sphere of…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
We derive universal lower and upper bounds for max-min and min-max problems (also known as polarization) for the potential of spherical $(k,k)$-designs and provide certain examples, including unit-norm tight frames, that attain these…
Positive cubature rules of degree 4 and 5 on the $d$-dimensional simplex are constructed and used to construct cubature rules of index 8 or degree 9 on the unit sphere. The latter ones lead to explicit isometric embedding among the…
We prove that the integral of scalar curvature over a Riemannian manifold is uniformly bounded below in terms of its dimension, upper bounds on sectional curvature and volume, and a lower bound on injectivity radius. This is an analogue of…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…
Function values are, in some sense, "almost as good" as general linear information for $L_2$-approximation (optimal recovery, data assimilation) of functions from a reproducing kernel Hilbert space. This was recently proved by new upper…