{"id":"https://openalex.org/W7152542775","doi":"https://doi.org/10.1016/j.ipl.2026.106641","title":"Running maximum of a k-regular sequence","display_name":"Running maximum of a k-regular sequence","publication_year":2026,"publication_date":"2026-04-09","ids":{"openalex":"https://openalex.org/W7152542775","doi":"https://doi.org/10.1016/j.ipl.2026.106641"},"language":"en","primary_location":{"id":"doi:10.1016/j.ipl.2026.106641","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ipl.2026.106641","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.ipl.2026.106641","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133260175","display_name":"Jeffrey Shallit","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Jeffrey Shallit","raw_affiliation_strings":["School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada"],"raw_orcid":"https://orcid.org/0000-0003-1197-3820","affiliations":[{"raw_affiliation_string":"School of Computer Science, University of Waterloo, Waterloo, ON N2L 3G1, Canada","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5116265220","display_name":"Elise Vandomme","orcid":null},"institutions":[{"id":"https://openalex.org/I157674565","display_name":"University of Li\u00e8ge","ror":"https://ror.org/00afp2z80","country_code":"BE","type":"education","lineage":["https://openalex.org/I157674565"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"\u00c9lise Vandomme","raw_affiliation_strings":["HEC Li\u00e8ge - Management School, University of Li\u00e8ge, Rue Louvrex 14, 4000 Li\u00e8ge, Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"HEC Li\u00e8ge - Management School, University of Li\u00e8ge, Rue Louvrex 14, 4000 Li\u00e8ge, Belgium","institution_ids":["https://openalex.org/I157674565"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5133260175"],"corresponding_institution_ids":["https://openalex.org/I151746483"],"apc_list":{"value":2040,"currency":"USD","value_usd":2040},"apc_paid":{"value":2040,"currency":"USD","value_usd":2040},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.59498956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"194","issue":null,"first_page":"106641","last_page":"106641"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.337799996137619,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.337799996137619,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.24879999458789825,"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/T12069","display_name":"Commutative Algebra and Its Applications","score":0.06710000336170197,"subfield":{"id":"https://openalex.org/subfields/2602","display_name":"Algebra and Number Theory"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.8127999901771545},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6909999847412109},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.6880999803543091},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.65420001745224},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4410000145435333},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.3124000132083893}],"concepts":[{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.8127999901771545},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6909999847412109},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.6880999803543091},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.65420001745224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6473000049591064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6255000233650208},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4410000145435333},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.385699987411499},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3675000071525574},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.3124000132083893},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.30149999260902405},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2667999863624573},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2581999897956848},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.2540999948978424}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.ipl.2026.106641","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ipl.2026.106641","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:orbi.ulg.ac.be:2268/343863","is_oa":true,"landing_page_url":"https://orbi.uliege.be/handle/2268/343863","pdf_url":"https://orbi.uliege.be/bitstream/2268/343863/1/Running_maximum_of_a_k_regular_sequence.pdf","source":{"id":"https://openalex.org/S4306400651","display_name":"Open Repository and Bibliography (University of Li\u00e8ge)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I157674565","host_organization_name":"University of Li\u00e8ge","host_organization_lineage":["https://openalex.org/I157674565"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Information Processing Letters, 106641 (2026-04)","raw_type":"http://purl.org/coar/resource_type/c_6501"}],"best_oa_location":{"id":"doi:10.1016/j.ipl.2026.106641","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.ipl.2026.106641","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8796710418","display_name":null,"funder_award_id":"2024-03725","funder_id":"https://openalex.org/F4320334593","funder_display_name":"Natural Sciences and Engineering Research Council of Canada"}],"funders":[{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W2083770519","https://openalex.org/W2109887555","https://openalex.org/W2162155683","https://openalex.org/W2165135131","https://openalex.org/W2334577267","https://openalex.org/W2586229828","https://openalex.org/W3196415228","https://openalex.org/W4210391712","https://openalex.org/W4237380730","https://openalex.org/W4390597749","https://openalex.org/W4402521850"],"related_works":[],"abstract_inverted_index":{"The":[0],"k":[1,70,78],"-regular":[2,71],"sequences":[3],"form":[4],"a":[5,64,69],"large":[6],"class":[7,20],"studied":[8],"in":[9],"number":[10],"theory,":[11],"combinatorics,":[12],"and":[13,37],"other":[14],"parts":[15],"of":[16,68],"discrete":[17],"mathematics.":[18],"This":[19],"is":[21,42,76],"known":[22],"to":[23],"be":[24],"closed":[25,44],"under":[26,45],"many":[27],"natural":[28],"operations,":[29],"such":[30],"as":[31],"term-by-term":[32],"sum,":[33,36],"product,":[34],"running":[35,46,74],"so":[38],"forth,":[39],"but":[40],"it":[41],"not":[43,77],"maximum.":[47],"Proving":[48],"the":[49,53],"previously-known":[50],"counterexample,":[51],"involving":[52],"Stern":[54],"sequence,":[55],"required":[56],"intricate":[57],"arguments.":[58],"In":[59],"this":[60],"note,":[61],"we":[62],"construct":[63],"significantly":[65],"simpler":[66],"example":[67],"sequence":[72],"whose":[73],"maximum":[75],"-regular.":[79]},"counts_by_year":[],"updated_date":"2026-07-23T08:03:31.855105","created_date":"2026-04-10T00:00:00"}