Skip to main content

Honeycomb-Based Polygonal Chains Aggregation Functions

  • Conference paper
  • First Online:
Information Processing and Management of Uncertainty in Knowledge-Based Systems (IPMU 2022)

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Coleman, M.M.: Fundamentals of Polymer Science: an Introductory Text, 2nd edn. (2019)

    Google Scholar 

  2. Gaulter, B., Gaulter, M.: Further Pure Mathematics. Oxford University Press, Oxford (2001)

    Google Scholar 

  3. 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)

    Google Scholar 

  4. Gillie, A.C.: Binary Arithmetic and Boolean Algebra. McGraw-Hill, New York (1965)

    Google Scholar 

  5. Grabisch, M. (ed.): Aggregation Functions. No. 127 in Encyclopedia of Mathematics and its Applications, Cambridge University Press, Cambridge (2009)

    Google Scholar 

  6. McCrum, N.G., Buckley, C.P., Bucknall, C.B.: Principles of Polymer Engineering, 2nd edn. Oxford University Press, Oxford, New York (1997)

    Google Scholar 

  7. Ndjountche, T.: Digital Electronics 2: Sequential and Arithmetic Logic Circuits. ISTE Ltd/Wiley, Hoboken (2016)

    Book  Google Scholar 

  8. Pettofrezzo, A.J.: Matrices and Transformations. Dover Books on Advanced Mathematics, Dover Publ, New York (1978). Republ. of the 1966 edn

    Google Scholar 

  9. 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

    Article  Google Scholar 

  10. 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)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Grzegorz Moś .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics