Take the 2-minute tour ×
MathOverflow is a question and answer site for professional mathematicians. It's 100% free, no registration required.

Consider a criculant symmetric $M$ an $n \times n$ matrix with $0$ and $1$ entries and $r$ entries of $1$ in each row with the diagonal values taken as $1$. I am looking for a $0-1$ vector $v$ with the largest hamming weight such that $ \langle v , \frac{1}{r}Mv \rangle$ $=$ $ \langle v , v \rangle $.

I am also looking for the rate of growth in the hamming weight as $m \rightarrow \infty$, $ \langle v , \frac{1}{r^{m}}M^{\otimes{m}}v \rangle$ $=$ $ \langle v , v \rangle$. What are some good mathematical techniques/tools to study this kind of problems?

share|improve this question

1 Answer 1

up vote 0 down vote accepted

Perhaps I misunderstand, but if $v$ is all ones (and you can't get a bigger Hamming weight than that) then $Mv$ is all $r$, so $(1/r)Mv$ is all ones again, so $(1/r)Mv=v$ and the inner product of $v$ with $(1/r)Mv$ is the inner product of $v$ with $v$.

share|improve this answer
    
I think I am thinking something else. may be I need to rephrase a bit! –  user16007 Nov 20 '11 at 0:12
    
I will probably post another post! Thankyou! –  user16007 Nov 20 '11 at 0:14

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.