|国家预印本平台
首页|Classes of finite relational structures over finite languages have dual Ramsey degrees

Classes of finite relational structures over finite languages have dual Ramsey degrees

Classes of finite relational structures over finite languages have dual Ramsey degrees

来源:Arxiv_logoArxiv
英文摘要

Classical Ramsey theory has successfully extended to relational structures, yielding a wealth of results that have profoundly influenced other areas of mathematics. Interestingly, the same development has not occurred in the case of dual Ramsey theory. The main goal of this paper is to advance the dual Ramsey theory for finite relational structures with respect to natural structure-preserving maps. Tools from category theory prove instrumental in this endeavor, as was previously the case for finite algebraic systems where the dual Ramsey property had been established for every class of finite algebras coming from an equationally defined class. One cannot help but feel that dual Ramsey phenomena are deeply connected to categorical strategies.

Aleksa Džuklevski、Dragan Mašulović

数学

Aleksa Džuklevski,Dragan Mašulović.Classes of finite relational structures over finite languages have dual Ramsey degrees[EB/OL].(2025-07-01)[2025-07-16].https://arxiv.org/abs/2407.04030.点此复制

评论