Polynomial spaces
This important paper generalizes techniques from association schemes and spherical designs to study finite subsets of polynomials spaces. A polynomial space is a set \(\Omega\) with a function \(\rho: \Omega\times\Omega\to {\mathbf R}\) with \(\rho(x,x)=r>0\), \(\rho(x,y)=\rho(y,x)<r\) for \(x\neq y\), such that the zonal functions \(x\to \rho(a,x)\) \((a\in \Omega)\) span a finite-dimensional space. This defines the minimal requirements needed to discuss \(t\)-designs, bounds on subsets with few values of \(\rho\), and relations to association schemes. Particularly interesting is the fact that \(t\)-transitive permutation groups can be viewed (via Burnside's lemma) as \(t\)-designs in the symmetric group.
- An inequality for finite permutation groups
- Discrete quadrature and bounds on t-designs
- Distance matrices and \(n\)-dimensional designs
- Distances, graphs and designs
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 3874093 (Why is no real title available?)
- scientific article; zbMATH DE number 3827893 (Why is no real title available?)
- scientific article; zbMATH DE number 3679037 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- scientific article; zbMATH DE number 3345677 (Why is no real title available?)
- Intersection theorems with geometric consequences
- On incidence matrices of finite projective and affine spaces
- On t-designs
- On theory and applications of BIB designs with repeated blocks
- Spherical codes and designs
- Unitary designs and codes
- The existence of non-trivial hyperfactorizations of \(K_{2n}\)
- Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
- Designs as maximum codes in polynomial metric spaces
- On designs in compact metric spaces and a universal bound on their size
- On upper bounds for code distance and covering radius of designs in polynomial metric spaces
- Bounds for codes and designs in complex subspaces
- Rational designs
- Energy bounds for codes in polynomial metric spaces
- Polynomials and spatial Pick-type theorems
- The covering radius of permutation designs
- Polynomial spaces reproduced by elliptic scaling functions
- Spaces of absolutely summing polynomials
- Spherical Designs, Discrepancy and Numerical Integration
- The space of period polynomials
- An excess theorem for spherical 2-designs
- Bases for polynomial-based spaces
- Bounds for sets with few distances distinct modulo a prime ideal
- Energy bounds for weighted spherical codes and designs via linear programming
This page was built for publication: Polynomial spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812526)
