1. Maximal n-generated subdirect products
- Author
-
Joel Berman
- Subjects
Discrete mathematics ,Computer Science::Information Retrieval ,General Mathematics ,Astrophysics::Instrumentation and Methods for Astrophysics ,Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing) ,Upper and lower bounds ,Combinatorics ,Subdirect product ,TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES ,Integer ,Subdirectly irreducible algebra ,Free algebra ,ComputingMethodologies_DOCUMENTANDTEXTPROCESSING ,Computer Science::General Literature ,Equivalence relation ,Variety (universal algebra) ,Finite set ,ComputingMilieux_MISCELLANEOUS ,Mathematics - Abstract
For [Formula: see text] a positive integer and [Formula: see text] a finite set of finite algebras, let [Formula: see text] denote the largest [Formula: see text]-generated subdirect product whose subdirect factors are algebras in [Formula: see text]. When [Formula: see text] is the set of all [Formula: see text]-generated subdirectly irreducible algebras in a locally finite variety [Formula: see text], then [Formula: see text] is the free algebra [Formula: see text] on [Formula: see text] free generators for [Formula: see text]. For a finite algebra [Formula: see text] the algebra [Formula: see text] is the largest [Formula: see text]-generated subdirect power of [Formula: see text]. For every [Formula: see text] and finite [Formula: see text] we provide an upper bound on the cardinality of [Formula: see text]. This upper bound depends only on [Formula: see text] and these basic parameters: the cardinality of the automorphism group of [Formula: see text], the cardinalities of the subalgebras of [Formula: see text], and the cardinalities of the equivalence classes of certain equivalence relations arising from congruence relations of [Formula: see text]. Using this upper bound on [Formula: see text]-generated subdirect powers of [Formula: see text], as [Formula: see text] ranges over the [Formula: see text]-generated subdirectly irreducible algebras in [Formula: see text], we obtain an upper bound on [Formula: see text]. And if all the [Formula: see text]-generated subdirectly irreducible algebras in [Formula: see text] have congruence lattices that are chains, then we characterize in several ways those [Formula: see text] for which this upper bound is obtained.
- Published
- 2016
- Full Text
- View/download PDF