Abstract
We consider sets of (0, +1)-vectors in R n, having exactly s non-zero positions. In some cases we give best or nearly best possible bounds for the maximal number of such vectors if all the pairwise scalar products belong to a fixed set D of integers. The investigated cases include D={ -d, d}, which corresponds to equiangular lines.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.