In this article we describe the construction of discrete functions such that some of their values specify (generate) arbitrary pairs of literals under two mutually exclusive assumptions: the function is equal to one of the variables or to its negation. We prove the existence of such functions with at least seven arguments and show that for sufficiently large n this function can be defined on O(n log2 n) tuples. We also consider the problem of simultaneous generation of k literals. We show that with k < n − log2 n+log2(log3 4−1), functions generating arbitrary k literals exist, and if (n−log2 n−k) → ∞ as n → ∞ , then almost all functions generate arbitrary k literals.
Similar content being viewed by others
References
A. A. Voronenko, “Universal partial functions for a class of linear functions,” Diskretnaya Matematika, 24, No. 3, 62–65 (2012).
A. A. Voronenko, “Generation of false images of linear k -valued functions,” Prikl. Matem. Informat., MAKS Press, Moscow, No. 48, 85–92 (2015).
A. A. Voronenko and V. S. Fedorova, “Generation of Boolean functions under monotonicity assumption,” Vvestnik MGU, ser. 15: Vychisl. Mat. Kibern., No. 1, 46–47 (2013).
V. B. Alekseev, Lectures in Discrete Mathematics. A Textbook [in Russian], Izd. MGU, Moscow (2004).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Prikladnaya Matematika i Informatika, No. 50, 2015, pp. 56–61.
Rights and permissions
About this article
Cite this article
Voronenko, A.A. Generation of Images of Several Literals. Comput Math Model 27, 439–443 (2016). https://doi.org/10.1007/s10598-016-9334-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10598-016-9334-1