Polynomial spaces

DOI10.1016/0012-365X(88)90134-3MaRDI QIDQ1812526zbMATH OpenOpenAlexFDO

Authors Chris Godsil

Publication date 25 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(88)90134-3

zbMATH Keywords

\(t\)-designspolynomial space\(t\)-transitive permutation groups

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Cites work

• 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?)
• An inequality for finite permutation groups
• Discrete quadrature and bounds on t-designs
• Distance matrices and \(n\)-dimensional designs
• Distances, graphs and designs
• 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

Cited in

(18)

• Polynomial spaces reproduced by elliptic scaling functions
• Multilinear polynomials and Frankl-Ray-Chaudhuri-Wilson type intersection theorems
• Bounds for codes and designs in complex subspaces
• Bounds for sets with few distances distinct modulo a prime ideal
• Bases for polynomial-based spaces
• Spherical Designs, Discrepancy and Numerical Integration
• An excess theorem for spherical 2-designs
• Energy bounds for codes in polynomial metric spaces
• Rational designs
• Polynomials and spatial Pick-type theorems
• The existence of non-trivial hyperfactorizations of \(K_{2n}\)
• The space of period polynomials
• On upper bounds for code distance and covering radius of designs in polynomial metric spaces
• The covering radius of permutation designs
• Spaces of absolutely summing polynomials
• On designs in compact metric spaces and a universal bound on their size
• Designs as maximum codes in polynomial metric spaces
• Unitary designs and codes

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)