Skip to main content
Log in

A polynomial characterization of congruence classes

  • Published:
algebra universalis Aims and scope Submit manuscript

Abstract.

Let \({\cal V}\) be a regular and permutable variety and \( {\cal A}=(A,F)\in {\cal V}\). Let \(\emptyset\neq C \subseteq A \). We get an explicit list L of polynomials such that C is a congruence class of some \( \theta \in Con\, A \) iff C is closed under all terms of L. Moreover, if \({\cal V}\) is a finite similarity type, L is finite. If also \( {\cal A \in {\cal V} \) is finite, all polynomials of L can be considered to be unary. We get a formula for the estimation of card L. The problem of deciding whether C is a congruence class of a finite algebra is in NP but for \( {\cal A \in {\cal V} \) it is in P.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received May 24, 1996; accepted in final form November 26, 1996.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bělohlávek, R., Chajda, I. A polynomial characterization of congruence classes. Algebra univers. 37, 235–242 (1997). https://doi.org/10.1007/s000120050015

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s000120050015

Keywords

Navigation