Varieties with few subalgebras of powers

Author:

Berman Joel,Idziak Paweł,Marković Petar,McKenzie Ralph,Valeriote Matthew,Willard Ross

Abstract

The Constraint Satisfaction Problem Dichotomy Conjecture of Feder and Vardi (1999) has in the last 10 years been profitably reformulated as a conjecture about the set S P fin ( A ) \sf {SP}_\textsf {fin}(\mathbf {A}) of subalgebras of finite Cartesian powers of a finite universal algebra A \mathbf {A} . One particular strategy, advanced by Dalmau in his doctoral thesis (2000), has confirmed the conjecture for a certain class of finite algebras A \mathbf {A} which, among other things, have the property that the number of subalgebras of A n \mathbf {A}^n is bounded by an exponential polynomial. In this paper we characterize the finite algebras A \mathbf {A} with this property, which we call having few subpowers, and develop a representation theory for the subpowers of algebras having few subpowers. Our characterization shows that algebras having few subpowers are the finite members of a newly discovered and surprisingly robust Maltsev class defined by the existence of a special term we call an edge term. We also prove some tight connections between the asymptotic behavior of the number of subalgebras of A n \mathbf {A}^n and some related functions on the one hand, and some standard algebraic properties of A \mathbf {A} on the other hand. The theory developed here was applied to the Constraint Satisfaction Problem Dichotomy Conjecture, completing Dalmau’s strategy.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Reference26 articles.

1. Polynomial interpolation and the Chinese remainder theorem for algebraic systems;Baker, Kirby A.;Math. Z.,1975

2. Generative complexity in algebra;Berman, Joel;Mem. Amer. Math. Soc.,2005

3. Learning intersection-closed classes with signatures;Bulatov, Andrei;Theoret. Comput. Sci.,2007

4. A simple algorithm for Mal′tsev constraints;Bulatov, Andrei;SIAM J. Comput.,2006

5. Classifying the complexity of constraints using finite algebras;Bulatov, Andrei;SIAM J. Comput.,2005

Cited by 70 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Finite algebras with Hom-sets of polynomial size;Transactions of the American Mathematical Society;2024-09-10

2. Algebraic Approach to Approximation;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

3. Exact-m-majority terms;Mathematica Slovaca;2024-04-01

4. CLAP: A New Algorithm for Promise CSPs;SIAM Journal on Computing;2023-01-25

5. Between an n-ary and an n + 1-ary near-unanimity term;International Journal of Algebra and Computation;2022-10-31

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3