2000 character limit reached
Partitioning Hadamard vectors into Hadamard matrices
Published 28 Feb 2016 in math.CO | (1603.00006v1)
Abstract: We will show that in a space of dimension $m$, any family of $2{m-1}$ distinct Hadamard vectors (where you can choose x or -x but not both) can be partitioned into Hadamard matrices if and only if $m=2n$ for some n. We will solve this problem with a simple algorithm for assigning the vectors to the Hadamard matrices.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.