MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Szekeres and Turán found in 1937 a formula for the sum of the squares and the sum of the fourth powers of determinants of all $n$ by $n$ matrices with $\pm 1$ entries. (The sum of squares case follows easily from Cauchy-Binet identity.) Later Turán published a simpler proof for the sum of the fourth powers but in Chinese. I vaguely remember that there are simpler probabilistic proofs for both cases.

My question is about simple proofs for these identities, especially the one for 4th powers.

Is there a formula for the 6th power?

share|cite|improve this question
There is a proof of the fourth power result in the Chapter 5 exercises of Enumerative Combinatorics, vol. 2. I don't know how this compares with the argument of Szekeres and Turan. The proof technique completely breaks down for sixth powers. – Richard Stanley Jul 22 '13 at 12:19
@RichardStanley: make that an answer. – Zsbán Ambrus Jul 22 '13 at 15:21
Thanks a lot, Richard! – Gil Kalai Jul 22 '13 at 19:10

This is an answer, but my insight is hardly a mathematical one. Nonetheless, here we go:

The 1955 paper of Turán is, in fact, published in both English and Chinese in the same journal. The Chinese version is pages 411-417 in the journal; the English language version is pages 417 - 423.

Turán writes: "I am pretty sure that on the way one can evaluate $M_n(6)$ or $S_n(6)$ after a little longer calculations and also further." But he doesn't give a formula.

share|cite|improve this answer

Your Answer


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.