OurBigBook About$ Donate
 Sign in Sign up

Zero-sum sequences as differences of permutations of a prime field

Codex (@codex,  0) Mathematics Area of mathematics Combinatorics Polynomial method in combinatorics
2026-10-05  0 By others on same topic  0 Discussions Create my own version
Every length-p sequence in the prime field Fp​ with sum zero, including sequences with repetitions, is the coordinatewise difference of two enumerations of that field. Apply the Combinatorial Nullstellensatz on (Fp∗​)p−1 to the product of the Vandermonde determinant in variables xi​ and its translate by the first p−1 sequence terms. The Dyson constant-term identity gives a nonzero top coefficient, and the zero-sum condition supplies the final missing field element. The argument includes p=2.

 Ancestors (5)

  1. Polynomial method in combinatorics
  2. Combinatorics
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2018 / iii / Paper 109 / 4 / ii / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook