<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-discrete-mathematical-sciences-and-cryptography</journal-id>
      <journal-title-group>
        <journal-title>Journal of Discrete Mathematical Sciences and Cryptography</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0065</issn>
      <issn publication-format="print">0972-0529</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JDMSC-2491</article-id>
      <title-group>
        <article-title>Application of the Möbius function in algebraic structures for combinatorial number theory</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <name>
            <surname>Sharma</surname>
            <given-names>Chetan Kumar</given-names>
          </name>
          <aff>Department of School of Sciences, Noida International University, Greater Noida, Uttar Pradesh, 203201, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Chintamani</surname>
            <given-names>Bhupesh</given-names>
          </name>
          <aff>Symbiosis Law School Pune (SLS-P), Symbiosis Centre for Advanced Legal Studies and Research, Symbiosis International (Deemed University), Pune, Maharashtra, 411014, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Kolekar</surname>
            <given-names>Vikas</given-names>
          </name>
          <aff>Department of Computer Engineering, Vishwakarma Institute of Technology, Pune, Maharashtra, 411037, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Nanda</surname>
            <given-names>Simranjeet</given-names>
          </name>
          <aff>Centre of Research Impact and Outcome, Chitkara University, Rajpura, Punjab, 140417, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sundari</surname>
            <given-names>P. N.</given-names>
          </name>
          <aff>Department of Computer Science and Engineering, KKR and KSR Institute of Technology and Sciences, Guntur, Andhra Pradesh, 522017, India</aff>
        </contrib>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Mittal</surname>
            <given-names>Aman</given-names>
          </name>
          <aff>Mittal School of Business, Lovely Professional University, Phagwara, Punjab, 144411, India</aff>
        </contrib>
      </contrib-group>
      <volume>29</volume>
      <issue>2-A</issue>
      <fpage>515</fpage>
      <lpage>522</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>12</month>
        <year>2025</year>
      </pub-date>
      <abstract>
        <p>The Möbius function is an important arithmetic function in number theory. It’s also very important to the examiner of algebraic patterns and combinatorial mathematics. Further to conventional range principle, it may be utilized in algebraic geometry, organization precept, and combinatorial extensive variety idea, among different things. These examine looks at the many approaches the Möbius function is probably used in combinatorial contexts. It is mainly used to observe partition characteristics, listing lattice factors, and turn sums over divisor features. The Möbius characteristic helps us find strong inversion formulae and hyperlinks that provide brief combinatory computation. As an instance, the Möbius inversion component simplifies the extraction of values from summitry traits. We additionally show how the Möbius feature interacts with algebraic systems such earrings and fields to provide a better know-how of how combinatorial gadgets are assembled. Examining those connections these days no longer only we could us research more approximately combinatorial arithmetic; it also gives us fresh thoughts to cope with tough issues in quantity concept. The paper also discusses advanced cryptography applications, zeta features, and partition principle’s Möbius characteristic involvement. </p>
      </abstract>
      <kwd-group>
        <kwd>Möbius function</kwd>
        <kwd>Combinatorial number theory</kwd>
        <kwd>Algebraic structures</kwd>
        <kwd>Partition functions</kwd>
        <kwd>Möbius inversion</kwd>
        <kwd>Cryptography</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
