{"id":"https://openalex.org/W4415997535","doi":"https://doi.org/10.46298/lmcs-21(4:20)2025","title":"On the Descriptive Complexity of Groups without Abelian Normal Subgroups","display_name":"On the Descriptive Complexity of Groups without Abelian Normal Subgroups","publication_year":2025,"publication_date":"2025-11-07","ids":{"openalex":"https://openalex.org/W4415997535","doi":"https://doi.org/10.46298/lmcs-21(4:20)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:20)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:20)2025","pdf_url":"https://lmcs.episciences.org/16882/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/16882/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5062065155","display_name":"Joshua A. Grochow","orcid":"https://orcid.org/0000-0002-6466-0476"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Joshua A. Grochow","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061484797","display_name":"Michael Levet","orcid":"https://orcid.org/0009-0009-1992-3175"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Levet","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062065155"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33140542,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.616100013256073,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.616100013256073,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.07029999792575836,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0689999982714653,"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/bijection","display_name":"Bijection","score":0.7279000282287598},{"id":"https://openalex.org/keywords/pebble","display_name":"Pebble","score":0.6923999786376953},{"id":"https://openalex.org/keywords/abelian-group","display_name":"Abelian group","score":0.6496999859809875},{"id":"https://openalex.org/keywords/isomorphism","display_name":"Isomorphism (crystallography)","score":0.5809000134468079},{"id":"https://openalex.org/keywords/graph-isomorphism","display_name":"Graph isomorphism","score":0.5002999901771545},{"id":"https://openalex.org/keywords/group","display_name":"Group (periodic table)","score":0.4083999991416931},{"id":"https://openalex.org/keywords/quantifier-elimination","display_name":"Quantifier elimination","score":0.4000000059604645},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.39969998598098755}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7904999852180481},{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.7279000282287598},{"id":"https://openalex.org/C2777760186","wikidata":"https://www.wikidata.org/wiki/Q14673","display_name":"Pebble","level":2,"score":0.6923999786376953},{"id":"https://openalex.org/C136170076","wikidata":"https://www.wikidata.org/wiki/Q181296","display_name":"Abelian group","level":2,"score":0.6496999859809875},{"id":"https://openalex.org/C203436722","wikidata":"https://www.wikidata.org/wiki/Q902950","display_name":"Isomorphism (crystallography)","level":3,"score":0.5809000134468079},{"id":"https://openalex.org/C61665672","wikidata":"https://www.wikidata.org/wiki/Q303100","display_name":"Graph isomorphism","level":4,"score":0.5002999901771545},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4383000135421753},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.430400013923645},{"id":"https://openalex.org/C2781311116","wikidata":"https://www.wikidata.org/wiki/Q83306","display_name":"Group (periodic table)","level":2,"score":0.4083999991416931},{"id":"https://openalex.org/C32278780","wikidata":"https://www.wikidata.org/wiki/Q1849020","display_name":"Quantifier elimination","level":2,"score":0.4000000059604645},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.39969998598098755},{"id":"https://openalex.org/C133142742","wikidata":"https://www.wikidata.org/wiki/Q1200755","display_name":"Descriptive complexity theory","level":3,"score":0.3716000020503998},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.35199999809265137},{"id":"https://openalex.org/C190470478","wikidata":"https://www.wikidata.org/wiki/Q2370229","display_name":"Invariant (physics)","level":2,"score":0.34940001368522644},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32510000467300415},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.3021000027656555},{"id":"https://openalex.org/C2994516854","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Finite graph","level":3,"score":0.2906000018119812},{"id":"https://openalex.org/C2778523021","wikidata":"https://www.wikidata.org/wiki/Q5532504","display_name":"Quantifier (linguistics)","level":2,"score":0.28790000081062317},{"id":"https://openalex.org/C2779483109","wikidata":"https://www.wikidata.org/wiki/Q4681347","display_name":"Additive group","level":3,"score":0.28290000557899475},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.2766999900341034},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.26899999380111694},{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C2777404646","wikidata":"https://www.wikidata.org/wiki/Q1057968","display_name":"Finite group","level":3,"score":0.25440001487731934}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.46298/lmcs-21(4:20)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:20)2025","pdf_url":"https://lmcs.episciences.org/16882/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"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:20)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:20)2025","pdf_url":"https://lmcs.episciences.org/16882/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/G2750457421","display_name":null,"funder_award_id":"CCF-2047756","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5987536167","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8466226040","display_name":"CAREER: Higher-Order Interactions in Tensors and Isomorphism Problems","funder_award_id":"2047756","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G847067134","display_name":null,"funder_award_id":"DMS-1750319","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G90800155","display_name":"Collaborative Research: New Algorithms for Group Isomorphism","funder_award_id":"1750319","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"},{"id":"https://openalex.org/F4320332169","display_name":"Directorate for Computer and Information Science and Engineering","ror":"https://ror.org/025kzpk63"},{"id":"https://openalex.org/F4320332538","display_name":"University of Colorado Boulder","ror":"https://ror.org/02ttsq026"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4415997535.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"In":[0,154],"this":[1,184],"paper,":[2],"we":[3,76,156],"explore":[4],"the":[5,14,17,89,104,160],"descriptive":[6],"complexity":[7],"theory":[8],"of":[9,16,71,126],"finite":[10,58],"groups":[11,119,127,175,191],"by":[12,194],"examining":[13],"power":[15],"second":[18,90],"Ehrenfeucht--Fra\u00efss\u00e9":[19,91],"bijective":[20,92],"pebble":[21,93,105],"game":[22,35,94,106],"in":[23,36,95,103,136,196],"Hella's":[24,96,181],"(Ann.":[25],"Pure":[26],"Appl.":[27],"Log.,":[28],"1989)":[29],"hierarchy.":[30,97],"This":[31],"is":[32,86,101,132,185],"a":[33,68],"Spoiler--Duplicator":[34],"which":[37,75,129],"Spoiler":[38,164],"can":[39,165],"place":[40],"up":[41],"to":[42,88,116,134,168,187],"two":[43,173],"pebbles":[44,110,149],"each":[45,177],"round.":[46,179],"While":[47],"it":[48,53],"trivially":[49],"solves":[50],"graph":[51],"isomorphism,":[52],"may":[54],"be":[55,135],"nontrivial":[56],"for":[57,128],"groups,":[59],"and":[60,111,150,207],"other":[61],"ternary":[62],"relational":[63],"structures.":[64],"We":[65,80,144],"first":[66,161],"provide":[67],"novel":[69],"generalization":[70],"Weisfeiler--Leman":[72],"(WL)":[73],"coloring,":[74],"call":[77],"2-ary":[78,84,201],"WL.":[79],"then":[81],"show":[82,146,157],"that":[83,147,158,189],"WL":[85],"equivalent":[87,186],"Our":[98],"main":[99],"result":[100],"that,":[102],"characterization,":[107],"only":[108,204],"$O(1)$":[109,112],"rounds":[113,152],"are":[114,192],"sufficient":[115],"identify":[117],"all":[118],"without":[120],"Abelian":[121],"normal":[122],"subgroups":[123],"(a":[124],"class":[125],"isomorphism":[130,171],"testing":[131],"known":[133],"$\\mathsf{P}$;":[137],"Babai,":[138],"Codenotti,":[139],"&":[140],"Qiao,":[141],"ICALP":[142],"2012).":[143],"actually":[145],"$7$":[148,151,205,208],"suffice.":[153],"particular,":[155],"within":[159],"few":[162],"rounds,":[163],"force":[166],"Duplicator":[167],"select":[169],"an":[170],"between":[172],"such":[174],"at":[176],"subsequent":[178],"By":[180],"results":[182],"(ibid.),":[183],"saying":[188],"these":[190],"identified":[193],"formulas":[195],"first-order":[197],"logic":[198],"with":[199],"generalized":[200],"quantifiers,":[202],"using":[203],"variables":[206],"quantifier":[209],"depth.":[210]},"counts_by_year":[],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-11-07T00:00:00"}