1,091 research outputs found

    On the (un)decidability of a near-unanimity term

    Get PDF
    We investigate the near-unanimity problem: given a finite algebra, decide if it has a near-unanimity term of finite arity. We prove that it is undecidable of a finite algebra if it has a partial near-unanimity term on its underlying set excluding two fixed elements. On the other hand, based on Rosenberg’s characterization of maximal clones, we present partial results towards proving the decidability of the general problem

    Semilattices with a group of automorphisms

    Get PDF
    We investigate semilattices expanded by a group F of automorphisms acting as new unary basic operations. We describe up to isomorphism all simple algebras of this kind in case that F is commutative. Finally, we present an example of a simple algebra that does not fit in the previous description, if F is not commutative

    On the number of conjugacy classes of a permutation group

    Get PDF
    We prove that any permutation group of degree n4n \geq 4 has at most 5(n1)/35^{(n-1)/3} conjugacy classes.Comment: 9 page

    Existence theorems for weakly symmetric operations

    Get PDF

    The minimal base size for a p-solvable linear group

    Full text link
    Let VV be a finite vector space over a finite field of order qq and of characteristic pp. Let GGL(V)G\leq GL(V) be a pp-solvable completely reducible linear group. Then there exists a base for GG on VV of size at most 22 unless q4q \leq 4 in which case there exists a base of size at most 33. The first statement extends a recent result of Halasi and Podoski and the second statement generalizes a theorem of Seress. An extension of a theorem of P\'alfy and Wolf is also given.Comment: 11 page

    The endomorphism semiring of a semilattice

    Get PDF
    We prove that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and describe its monolith. The endomorphism semiring is congruence simple if and only if the semilattice has both a least and a largest element

    Quasiequational Theories of Flat Algebras

    Get PDF
    We prove that finite flat digraph algebras and, more generally, finite compatible flat algebras satisfying a certain condition are finitely q-based (possess a finite basis for their quasiequations). We also exhibit an example of a twelve-element compatible flat algebra that is not finitely q-based
    corecore