{"id":"https://openalex.org/W4411167219","doi":"https://doi.org/10.46298/lmcs-21(2:22)2025","title":"Indivisibility and uniform computational strength","display_name":"Indivisibility and uniform computational strength","publication_year":2025,"publication_date":"2025-06-10","ids":{"openalex":"https://openalex.org/W4411167219","doi":"https://doi.org/10.46298/lmcs-21(2:22)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(2:22)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:22)2025","pdf_url":"https://lmcs.episciences.org/15845/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/15845/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5118174880","display_name":"Kenneth Gill","orcid":null},"institutions":[{"id":"https://openalex.org/I47652572","display_name":"La Salle University","ror":"https://ror.org/02beve479","country_code":"US","type":"education","lineage":["https://openalex.org/I47652572"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kenneth Gill","raw_affiliation_strings":["Department of Mathematics and Computer Science , La Salle University , Philadelphia , PA , USA"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science , La Salle University , Philadelphia , PA , USA","institution_ids":["https://openalex.org/I47652572"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5118174880"],"corresponding_institution_ids":["https://openalex.org/I47652572"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.13868223,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 2","issue":null,"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.5814999938011169,"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.5814999938011169,"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/computer-science","display_name":"Computer science","score":0.5673505067825317}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5673505067825317}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.46298/lmcs-21(2:22)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:22)2025","pdf_url":"https://lmcs.episciences.org/15845/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:doaj.org/article:042f29492ffb4be89dcf2a4f94b28cc7","is_oa":true,"landing_page_url":"https://doaj.org/article/042f29492ffb4be89dcf2a4f94b28cc7","pdf_url":null,"source":{"id":"https://openalex.org/S112646816","display_name":"SHILAP Revista de lepidopterolog\u00eda","issn_l":"0300-5267","issn":["0300-5267","2340-4078"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Logical Methods in Computer Science, Vol Volume 21, Issue 2 (2025)","raw_type":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(2:22)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(2:22)2025","pdf_url":"https://lmcs.episciences.org/15845/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3645597944","display_name":"FRG: Collaborative Research: Computability-Theoretic Aspects of Combinatorics","funder_award_id":"1854107","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411167219.pdf","grobid_xml":"https://content.openalex.org/works/W4411167219.grobid-xml"},"referenced_works_count":19,"referenced_works":["https://openalex.org/W179043391","https://openalex.org/W1757113349","https://openalex.org/W2044009111","https://openalex.org/W2131443763","https://openalex.org/W2148962283","https://openalex.org/W2474654837","https://openalex.org/W2962720709","https://openalex.org/W2963693343","https://openalex.org/W2982356607","https://openalex.org/W3016913989","https://openalex.org/W3091973211","https://openalex.org/W3186877027","https://openalex.org/W4211106290","https://openalex.org/W4212786232","https://openalex.org/W4238689220","https://openalex.org/W4300109956","https://openalex.org/W4391486336","https://openalex.org/W4395034763","https://openalex.org/W4407383728"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"A":[0],"countable":[1],"structure":[2,23],"is":[3,13,113,126],"indivisible":[4,22],"if":[5],"for":[6,49,95,110,124,141],"every":[7],"coloring":[8,109],"with":[9,65],"finite":[10],"range":[11],"there":[12,112],"a":[14,33,36,57,103,108],"monochromatic":[15,104],"isomorphic":[16],"subcopy":[17,34],"of":[18,45,80,101,120,130,138],"the":[19,42,46,52,61,77,92,99,117,121],"structure.":[20],"Each":[21],"naturally":[24],"corresponds":[25],"to":[26],"an":[27],"indivisibility":[28,47,83,93,122],"problem":[29,94,100,123],"which":[30,111],"outputs":[31],"such":[32],"given":[35,107],"presentation":[37],"and":[38,60,115,132],"coloring.":[39],"We":[40,75],"investigate":[41],"Weihrauch":[43,78,118],"complexity":[44],"problems":[48,84],"two":[50,134],"structures:":[51],"rational":[53,105],"numbers":[54],"$\\mathbb{Q}$":[55,96],"as":[56],"linear":[58],"order,":[59],"equivalence":[62,68],"relation":[63],"$\\mathscr{E}$":[64,125],"countably":[66,72],"many":[67,73],"classes":[69],"each":[70],"having":[71],"members.":[74],"separate":[76],"degrees":[79],"both":[81],"corresponding":[82],"from":[85],"several":[86],"benchmarks,":[87],"showing":[88],"in":[89],"particular":[90],"that":[91,116],"cannot":[97],"solve":[98],"finding":[102],"interval":[106],"one;":[114],"degree":[119],"strictly":[127],"between":[128],"those":[129],"$\\mathsf{RT}^2$":[131],"$\\mathsf{SRT}^2$,":[133],"widely":[135],"studied":[136],"variants":[137],"Ramsey's":[139],"theorem":[140],"pairs":[142],"whose":[143],"reverse-mathematical":[144],"separation":[145],"was":[146],"open":[147],"until":[148],"recently.":[149]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}
