Related papers: Lower bounds for designs in symmetric spaces
Combinatorial designs have been studied for nearly 200 years. Fifty years ago, Cameron, Delsarte, and Ray-Chaudhury started investigating their q-analogs, also known as subspace designs or designs over finite fields. Designs can be defined…
The index of a Riemannian symmetric space is the minimal codimension of a proper totally geodesic submanifold (Onishchik, 1980). There is a conjecture by the first two authors for how to calculate the index. In this paper we give an…
Polygon spaces have been studied extensively, and yet missing from the literature is a simple property that every polygon has: dimension. This is distinct (possibly) from the dimension of the ambient space in which the polygon lives. A…
We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.
This chapter discusses a general design approach to planning computer experiments, which seeks design points that fill a bounded design region as uniformly as possible. Such designs are broadly referred to as space-filling designs.
A finite set of unlabelled points in Euclidean space is the simplest representation of many real objects from mineral rocks to sculptures. Since most solid objects are rigid, their natural equivalence is rigid motion or isometry maintaining…
The full classification of Riemannian $3$-symmetric spaces is presented. Up to Riemannian products the main building blocks consist in (possibly symmetric) spaces with semisimple isometry group, nilpotent Lie groups of step at most $2$ and…
Motivated by an influential result of Bourgain and Tzafriri, we consider continuous matrix functions $A:\mathbb{R}\to M_{n\times n}$ and lower $\ell_2$-norm bounds associated with their restriction to certain subspaces. We prove that for…
We prove that for any compact manifold of dimension greater than $1$, the set of pseudo-Riemannian metrics having a trivial isometry group contains an open and dense subset of the space of metrics.
We consider universal approximations of symmetric and anti-symmetric functions, which are important for applications in quantum physics, as well as other scientific and engineering computations. We give constructive approximations with…
Biharmonic and conformal-biharmonic maps are two fourth-order generalizations of the well-studied notion of harmonic maps in Riemannian geometry. In this article we consider maps into the Euclidean sphere and investigate a geometric…
We consider mappings satisfying an upper bound for the distortion of families of curves. We establish lower bounds for the distortion of distances under such mappings. As applications, we obtain theorems on the discreteness of the limit…
A classic theorem of Kazhdan and Margulis states that for any semisimple Lie group without compact factors, there is a positive lower bound on the covolume of lattices. H. C. Wang's subsequent quantitative analysis showed that the…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
A map from a manifold to a Euclidean space is said to be k-regular if the image of any distinct k points are linearly in- dependent. For k-regular maps on manifolds, lower bounds of the dimension of the ambient Euclidean space have been…
We study the size of the isometry group Isom(M, g) of Riemannian manifolds (M, g) as g varies. For M not admitting a circle action, we show that the order of Isom(M, g) can be universally bounded in terms of the bounds on Ricci curvature,…
The classical concept of affine locally symmetric spaces allows a generalization for various geometric structures on a smooth manifold. We remind the notion of symmetry for parabolic geometries and we summarize the known facts for…
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in…
We study the smallest possible number of points in a topological space having k open sets. Equivalently, this is the smallest possible number of elements in a poset having k order ideals. Using efficient algorithms for constructing a…
We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…