2013•International Journal of Algebra and ComputationRequires access

ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS

Dragan Mašulović

Open publisher page 4 citations

Abstract

In 2006, Cameron and Nešetřil introduced the following variant of homogeneity: we say that a structure is homomorphism-homogeneous if every homomorphism between finitely generated substructures of the structure extends to an endomorphism of the structure. In several recent papers homomorphism-homogeneous objects in some well-known classes of algebras have been described (e.g. monounary algebras and lattices), while finite homomorphism-homogeneous groups were described in 1979 under the name of finite quasi-injective groups. In this paper we show that, in general, deciding homomorphism-homogeneity for finite algebras with finitely many fundamental operations and with at least one at least binary fundamental operation is coNP-complete. Therefore, unless P = coNP, there is no feasible characterization of finite homomorphism-homogeneous algebras of this kind.

About this research paper

What this paper is about

In 2006, Cameron and Nešetřil introduced the following variant of homogeneity: we say that a structure is homomorphism-homogeneous if every homomorphism between finitely generated substructures of the structure extends to an endomorphism of the structure. In several recent papers homomorphism-homogeneous objects in some well-known classes of algebras have been described (e.g. monounary algebras and lattices), while finite homomorphism-homogeneous groups were described in 1979 under the name of finite quasi-injective groups. In this paper we show that, in general, deciding homomorphism-homogeneity for finite algebras with finitely many fundamental operations and with at least one at least binary fundamental operation is coNP-complete. Therefore, unless P = coNP, there is no feasible characterization of finite homomorphism-homogeneous algebras of this kind.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In 2006, Cameron and Nešetřil introduced the following variant of homogeneity: we say that a structure is homomorphism-homogeneous if every homomorphism between finitely generated substructures of the structure extends to an endomorphism of the structure. In several recent papers homomorphism-homogeneous objects in some well-known classes of algebras have been described (e.g. monounary algebras and lattices), while finite homomorphism-homogeneous groups were described in 1979 under the name of finite quasi-injective groups. In this paper we show that, in general, deciding homomorphism-homogeneity for finite algebras with finitely many fundamental operations and with at least one at least binary fundamental operation is coNP-complete. Therefore, unless P = coNP, there is no feasible characterization of finite homomorphism-homogeneous algebras of this kind.

Key concepts: Homomorphism, Mathematics, Homogeneity (statistics), Homogeneous, Algebra homomorphism, Injective function, Pure mathematics, Discrete mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
ON THE COMPLEXITY OF DECIDING HOMOMORPHISM-HOMOGENEITY FOR FINITE ALGEBRAS — Research Paper | ScholarLens