Polynomial spaces

DOI10.1016/0012-365X(88)90134-3zbMath0735.05079OpenAlexW2911653780MaRDI QIDQ1812526

Chris D. 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)

Related Items

Bounds for sets with few distances distinct modulo a prime ideal ⋮ The covering radius of permutation designs ⋮ An excess theorem for spherical 2-designs ⋮ 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 ⋮ Spherical Designs, Discrepancy and Numerical Integration ⋮ Bounds for codes and designs in complex subspaces ⋮ On upper bounds for code distance and covering radius of designs in polynomial metric spaces ⋮ Rational designs ⋮ Energy bounds for codes in polynomial metric spaces ⋮ Unitary designs and codes ⋮ On designs in compact metric spaces and a universal bound on their size

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An inequality for finite permutation groups
• Distances, graphs and designs
• Distance matrices and \(n\)-dimensional designs
• Intersection theorems with geometric consequences
• On t-designs
• On theory and applications of BIB designs with repeated blocks
• Spherical codes and designs
• Discrete quadrature and bounds on t-designs
• On incidence matrices of finite projective and affine spaces