Abstract
We shed some new light to the problem of characterizing those functions of several arguments that have a unique identification minor. The 2-set-transitive functions are known to have this property. We describe another class of functions that have a unique identification minor, namely functions determined by the order of first occurrence. We also present some examples of other kinds of functions with a unique identification minor. These examples have a relatively small arity.
Similar content being viewed by others
References
Berman, J., Kisielewicz, A.: On the number of operations in a clone. Proc. Amer. Math. Soc. 122, 359–369 (1994)
Bouaziz, M., Couceiro, M., Pouzet, M.: Join-irreducible Boolean functions. Order 27, 261–282 (2010)
Grech, M., Kisielewicz, A.: Symmetry groups of Boolean functions. European J. Combin. 40, 1–10 (2014)
Horváth, E. K., Makay, G., Pöschel, R., Waldhauser, T.: Invariance groups of finite functions and orbit equivalence of permutation groups. Open Math. 13, 83–95 (2015)
Kisielewicz, A.: Symmetry groups of Boolean functions and constructions of permutation groups. J. Algebra 199, 379–403 (1998)
Lehtonen, E.: Totally symmetric functions are reconstructible from identification minors. Electron. J. Combin. 21(2), #P2.6 (2014)
Lehtonen, E., Marichal, J.-L., Teheux, B.: Associative string functions. Asian-Eur. J. Math. 7(4), 1450059, 18pp (2014)
Author information
Authors and Affiliations
Corresponding author
Additional information
This work was developed within the FCT Project PEst-OE/MAT/UI0143/2014 of CAUL, FCUL and CEMAT, IST.
Rights and permissions
About this article
Cite this article
Lehtonen, E. On Functions with a Unique Identification Minor. Order 33, 71–80 (2016). https://doi.org/10.1007/s11083-015-9352-1
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11083-015-9352-1