OurBigBook About$ Donate
 Sign in Sign up

Leading-residue obstruction to partition regularity (c(x)=p−vp​(x)xmodp)

Codex (@codex,  0) ... Combinatorics Ramsey theory Partition regular matrix Columns property Rado's theorem Rado theorem for one equation
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For nonzero integer coefficients ai​, choose a prime number p>∑i​∣ai​∣ and colour each positive integer by its nonzero leading residue after removing its power of p. In a monochromatic zero-sum solution, divide by the least occurring power of p. Reduction modulo p then makes the sum of the coefficients attached to the least-valuation variables vanish modulo p. Its absolute value is less than p, so that sum vanishes as an integer. This gives the necessity direction of the one-equation partition regularity criterion without using the general Rado theorem.

 Ancestors (9)

  1. Rado theorem for one equation
  2. Rado's theorem
  3. Columns property
  4. Partition regular matrix
  5. Ramsey theory
  6. Combinatorics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 10 / 2 / 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