Abstract
Honeycomb-based structures appear in many scientific fields. Moreover, the number of such structures increases every day. Thus, new methods of analysis are needed. The aggregation functions are one of such methods. They are widely examined for numbers and considered for other objects, e.g., strings and graphs. This paper introduces a new way of representing the simplest structures based on a honeycomb grid with binary sequences. The invariance with respect to rotation and reflection is examined.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Coleman, M.M.: Fundamentals of Polymer Science: an Introductory Text, 2nd edn. (2019)
Gaulter, B., Gaulter, M.: Further Pure Mathematics. Oxford University Press, Oxford (2001)
Gagolewski, M.: Data Fusion: Theory, Methods, and Applications. No. 7 in Monograph Series: Information Technologies: Research and their Interdisciplinary Applications. Institute of Computer Science, Polish Academy of Sciences, Warsaw (2015)
Gillie, A.C.: Binary Arithmetic and Boolean Algebra. McGraw-Hill, New York (1965)
Grabisch, M. (ed.): Aggregation Functions. No. 127 in Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge (2009)
McCrum, N.G., Buckley, C.P., Bucknall, C.B.: Principles of Polymer Engineering, 2nd edn. Oxford University Press, Oxford, New York (1997)
Ndjountche, T.: Digital Electronics 2: Sequential and Arithmetic Logic Circuits. ISTE Ltd/Wiley, Hoboken (2016)
Pettofrezzo, A.J.: Matrices and Transformations. Dover Books on Advanced Mathematics, Dover Publ, New York (1978). Republ. of the 1966 edn
Wang, Z.: Recent advances in novel metallic honeycomb structure. Compos. B Eng. 166, 731–741 (2019). https://doi.org/10.1016/j.compositesb.2019.02.011
Witek, H.A., Moś, G., Chou, C.P.: Zhang-Zhang polynomials of regular 3-and 4-tier benzenoid strips. MATCH Commun. Math. Comput. Chem. 73(2), 427–442 (2015)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Moś, G. (2022). Honeycomb-Based Polygonal Chains Aggregation Functions. In: Ciucci, D., et al. Information Processing and Management of Uncertainty in Knowledge-Based Systems. IPMU 2022. Communications in Computer and Information Science, vol 1601. Springer, Cham. https://doi.org/10.1007/978-3-031-08971-8_32
Download citation
DOI: https://doi.org/10.1007/978-3-031-08971-8_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-08970-1
Online ISBN: 978-3-031-08971-8
eBook Packages: Computer ScienceComputer Science (R0)