Log in

Analysis of Generating Functions for Special Words and Numbers and Algorithms for Computation

  • Published:
Mediterranean Journal of Mathematics Aims and scope Submit manuscript

Abstract

Our aim is to construct and compute efficient generating functions enumerating the k-ary Lyndon words having prime number length which arise in many branches of mathematics and computer science. We prove that these generating functions coincide with the Apostol–Bernoulli numbers and their interpolation functions and obtain other forms of these generating functions including not only the Frobenius–Euler numbers, but also the Fubini type numbers. Moreover, we derive some identities, relations and combinatorial sums including the numbers of the k-ary Lyndon words, the Bernoulli numbers and polynomials, the Stirling numbers and falling factorials. Using these generating functions and recurrence relation for the Apostol–Bernoulli numbers, we give two algorithms to compute these generating functions. Using these algorithms, we compute some infinite series formulas including the number of the k-ary Lyndon words on some special classes of primes with the purpose of providing some numerical evaluations about these generating functions. In addition, we approximate these generating functions by the rational functions of the Apostol–Bernoulli numbers to show that the complexity of the aforementioned algorithms may be decreased by means of approximation method which are illustrated by some numerical evaluations with their plots for varying prime numbers. Finally, using Bell polynomials (i.e., exponential functions) approach to the numbers of Lyndon words, we construct the exponential generating functions for the numbers of Lyndon words. Finally, we define a new family of special numbers related to these special words and investigate some of their fundamental properties.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Thailand)

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

Data Availability Statement

Our manuscript has no associate data.

References

  1. Apostol, T.M.: On the Lerch zeta function. Pac. J. Math. 1, 161–167 (1951)

    MathSciNet  MATH  Google Scholar 

  2. Apostol, T.M.: Introduction to Analytic Number Theory. Narosa Publishing, Springer-Verlag, New York, Heidelberg (1976)

    MATH  Google Scholar 

  3. Aygunes, A.A., Simsek, Y.: Unification of multiple Lerch-zeta type functions. Adv. Stud. Contemp. Math. 21(4), 367–373 (2011)

    MathSciNet  MATH  Google Scholar 

  4. Bell, E.T.: Exponential polynomials. Ann. Math. Second Ser. 35(2), 258–277 (1934)

    MathSciNet  MATH  Google Scholar 

  5. Berndt, B.C.: Ramanujan’s Notebooks Part 1: Sums of Powers, Bernoulli Numbers, and the Gamma Function(Chapter 7). Springer, New York (1985)

    Google Scholar 

  6. Berstel, J., Perrin, D.: The origins of combinatorics on words. Eur. J. Combin. 28, 996–1022 (2007)

    MathSciNet  MATH  Google Scholar 

  7. Bona, M.: Introduction to Enumerative Combinatorics. The McGraw-Hill Companies Inc., New York (2007)

    MATH  Google Scholar 

  8. Boyadzhiev, Kh.N.: Apostol-Bernoulli functions, derivative polynomials, and Eulerian polynomials. Adv. Appl. Discrete Math. 1, 109–122 (2008). ar**v:0710.1124v1

  9. Boyadzhiev, Kh.N.: Exponential polynomials, stirling numbers, and evaluation of some gamma integrals. Abstr. Appl. Anal. 2009, Article ID 168672, 18 pages (2009). https://doi.org/10.1155/2009/168672

    Article  MathSciNet  MATH  Google Scholar 

  10. Buchanan, H.L., Knopfmacher, A., Mays, M.E.: On the cyclotomic identity and related product expansions. Australas. J. Combin. 8, 233–245 (1993)

    MathSciNet  MATH  Google Scholar 

  11. Cevik, A.S., Das, K.C., Cangul, I.C., Maden, A.D.: Minimality over free monoid presentations. hacettepe J. Math. Stat. 43(6), 899–913 (2014)

    MathSciNet  MATH  Google Scholar 

  12. Charalambides, C.A.: Ennumerative Combinatorics. Chapman &Hall/CRC Press, Company, London, New York (2002)

    Google Scholar 

  13. Comtet, L.: Advanced Combinatorics. D. Reidel, Dordrecht (1974)

    MATH  Google Scholar 

  14. Cusick, T.W., Stanica, P.: Cryptographic Boolean Functions and Applications. London Academic Press, Elsevier, London (2009)

    MATH  Google Scholar 

  15. Djordjević, G.B., Milovanović, G.V.: Special Classes of Polynomials. University of Nis Faculty of Technology, Leskovac (2014)

    Google Scholar 

  16. Fredricksen, H., Kessler, I.J.: An algorithm for generating necklaces of beads in two colors. Discrete Math. 61, 181–188 (1986)

    MathSciNet  MATH  Google Scholar 

  17. Fredricksen, H., Maiorana, J.: Necklaces of beads in \(k\) colors and \(k\)-ary de Bruijn sequences. Discrete Math. 23, 207–210 (1978)

    MathSciNet  MATH  Google Scholar 

  18. Glen, A.: A characterization of fine words over a finite alphabet. Theor. Comput. Sci. 391, 51–60 (2008)

    MathSciNet  MATH  Google Scholar 

  19. Good, I.J.: The number of ordering of \(n\) candidates when ties are permitted. Fibonacci Q. 13, 11–18 (1975)

    MathSciNet  MATH  Google Scholar 

  20. Hu, S., Kim, M.S.: Two closed forms for the Apostol–Bernoulli polynomials. ar**v:1509.04190

  21. Jang, L.C., Pak, H.K.: Non-Archimedean integration associated with \(q\)-Bernoulli numbers. Proc. Jangjeon Math. Soc. 5(2), 125–129 (2002)

    MathSciNet  MATH  Google Scholar 

  22. Kang, S.J., Kim, M.H.: Free Lie algebras, generalized Witt formula, and the denominator identity. J. Algebra 183(2), 560–594 (1996)

    MathSciNet  MATH  Google Scholar 

  23. Kim, D.S., Kim, T.: Some new identities of Frobenius–Euler numbers and polynomials. J. Inequal. Appl. 307, 1–10 (2012)

    MathSciNet  MATH  Google Scholar 

  24. Kim, T., Rim, S.H., Simsek, Y., Kim, D.: On the analogs of Bernoulli and Euler numbers, related identities and zeta and \(l\)-functions. J. Korean Math. Soc. 45(2), 435–453 (2008)

    MathSciNet  MATH  Google Scholar 

  25. Kucukoglu, I., Simsek, Y.: On \(k\)-ary Lyndon words and their generating functions. In: The 14th International Conference of Numerical Analysis and Applied Mathematics (ICNAAM2016). AIP Conference Proceedings, 1863, 2017, 30000-1-30000-4 (2017)

  26. Lothaire, M.: Combinatorics on Words, p. 238. Cambridge University Press, Cambridge (1997)

    MATH  Google Scholar 

  27. Lyndon, R.: On Burnside problem I. Trans. Am. Math. Soc. 77, 202–215 (1954)

    MathSciNet  MATH  Google Scholar 

  28. Metropolis, N., Rota, G.C.: Witt vectors and the algebra of necklaces. Adv. Math. 50, 95–125 (1983)

    MathSciNet  MATH  Google Scholar 

  29. Milovanović, G.V., Mitrinović, D.S., Rassias, T.M.: Topics in Polynomials: Extremal Problems, Inequalities. Zeros. World Scientific Publ. Co., Singapore (1994)

    MATH  Google Scholar 

  30. Ozdemir, G., Simsek, Y., Milovanović, G.V.: Generating functions for special polynomials and numbers including Apostol-type and Humbert-type polynomials. Mediterr. J. Math. (2017). https://doi.org/10.1007/s00009-017-0918-6

    Article  MathSciNet  MATH  Google Scholar 

  31. Ozden, H., Simsek, Y., Srivastava, H.M.: A unified presentation of the generating functions of the generalized Bernoulli, Euler and Genocchi polynomials. Comput. Math. Appl. 60, 2779–2787 (2010)

    MathSciNet  MATH  Google Scholar 

  32. Ozden, H., Simsek, Y.: Unified presentation of \(p\)-adic \(L\)-functions associated with unification of the special numbers. Acta Math. Hungar. 144(2), 515–529 (2014)

    MathSciNet  MATH  Google Scholar 

  33. Petrogradsky, V.M.: Witt’s formula for restricted Lie algebras. Adv. Appl. Math. 30, 219–227 (2003)

    MathSciNet  MATH  Google Scholar 

  34. Quaintance, J., Gould, H.W.: Combinatorial Identities for Stirling Numbers (The Unpublished Notes of H.W. Gould). World Scientific Publishing Co., Singapore (2015)

    Google Scholar 

  35. Roman, S.: The Umbral Calculus. Academic Press, New York (1984)

    MATH  Google Scholar 

  36. Ruskey, F., Sawada, J.: An efficient algorithm for generating necklaces with fixed density. SIAM J. Comput. 29(2), 671–684 (1999)

    MathSciNet  MATH  Google Scholar 

  37. Simsek, Y.: \(q\)-Analogue of the twisted \(l\)-series and \(q\)-twisted Euler numbers. J. Number Theory 100(2), 267–278 (2005)

    MathSciNet  MATH  Google Scholar 

  38. Simsek, Y.: Twisted \(p\)-adic \((h, q)\)-\(L\)-functions. Comput. Math. Appl. 59, 2097–2110 (2010)

    MathSciNet  MATH  Google Scholar 

  39. Simsek, Y.: Generating functions for generalized stirling type numbers, array type polynomials, Eulerian type polynomials and their applications. Fixed Point Theory A 2013(87), 1–28 (2013)

    MATH  Google Scholar 

  40. Simsek, Y.: Identities associated with generalized Stirling type numbers and Eulerian type polynomials. Math. Comput. Appl. 18(3), 251–263 (2013)

    MathSciNet  MATH  Google Scholar 

  41. Simsek, Y.: Apostol type Dahee numbers and polynomials. Adv. Stud. Contemp. Math. 26(3), 1–12 (2016)

    MathSciNet  Google Scholar 

  42. Simsek, Y.: On generating functions for the special polynomials. Filomat 31(1), 9–16 (2017)

    MathSciNet  MATH  Google Scholar 

  43. Simsek, Y., Kim, T., Park, D.W., Ro, Y.S., Jang, L.C., Rim, S.H.: An explicit formula for the multiple Frobenius–Euler numbers and polynomials. JP J. Algebra Number Theory Appl. 4(3), 519–529 (2004)

    MathSciNet  MATH  Google Scholar 

  44. Simsek, Y., Yurekli, O., Kurt, V.: On interpolation functions of the twisted generalized Frobenius–Euler numbers. Adv. Stud. Contemp. Math. 15(2), 187–194 (2007)

    MathSciNet  MATH  Google Scholar 

  45. Simsek, Y., Srivastava, H.M.: A family of \(p\)-adic twisted interpolation functions associated with the modified Bernoulli numbers. Appl. Math. Comput. 216, 2976–2987 (2010)

    MathSciNet  MATH  Google Scholar 

  46. Srivastava, H.M.: Some formulas for the Bernoulli and Euler polynomials at rational arguments. Math. Proc. Camb. Philos. Soc. 129, 77–84 (2000)

    MathSciNet  MATH  Google Scholar 

  47. Srivastava, H.M., Manocha, H.L.: A Treatise on Generating Functions. Ellis Horwood Limited Publisher, Chichester (1984)

    MATH  Google Scholar 

  48. Srivastava, H.M., Choi, J.: Series Associated with the Zeta and Related Functions. Kluwer Academic Publishers, Dordrecht (2001)

    MATH  Google Scholar 

  49. Srivastava, H.M., Tomovski, Z., Leskovski, D.: Some families of Mathieu type series and Hurwitz–Lerch Zeta functions and associated probability distributions. Appl. Comput. Math. 14(3), 349–380 (2015). (Special Issue)

    MathSciNet  MATH  Google Scholar 

  50. Srivastava, H.M., Ozden, H., Cangul, I.N., Simsek, Y.: A unified presentation of certain meromorphic functions related to the families of the partial zeta type functions and the \(L\)-functions. Appl. Math. Comput. 219, 3903–3913 (2012)

    MathSciNet  MATH  Google Scholar 

  51. Srivastava, H.M., Choi, J.: Zeta and \(q\)-Zeta Functions and Associated Series and Integrals. Elsevier Science Publishers, Amsterdam (2012)

    MATH  Google Scholar 

  52. Witt, E.: Treue Darstellung Liescher Ringe. J. Reine Angew. Math. 177, 152–160 (1937)

    MathSciNet  MATH  Google Scholar 

  53. https://en.wikipedia.org/wiki/Category:Classes_of_prime_numbers

Download references

Acknowledgements

The research work is supported by the Serbian Academy of Sciences and Arts, \(\Phi \)-96 (G.V. Milovanović) and by the Scientific Research Project Administration of Akdeniz University (Y. Simsek).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Gradimir V. Milovanović.

Ethics declarations

Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Kucukoglu, I., Milovanović, G.V. & Simsek, Y. Analysis of Generating Functions for Special Words and Numbers and Algorithms for Computation. Mediterr. J. Math. 19, 268 (2022). https://doi.org/10.1007/s00009-022-02191-3

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s00009-022-02191-3

Keywords

Mathematics Subject Classification

Navigation