Complex spherical codes with two inner products

DOI10.1016/J.EJC.2015.07.016zbMATH Open1321.05034arXiv1503.01575OpenAlexW2963497750MaRDI QIDQ499503FDOQ499503

Authors: Hiroshi Nozaki, Sho Suda 

Publication date: 30 September 2015

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Abstract: A finite set $X$ in a complex sphere is called a complex spherical $2$-code if the number of inner products between two distinct vectors in $X$ is equal to $2$. In this paper, we characterize the tight complex spherical $2$-codes by doubly regular tournaments, or skew Hadamard matrices. We also give certain maximal 2-codes relating to skew-symmetric $D$-optimal designs. To prove them, we show the smallest embedding dimension of a tournament into a complex sphere by the multiplicity of the smallest or second-smallest eigenvalue of the Seidel matrix.

Full work available at URL: https://arxiv.org/abs/1503.01575

Recommendations

• Complex spherical codes with three inner products
• Supplementary difference sets related to a certain class of complex spherical 2-codes
• Complex spherical designs and codes
• scientific article; zbMATH DE number 2154097
• scientific article; zbMATH DE number 2237360

zbMATH Keywords

tournamentsskew-symmetric \(D\)-optimal designs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30)

Cites Work

• A survey on spherical designs and algebraic combinatorics on spheres
• Spherical codes and designs
• Tight spherical designs. I
• Determinantenabschätzungen für binäre Matrizen. (Estimation of determinants for binary matrices)
• Doubly regular tournaments are equivalent to skew Hadamard matrices
• Maximum planar sets that determine \(k\) distances
• Classification of three-distance sets in two dimensional Euclidean space
• Uniqueness of maximum planar five-distance sets
• A characterization of skew Hadamard matrices and doubly regular tournaments
• Spherical two-distance sets
• An upper bound for the cardinality of an s-distance subset in real Euclidean space. II
• Supplementary difference sets and D-optimal designs for n\(\equiv 2\) mod 4
• New maximal two-distance sets
• Automorphisms and enumeration of switching classes of tournaments
• Classification of Hadamard matrices of order 24 and 28
• New Bounds for Spherical Two-Distance Sets
• On Hadamard's inequality for the determinants of order non-divisible by 4
• Complex spherical designs and codes
• Title not available (Why is that?)
• Bounds on three- and higher-distance sets
• Minimal Euclidean representations of graphs

Cited In (5)

• Complex spherical codes with three inner products
• Supplementary difference sets related to a certain class of complex spherical 2-codes
• Title not available (Why is that?)
• On the multiplicities of digraph eigenvalues
• Numerical computation of triangular complex spherical designs with small mesh ratio

This page was built for publication: Complex spherical codes with two inner products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499503)