Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Problem 1198
claims/: The 1 claim page of Problem 1198, one per claimant's result; the problem's standing derives from them.
Statement. If is -coloured then must there exist an infinite set such that all expressions of the shape
for disjoint (excluding the trivial expressions ) are the same colour?
Formulation. The site's wording as accessed 2026-09-18 (page last edited 17 April 2026). The expressions are Erdős's "multilinear expressions formed from the 's" ([Er80], p. 104): sums of products over pairwise disjoint nonempty finite sets of indices, excluding the single-term products themselves (the case , ; the thread's reading is ). The elements need not lie in the class: Erdős separately notes that "A further complication arises if we also insist that should also belong to the same class" ([Er80], p. 104), and the thread's first comment records that the site's wording was revised on this point in April 2026. The case in which every is a singleton is Hindman's theorem (Theorem 3.1 of [Hi74], p. 9; Problem 532), as the commentary says; the finite question for sums and products of distinct elements is Problem 172.
Status. Disproved. The status-defining source is a refereed theorem of Smith [Sm95] (J. Combin. Theory Ser. A 72 (1995), no. 1, 77--94), not held here, from which two comments of the site's thread (16 April 2026) deduce a -coloring of under which no infinite has all its multilinear expressions in one class; the deduction is rewritten below as an authored derivation from Smith's statements as the thread quotes them, and it is elementary given those statements. The site adopted the disproof, crediting the counterexample to Smith [Sm95] in its commentary (page last edited 17 April 2026), and the community database records it (24 April 2026). The claim page Smith 1995 records the theorem, the thread's deduction and the acceptance evidence; the frontmatter standing is derived from it. Smith's paper is not held, although the Crossref record carries the publisher's open-archive license, and the statements used from Smith are the thread's restatements, second-hand and marked as such below. The thread's first comment judged Hindman's 1980 theorem [Hi80] not to settle the problem. Erdős's own guess was "no", "but no counterexample is in sight" ([Er80], p. 104).
Source. erdosproblems.com/1198, accessed 2026-09-18: the problem page (DISPROVED, with the site's note that it is solved in the negative; last edited 17 April 2026; source key [Er80, p.104]; commentary citing [Hi74], [Sm95] and Problems 532 and 172, with additional thanks to Aron Bhalla and Wouter van Doorn), its four-comment discussion thread (all of 16 April 2026) and its empty proof-claim tab. Cite as: T. F. Bloom, Erdős Problem #1198, https://www.erdosproblems.com/1198, accessed 2026-09-18.
References.
- [Er80] Erdős, P., A survey of problems in combinatorial number theory. Ann. Discrete Math. 6 (1980), 89--115; Section 5, p. 104. Library home: erdos_1980_survey_problems_combinatorial_number_theory.
- [Er77c] Erdős, P., Problems and results on combinatorial number theory. III. Number theory day (Proc. Conf., Rockefeller Univ., New York, 1976), Lecture Notes in Math. 626, Springer (1977), 43--72; p. 58, the 1977 form of the question. Library home: erdos_1977_problems_results_combinatorial_number_theory_iii.
- [Hi74] Hindman, N., Finite sums from sequences within cells of a partition of . J. Combin. Theory Ser. A 17 (1974), no. 1, 1--11, doi:10.1016/0097-3165(74)90023-5. The singleton case: Theorem 3.1, p. 9, gives for every finite partition of the positive integers a cell and a sequence all of whose finite sums of distinct terms lie in that cell; the paper treats sums only, never products. Open access in the publisher's archive. Library home: hindman_1974_finite_sums_sequences_within_cells_partition_n and its theorem_3_1 page; Baumgartner's short proof is compiled on Problem 532's page.
- [Sm95] Smith, G. L., Partitions and ( and ) sums of products. J. Combin. Theory Ser. A 72 (1995), no. 1, 77--94, doi:10.1016/0097-3165(95)90029-2 (published October 1995 per the Crossref record; zbMATH 0868.05005, whose review text is not served). Not held; the Crossref record lists the publisher's open-archive license (from 2013), so a browser download should be possible. Its Theorem 3.17 and its two-cell theorem for are restated second-hand from the thread.
- [Sm01] Smith, G. L., Partitions and ( and ) sums of products---two cell partition. SIAM J. Discrete Math. (2001), doi:10.1137/S0895480198349014. Context (a later two-cell paper by the same author, found among the works citing [Sm95]); not held, not read.
- [Hi80] Hindman, N., Partitions and sums and products---two counterexamples. J. Combin. Theory Ser. A 29 (1980), no. 1, 113--120, doi:10.1016/0097-3165(80)90052-7. Theorem 2.14, p. 117, is the two-coloring result the thread's first comment restates: a two-cell partition of such that no infinite has all its finite products and pairwise sums in . Open access in the publisher's archive. Library home: hindman_1980_partitions_sums_products_two_counterexamples and its theorem_2_14 page.
- [Gr26] Griffin, C., Infinite sum-product configurations in parallel. arXiv:2605.24751v1 (23 May 2026). A lead citing [Sm95]; abstract read only.
Formalization. None. No file ErdosProblems/1198.lean existed in
formal-conjectures (main) on 2026-09-18; the site's page says "Formalised
statement? No", and the community database (9 September 2026) records the
problem disproved (last updated 24 April 2026), not formalized, with no
formal proof.
Current assessment
The question (site formulation of 2026-09-18). The statement above; DISPROVED, with the site's note that it is solved in the negative, last edited 17 April 2026. The commentary records that the case in which every is a singleton is the Graham--Rothschild conjecture proved by Hindman [Hi74] (Problem 532), repeats Erdős's guess that the answer is no although no counterexample was in sight, credits the counterexample to Smith [Sm95] and points to Problem 172. The thread, four comments of 16 April 2026, oldest first: (1) the account Woett, later marked by its author as superseded by the updated problem statement and remarks: the page had misquoted Hindman's 1980 paper, whose relevant result is a -coloring of such that for every infinite the set is not monochromatic (the seven-color result reducing the middle set to pairwise products), which does not settle the problem because it requires itself in the class; the comment reads Erdős's "multilinear expressions" as excluding the and expects a counterexample to exist. (2) Woett again, crediting ChatGPT with pointing to Smith's paper: with and in Smith's notation there is a -coloring of such that for any infinite and some finite product and some sum of two finite products (all indices distinct); the comment then takes an arbitrary infinite and puts and , which it says yields a counterexample to the problem; marked as addressed by a site update. (3) The account AronBhalla, restating Smith: with the set of sums of increasing block-products of a sequence, Theorem 3.17 gives, for any distinct , a partition of into cells that separates the corresponding -systems; taking , and yields a -coloring of in which no color class contains both an and an , and the comment observes that this answers the multilinear formulation directly, since and consist of multilinear expressions. (4) Woett agreeing. The proof-claim tab is empty. The community's AI-contributions wiki (last updated 30 June 2026) lists the 16 April 2026 contribution as partial results found; the deduction on the site is the commenters' own.
The origin. [Er80], p. 104: "Some time ago, I thought of the following fascinating problem: Divide the integers into two classes. Is it true that there always is an infinite sequence so that all the multilinear expressions formed from the 's are all in the same class. One would perhaps guess that the answer must be 'no' but no counterexample is in sight." The next paragraph poses a "much weaker conjecture", an infinite sequence with all sums and products in one class, adds that "A further complication arises if we also insist that should also belong to the same class", records Graham's and Hindman's for the pattern and ends "(Recently Hindman found some very interesting counterexamples.)" [Er77c], p. 58, has the 1977 form: after asking for a sequence with all finite sums and all finite products in one class ("At this moment the problem is open"), "More generally one can ask: Is there an infinite sequence so that all the multilinear expressions formed from the a's are in the same class? One would perhaps guess that the answer is no but no counter example is in sight."
Smith's theorem (second-hand). Smith's paper was not read; the zbMATH record serves no review text and the Crossref and OpenAlex records carry no abstract, so the statements below are the thread's restatements and nothing more. (a) Theorem 3.17, as comment (3) states it: for distinct there is a partition of into cells such that no cell contains both an -set and an -set for , where is the set of sums of increasing block-products of a sequence ; the reading used below is that an "increasing block-product" sum is with finite nonempty index sets , every element of below every element of . (b) The two-cell statement for , as comment (2) states it: a -coloring of such that for any infinite and some finite product of distinct elements of is outside and some sum of two finite products of distinct elements of (all indices distinct) is outside .
Authored derivation (made here; valid given the statements above). Suppose is infinite and all its multilinear expressions lie in one color class . From (a) with , , : every element of is with disjoint blocks , a multilinear expression with , and every element of is one with ; so contains both an -set and an -set, which the coloring of (a) forbids. From (b): put and ; is infinite and increasing. A finite product is over a set of indices, a multilinear expression with and , not a trivial ; a sum with all indices distinct is a multilinear expression with . If , every product of the 's lies in , against (b); if , every such sum of two products lies in , against (b). Either way no such exists, so the answer to the site's question is no. Both routes use only that the configurations named above are multilinear expressions of other than single terms; nothing about Smith's proof is used or checked. By contrast, when every is a singleton the expressions are the finite sums, which Hindman's theorem makes monochromatic for some infinite ; the products are what destroy the partition regularity.
Hindman's theorem (first-hand). Theorem 2.14 of [Hi80] (p. 117): "It is not the case that there exist in and in such that ", where is an explicit partition of defined on p. 115 from the positions of binary digits, is the set of infinite subsets of , over the finite non-empty , and (Definition 2.1, p. 114). This is the result the thread's first comment restates in its own notation, and the printed statement is equivalent to that restatement. The comment judged it not to settle the problem because the theorem requires itself inside the cell. Under the site's wording before April 2026, with the required in the class, the theorem applies directly.
Search scope (2026-09-18 UTC). None of the routes below found a text of Smith's theorem beyond the thread's quotations, a dispute of the deduction, or a second source for the disproof.
- The site: problem page, discussion thread and proof-claim tab; the formal-conjectures directory listing (no file); the community database as of 9 September 2026.
- Crossref record for [Sm95] (JCTA 72 (1995), no. 1, 77--94, October 1995; open-archive license from 17 July 2013); the zbMATH Open record (0868.05005; "contents unavailable due to conflicting licenses") and the OpenAlex record (no abstract; open access at the publisher); the publisher's full-text download link, which did not serve the file.
- Semantic Scholar's list of works citing [Sm95] (six records: [Sm01], two
editions of a textbook on Ramsey theory on the integers, a 2009 topology
paper, a 2002 survey chapter on the algebra of , and [Gr26];
titles read, [Gr26]'s abstract read through the arXiv API); the arXiv API
query
abs:"sums of products" AND (abs:partition OR abs:colouring OR abs:coloring) AND abs:Hindman(two records, neither on this problem). - The primary sources, to the depth stated above: [Er80] p. 104 and [Er77c] p. 58; [Hi74] p. 9; [Hi80] pp. 113--115 and 117--118.
Not searched: MathSciNet, Google Scholar, X. Not held: [Sm95], [Sm01].
Remaining gaps. (1) Smith's theorem is second-hand: the definition of and the two statements are as the thread quotes them, and the derivation from them is valid only for those statements; the reopening condition is Smith's text read (JCTA 72 (1995), 77--94; the open-archive license suggests a browser download). (2) No formal statement exists; the derivation from Smith's statements is authored here. (3) Theorem 3.1 of Hindman's 1974 paper (p. 9) and Theorem 2.14 of his 1980 paper (p. 117) are read first-hand, the latter's proof (pp. 117--118) for structure only and not checked. (4) [Sm01], a two-cell paper by the same author, was not read and may give a more direct two-cell theorem.
Linked library material
These entries are derived from explicit links on library pages. They are navigation only and do not by themselves record mathematical progress.
- erdos_1977_problems_results_combinatorial_number_theory_iii
- erdos_1980_survey_problems_combinatorial_number_theory
- baumgartner_1974_short_proof_hindman_theorem
- baumgartner_1974_short_proof_hindman_theorem / theorem_1
- erdos_1976_problems_results_combinatorial_number_theory_ii
- erdos_1976_problems_results_combinatorial_number_theory_ii / problem_p290
- graham_rothschild_1971_ramseys_theorem_n_parameter_sets
- graham_rothschild_1971_ramseys_theorem_n_parameter_sets / question_9_ii
- hindman_1974_finite_sums_sequences_within_cells_partition_n
- hindman_1974_finite_sums_sequences_within_cells_partition_n / theorem_3_1
- hindman_1980_partitions_sums_products_two_counterexamples
- hindman_1980_partitions_sums_products_two_counterexamples / theorem_2_14