2000 character limit reached
Note on a double binomial sum relevant to the Hadamard maximal determinant problem (1309.2795v2)
Published 11 Sep 2013 in math.CO
Abstract: We prove a double binomial sum identity which differs from most binomial sum identities in that the summands involve the absolute value function. The identity is of interest because it can be used in proofs of lower bounds for the Hadamard maximal determinant problem. Our proof of the identity uses a two-variable variant of the method of telescoping sums.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
