Loading [MathJax]/jax/output/CommonHTML/jax.js
World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

Maximal n-generated subdirect products

    https://doi.org/10.1142/S0218196716500065Cited by:0 (Source: Crossref)

    For n a positive integer and K a finite set of finite algebras, let L(n,K) denote the largest n-generated subdirect product whose subdirect factors are algebras in K. When K is the set of all n-generated subdirectly irreducible algebras in a locally finite variety 𝒱, then L(n,K) is the free algebra F𝒱(n) on n free generators for 𝒱. For a finite algebra A the algebra L(n,{A}) is the largest n-generated subdirect power of A. For every n and finite A we provide an upper bound on the cardinality of L(n,{A}). This upper bound depends only on n and these basic parameters: the cardinality of the automorphism group of A, the cardinalities of the subalgebras of A, and the cardinalities of the equivalence classes of certain equivalence relations arising from congruence relations of A. Using this upper bound on n-generated subdirect powers of A, as A ranges over the n-generated subdirectly irreducible algebras in 𝒱, we obtain an upper bound on |F𝒱(n)|. And if all the n-generated subdirectly irreducible algebras in 𝒱 have congruence lattices that are chains, then we characterize in several ways those 𝒱 for which this upper bound is obtained.

    Communicated by K. Kearnes

    AMSC: 08A40, 08B20, 08B26, 03C05, 05A15, 68Q25