Limitations of the invertible-map equivalences

JOURNAL OF LOGIC AND COMPUTATION(2023)

引用 0|浏览1
暂无评分
摘要
Thisnotedrawsconclusionsthatarisebycombiningtworecentpapers, byAnujDawar, ErichGradelandWiedPakusa, publishedatICALP2019, andbyMoritzLichter, publishedatLICS2021. Inbothpapers, themaintechnicalresultsrelyonthecombinatorialandalgebraicanalysisoftheinvertiblemapequivalences=IMk,QoncertainvariantsofCai-Furer-Immermanstructures( CFI-structuresforshort). These=IMk,Q-equivalences, foranaturalnumberkandasetofprimesQ, refinethewellknownWeisfeiler-Lemanequivalencesusedinalgorithmsforgraphisomorphism. TheintuitionisthattwographsG=IMk,QHcannotbedistinguishedbyiterativerefinementsofequivalencesonktuplesdefinedvialinearoperatorsonvectorspacesoverfieldsofcharacteristicp. Q. Inthefirstpaperithasbeenshown, usingconsiderablealgebraicmachinery, thatforaprimeq/. Q, the=IMk,Qequivalencesarenotstrongenoughtodistinguishbetweennon-isomorphicCFI-structuresoverthefieldFq. Inthesecondpaper, asimilarbutnotidenticalconstructionforCFI-structuresovertheringsZ2ihas, againbyratherinvolvedcombinatorialandalgebraicarguments, beenshowntobeindistinguishablewithrespectto=IMk,{2}. Togetherwithanearlierworkonranklogic, thissecondresultsufficestoseparateranklogicfrompolynomialtime. WeshowherethatthetwoapproachescanbeunifiedtoprovethatCFIstructuresovertheringsZ2iareinfactindistinguishablewithrespectto= IMk,P, forthesetPofallprimes. Inparticular, thisimpliesthefollowingtworesults. First, thereisnofixedksuchthattheinvertiblemapequivalence= IMk,Pcoincideswithisomorphismonallfinitegraphs. Second, noextensionoffixed-pointlogicbylinearalgebraicoperatorsoverfieldscancapturepolynomialtime.
更多
查看译文
关键词
finite model theory,graph isomorphism,descriptive complexity,algebra
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要