Back
  1. Home
  2. Profile of Erkko LEHTONEN (Unilu)
Profil

LEHTONEN Erkko

Main Referenced Co-authors
COUCEIRO, Miguel  (23)
WALDHAUSER, Tamás  (8)
SCHÖLZEL, Karsten  (6)
Szendrei, Ágnes (5)
Foldes, Stephan (4)
Main Referenced Keywords
arity gap (7); Boolean functions (5); clones (5); clone (4); functional equation (4);
Main Referenced Disciplines
Mathematics (44)
Quantitative methods in economics & management (1)
Computer science (1)

Publications (total 44)

The most downloaded
172 downloads
Lehtonen, E. (2006). Descending chains and antichains of the unary, linear, and monotone subfunction relations. Order: A Journal on the Theory of Ordered Sets and its Applications, 23 (2-3), 129-142. doi:10.1007/s11083-006-9036-y https://hdl.handle.net/10993/3267

The most cited

25 citations (Scopus®)

Lehtonen, E. (2006). Descending chains and antichains of the unary, linear, and monotone subfunction relations. Order: A Journal on the Theory of Ordered Sets and its Applications, 23 (2-3), 129-142. doi:10.1007/s11083-006-9036-y https://hdl.handle.net/10993/3267

Couceiro, M., Lehtonen, E., & Schölzel, K. (2015). Set-reconstructibility of Post classes. Discrete Applied Mathematics, 187, 12-18. doi:10.1016/j.dam.2015.02.013
Peer reviewed

Couceiro, M., Lehtonen, E., & Schölzel, K. (2015). A complete classification of equational classes of threshold functions included in clones. RAIRO: Recherche Opérationnelle, 49 (1), 39–66. doi:10.1051/ro/2014034
Peer Reviewed verified by ORBi

Lehtonen, E., Marichal, J.-L., & Teheux, B. (24 June 2014). Associative string functions [Paper presentation]. 52nd Int. Symposium on Functional Equations (ISFE 52), Innsbruck, Austria. doi:10.1007/s00010-015-0391-x

Lehtonen, E., Marichal, J.-L., & Teheux, B. (20 June 2014). Associativity, preassociativity, and string functions [Paper presentation]. 88th Workshop on General Algebra (AAA88), Warsaw, Poland.

Lehtonen, E., & Pilitowska, A. (2014). Generalized entropy in expanded semigroups and in algebras with neutral element. Semigroup Forum. doi:10.1007/s00233-013-9563-y
Peer Reviewed verified by ORBi

Lehtonen, E. (2014). Reconstructing multisets over commutative groupoids and affine functions over nonassociative semirings. International Journal of Algebra and Computation, 24 (1), 11-31. doi:10.1142/S0218196714500027
Peer Reviewed verified by ORBi

Couceiro, M., Lehtonen, E., & Schölzel, K. (2014). Hypomorphic Sperner systems and non-reconstructible functions. Order: A Journal on the Theory of Ordered Sets and its Applications. doi:10.1007/s11083-014-9330-z
Peer reviewed

Couceiro, M., Lehtonen, E., & Schölzel, K. (2013). Sur des classes de fonctions à seuil caractérisables par des contraintes relationnelles. In J.-L. Marichal, N. Essounbouli, ... K. Guelton (Eds.), Actes des 22èmes rencontres francophones sur la Logique Floue et ses Applications, 10-11 octobre 2013, Reims, France (pp. 145-152). Université de Reims Champagne-Ardenne.
Peer reviewed

Couceiro, M., Lehtonen, E., & Schölzel, K. (2013). A complete classification of equational classes of threshold functions included in clones. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/11352.

Couceiro, M., Lehtonen, E., & Schölzel, K. (2013). Set-reconstructibility of Post classes. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/11351.

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2013). Additive decomposability of functions over abelian groups. International Journal of Algebra and Computation, 23 (3), 643-662. doi:10.1142/S0218196713500136
Peer Reviewed verified by ORBi

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2013). Parametrized arity gap. Order: A Journal on the Theory of Ordered Sets and its Applications, 30 (2), 557-572. doi:10.1007/s11083-012-9261-5
Peer reviewed

Lehtonen, E., & Szendrei, Á. (2012). Partial orders induced by quasilinear clones. In J. Czermak, G. Dorfer, G. Eigenthaler, W. B. Müller, ... J. Schoissengeier (Eds.), Proceedings of the Salzburg Conference 2011 (AAA81) (pp. 51-84). Klagenfurt, Austria: Verlag Johannes Heyn.
Peer reviewed

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2012). Decompositions of functions based on arity gap. Discrete Mathematics, 312 (2), 238-247. doi:10.1016/j.disc.2011.08.028
Peer Reviewed verified by ORBi

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2012). The arity gap of order-preserving functions and extensions of pseudo-Boolean functions. Discrete Applied Mathematics, 160 (4-5), 383-390. doi:10.1016/j.dam.2011.07.024
Peer reviewed

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2012). Gap vs. pag. In 42nd IEEE International Symposium on Multiple-Valued Logic (ISMVL 2012) (pp. 268-273). Los Alamitos, United States - California: IEEE Computer Society. doi:10.1109/ISMVL.2012.11
Peer reviewed

Couceiro, M., & Lehtonen, E. (2012). Galois theory for sets of operations closed under permutation, cylindrification and composition. Algebra Universalis, 67 (3), 273-297. doi:10.1007/s00012-012-0184-1
Peer reviewed

Behrisch, M., Couceiro, M., Kearnes, K. A., Lehtonen, E., & Szendrei, Á. (2012). Commuting polynomial operations of distributive lattices. Order: A Journal on the Theory of Ordered Sets and its Applications, 29 (2), 245-269. doi:10.1007/s11083-011-9231-3
Peer reviewed

Couceiro, M., Lehtonen, E., Marichal, J.-L., & Waldhauser, T. (2011). An algorithm for producing median formulas for Boolean functions. In Proc. of the Reed Muller 2011 Workshop (pp. 49-54).
Peer reviewed

Lehtonen, E., & Szendrei, Á. (2011). Clones with finitely many relative R-classes. Algebra Universalis, 65 (2), 109-159. doi:10.1007/s00012-011-0120-9
Peer reviewed

Couceiro, M., & Lehtonen, E. (2011). Self-commuting lattice polynomial functions on chains. Aequationes Mathematicae, 81 (3), 263-278. doi:10.1007/s00010-010-0058-6
Peer Reviewed verified by ORBi

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2011). On equational definability of function classes. In 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011) (pp. 182-186). Los Alamitos, United States - California: IEEE Computer Society. doi:10.1109/ISMVL.2011.19
Peer reviewed

Couceiro, M., Lehtonen, E., & Waldhauser, T. (2011). A survey on the arity gap. In 41st IEEE International Symposium on Multiple-Valued Logic (ISMVL 2011) (pp. 277-281). Los Alamitos, United States - California: IEEE Computer Society. doi:10.1109/ISMVL.2011.20
Peer reviewed

Kwuida, L., & Lehtonen, E. (2011). On the homomorphism order of labeled posets. Order: A Journal on the Theory of Ordered Sets and its Applications, 28 (2), 251-265. doi:10.1007/s11083-010-9169-x
Peer reviewed

Lehtonen, E., & Nešetřil, J. (2010). Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms. European Journal of Combinatorics, 31 (8), 1981-1995. doi:10.1016/j.ejc.2010.05.007
Peer reviewed

Lehtonen, E. (2010). Closed classes of functions, generalized constraints and clusters. Algebra Universalis, 63 (2-3), 203-234. doi:10.1007/s00012-010-0071-6
Peer reviewed

Foldes, S., & Lehtonen, E. (2010). Column-partitioned matrices over rings without invertible transversal submatrices. Ars Combinatoria, 97, 33-39.
Peer reviewed

Lehtonen, E. (2010). A note on minors determined by clones of semilattices. Novi Sad Journal of Mathematics, 40 (3), 75-81.
Peer reviewed

Couceiro, M., & Lehtonen, E. (2010). The arity gap of polynomial functions over bounded distributive lattices. In 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2010) (pp. 113-116). Los Alamitos, United States - California: IEEE Computer Society. doi:10.1109/ISMVL.2010.29
Peer reviewed

Couceiro, M., & Lehtonen, E. (2010). Classes of operations closed under permutation, cylindrification and composition. In 40th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2010) (pp. 117-121). Los Alamitos, United States - California: IEEE Computer Society. doi:10.1109/ISMVL.2010.30
Peer reviewed

Couceiro, M., & Lehtonen, E. (2010). Explicit descriptions of bisymmetric Sugeno integrals. In E. Hüllermeier, R. Kruse, ... F. Hoffmann (Eds.), Computational Intelligence for Knowledge-Based Systems Design (pp. 494-501). Springer-Verlag. doi:10.1007/978-3-642-14049-5_51
Peer reviewed

Lehtonen, E. (2010). Characterization of preclones by matrix collections. Asian-European Journal of Mathematics, 3 (3), 457-473. doi:10.1142/S1793557110000313
Peer Reviewed verified by ORBi

Lehtonen, E., & Szendrei, Á. (2010). The submaximal clones on the three-element set with finitely many relative R-classes. Discussiones Mathematicae. General Algebra and Applications, 30 (1), 7-33.
Peer Reviewed verified by ORBi

Lehtonen, E., & Szendrei, Á. (2009). Equivalence of operations with respect to discriminator clones. Discrete Mathematics, 309 (4), 673-685. doi:10.1016/j.disc.2008.01.003
Peer Reviewed verified by ORBi

Couceiro, M., & Lehtonen, E. (2009). Generalizations of Świerczkowski’s lemma and the arity gap of finite functions. Discrete Mathematics, 309 (20), 5905-5912. doi:10.1016/j.disc.2009.04.009
Peer Reviewed verified by ORBi

Couceiro, M., & Lehtonen, E. (2008). On the arity gap of finite functions: results and applications. In Y. Boudabbous & N. Zaguia (Eds.), Proceedings of the First International Conference on Relations, Orders and Graphs: Interaction with Computer Science (ROGICS '08) (pp. 65-72). Sfax, Tunisia: Nouha Editions.
Peer reviewed

Lehtonen, E. (2008). Labeled posets are universal. European Journal of Combinatorics, 29 (2), 493-506. doi:10.1016/j.ejc.2007.02.005
Peer reviewed

Lehtonen, E. (2007). Operations on Finite Sets, Functional Composition, and Ordered Sets [Doctoral thesis, Tampere University of Technology]. ORBilu-University of Luxembourg. https://orbilu.uni.lu/handle/10993/3319

Couceiro, M., & Lehtonen, E. (2007). On the effect of variable identification on the essential arity of functions on finite sets. International Journal of Foundations of Computer Science, 18 (5), 975-986. doi:10.1142/S012905410700508X
Peer Reviewed verified by ORBi

Couceiro, M., Foldes, S., & Lehtonen, E. (2006). Composition of Post classes and normal forms of Boolean functions. Discrete Mathematics, 306 (24), 3223-3243. doi:10.1016/j.disc.2006.06.014
Peer Reviewed verified by ORBi

Lehtonen, E. (2006). An infinite descending chain of Boolean subfunctions consisting of threshold functions. In Proceedings of the Vienna Conference 2005 (AAA70) (pp. 145-148). Klagenfurt, Austria: Verlag Johannes Heyn.
Peer reviewed

Lehtonen, E. (2006). Descending chains and antichains of the unary, linear, and monotone subfunction relations. Order: A Journal on the Theory of Ordered Sets and its Applications, 23 (2-3), 129-142. doi:10.1007/s11083-006-9036-y
Peer reviewed

Couceiro, M., Foldes, S., & Lehtonen, E. (2005). On the complexity of representing sets of vertices in the n-cube. In C. Tsitouras, T. E. Simos, ... G. Psihoyios (Eds.), ICNAAM 2005 (pp. 876-877). Weinheim, Germany: Wiley-VCH.
Peer reviewed

Couceiro, M., Foldes, S., & Lehtonen, E. (2004). On compositions of clones of Boolean functions. In T. Simos & G. Maroulis (Eds.), International Conference of Computational Methods in Sciences and Engineering 2004 (ICCMSE 2004) (pp. 849-851). VSP/Brill.
Peer reviewed

Contact ORBilu