Complex spherical codes with three inner products

DOI10.1007/S00454-018-0017-XMaRDI QIDQ1991087zbMATH OpenOpenAlexWikidataFDO

Authors Hiroshi Nozaki, Sho Suda

Publication date 30 October 2018

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

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

zbMATH Keywords

\(s\)-distance setassociation schemecomplex spherical \(s\)-codeextremal set theorygraph representationtight design

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph representations (geometric and intersection representations, etc.) (05C62) Extremal set theory (05D05) Association schemes, strongly regular graphs (05E30)

Abstract: Let $X$ be a finite set in a complex sphere of $d$ dimension. Let $D(X)$ be the set of usual inner products of two distinct vectors in $X$. A set $X$ is called a complex spherical $s$-code if the cardinality of $D(X)$ is $s$ and $D(X)$ contains an imaginary number. We would like to classify the largest possible $s$-codes for given dimension $d$. In this paper, we consider the problem for the case $s=3$. Roy and Suda (2014) gave a certain upper bound for the cardinalities of $3$-codes. A $3$-code $X$ is said to be tight if $X$ attains the bound. We show that there exists no tight $3$-code except for dimensions $1$, $2$. Moreover we make an algorithm to classify the largest $3$-codes by considering representations of oriented graphs. By this algorithm, the largest $3$-codes are classified for dimensions $1$, $2$, $3$ with a current computer.

Recommendations

• Complex spherical codes with two inner products
• scientific article; zbMATH DE number 2154097
• scientific article; zbMATH DE number 800361
• scientific article; zbMATH DE number 1057745
• scientific article; zbMATH DE number 1341365

Cites work

• A characterization of skew Hadamard matrices and doubly regular tournaments
• A geometrical characterization of strongly regular graphs
• A survey on spherical designs and algebraic combinatorics on spheres
• Bounds on three- and higher-distance sets
• Certain distance-regular digraphs and related rings of characteristic 4
• Complex spherical codes with two inner products
• Complex spherical designs and codes
• Distance-regular digraphs of girth 4
• Distance-transitive and distance-regular digraphs
• Factoring polynomials and the knapsack problem
• scientific article; zbMATH DE number 3884178 (Why is no real title available?)
• scientific article; zbMATH DE number 3827893 (Why is no real title available?)
• scientific article; zbMATH DE number 3785004 (Why is no real title available?)
• scientific article; zbMATH DE number 3234139 (Why is no real title available?)
• Minimal Euclidean representations of graphs
• New Bounds for Spherical Two-Distance Sets
• New maximal two-distance sets
• On tight spherical designs
• Polynomial Minimum Root Separation
• Practical graph isomorphism. II.
• Spherical codes and designs
• Spherical two-distance sets
• Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3
• Symmetric informationally complete quantum measurements
• The nonexistence of certain tight spherical designs
• Tight spherical designs. I
• Upper bounds for \(s\)-distance sets and equiangular lines

Cited in

(4)

• scientific article; zbMATH DE number 1995821 (Why is no real title available?)
• Complex spherical codes with two inner products
• On the multiplicities of digraph eigenvalues
• Pseudo-Euclidean representations of switching classes of Johnson and Hamming graphs with minimal dimension

Describes a project that uses

Uses Software

• nauty
• Traces

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

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