{"id":"https://openalex.org/W1983956520","doi":"https://doi.org/10.1215/00294527-1626518","title":"A Simple Proof and Some Difficult Examples for Hindman's Theorem","display_name":"A Simple Proof and Some Difficult Examples for Hindman's Theorem","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1983956520","doi":"https://doi.org/10.1215/00294527-1626518","mag":"1983956520"},"language":"en","primary_location":{"id":"doi:10.1215/00294527-1626518","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1626518","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-1/A-Simple-Proof-and-Some-Difficult-Examples-for-Hindmans-Theorem/10.1215/00294527-1626518.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-1/A-Simple-Proof-and-Some-Difficult-Examples-for-Hindmans-Theorem/10.1215/00294527-1626518.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047471753","display_name":"Henry Towsner","orcid":"https://orcid.org/0000-0001-7993-5148"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Henry Towsner","raw_affiliation_strings":["Department of Mathematics University of Connecticut U-3009 196 Auditorium Road Storrs CT 06269-3009 USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics University of Connecticut U-3009 196 Auditorium Road Storrs CT 06269-3009 USA","institution_ids":["https://openalex.org/I140172145"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047471753"],"corresponding_institution_ids":["https://openalex.org/I140172145"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.06799436,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"53","issue":"1","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9850000143051147,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9781000018119812,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.6709088087081909},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6408218145370483},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.6395701169967651},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4657491147518158},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45488619804382324},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3641588091850281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1791979968547821}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.6709088087081909},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6408218145370483},{"id":"https://openalex.org/C112291201","wikidata":"https://www.wikidata.org/wiki/Q1336170","display_name":"Ramsey theory","level":2,"score":0.6395701169967651},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4657491147518158},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45488619804382324},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3641588091850281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1791979968547821},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1215/00294527-1626518","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1626518","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-1/A-Simple-Proof-and-Some-Difficult-Examples-for-Hindmans-Theorem/10.1215/00294527-1626518.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0906.3885","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0906.3885","pdf_url":"https://arxiv.org/pdf/0906.3885","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:1983956520","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/0906.3885.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:oai:CULeuclid:euclid.ndjfl/1336586237","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.ndjfl/1336586237","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.740.1359","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.740.1359","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0906.3885.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.0906.3885","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0906.3885","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1215/00294527-1626518","is_oa":true,"landing_page_url":"https://doi.org/10.1215/00294527-1626518","pdf_url":"https://projecteuclid.org/journals/notre-dame-journal-of-formal-logic/volume-53/issue-1/A-Simple-Proof-and-Some-Difficult-Examples-for-Hindmans-Theorem/10.1215/00294527-1626518.pdf","source":{"id":"https://openalex.org/S78544662","display_name":"Notre Dame Journal of Formal Logic","issn_l":"0029-4527","issn":["0029-4527","1939-0726"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315698","host_organization_name":"Duke University Press","host_organization_lineage":["https://openalex.org/P4310315698","https://openalex.org/P4310315572"],"host_organization_lineage_names":["Duke University Press","Duke University"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Notre Dame Journal of Formal Logic","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1983956520.pdf","grobid_xml":"https://content.openalex.org/works/W1983956520.grobid-xml"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W1556453281","https://openalex.org/W1996285409","https://openalex.org/W1997681421","https://openalex.org/W2033215939","https://openalex.org/W2065510397","https://openalex.org/W4235431357","https://openalex.org/W4254764017"],"related_works":["https://openalex.org/W2769392855","https://openalex.org/W2962863029","https://openalex.org/W2012106622","https://openalex.org/W2543836030","https://openalex.org/W2963872185","https://openalex.org/W2737409423","https://openalex.org/W2095445050","https://openalex.org/W2328737477","https://openalex.org/W2528652753","https://openalex.org/W3005416293","https://openalex.org/W3164193279","https://openalex.org/W2226201251","https://openalex.org/W3037190989","https://openalex.org/W2894659136","https://openalex.org/W2060782772","https://openalex.org/W1846297281","https://openalex.org/W2962726502","https://openalex.org/W1691668264","https://openalex.org/W2016227329","https://openalex.org/W2330963367"],"abstract_inverted_index":{"We":[0,31],"give":[1,32],"a":[2],"short,":[3],"explicit":[4],"proof":[5],"of":[6,14,23,35,37],"Hindman's":[7,47],"Theorem":[8],"that":[9],"in":[10],"every":[11],"finite":[12,25],"coloring":[13],"the":[15,28,38],"integers,":[16],"there":[17],"is":[18],"an":[19],"infinite":[20],"set":[21],"all":[22],"whose":[24],"sums":[26],"have":[27,43],"same":[29],"color.":[30],"several":[33],"exampls":[34],"colorings":[36],"integers":[39],"which":[40],"do":[41],"not":[42],"computable":[44],"witnesses":[45],"to":[46],"Theorem.":[48]},"counts_by_year":[],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}