why is it not really easy to prove Hadamard's conjecture?

Discussion in 'Math Research' started by dfarr --at-- comcast --dot-- net, Apr 19, 2007.

  1. I was reading 'Theory of Algebraic Invariants' by David Hilbert,
    with
    an introduction by Bernd Sturmfels.

    I found this on p. 60.:

    'Theorem ..... A form of order n has a cubic invariant if and only if
    n is
    divisible by four. ....'

    I wondered if there had been any work done on tying a cubic invariant
    of order 4k
    to a Hadamard matrix of order 4k. If this was possible it would prove
    the 'Hadamard conjecture' that a Hadamard matrix exists iff n=2 or
    n=4k.
     
    dfarr --at-- comcast --dot-- net, Apr 19, 2007
    #1
    1. Advertisements

Ask a Question

Want to reply to this thread or ask your own question?

You'll need to choose a username for the site, which only take a couple of moments (here). After that, you can post your question and our members will help you out.