On asymptotic behavior of Dirichlet inverse

Show simple item record
dc.contributor.authorBaustian, Falko
dc.contributor.authorBobkov, Vladimír
dc.date.accessioned2020-11-02T11:00:17Z
dc.date.available2020-11-02T11:00:17Z
dc.date.issued2020
dc.description.abstract-translatedLet f(n) be an arithmetic function with f(1)≠0 and let f−1(n) be its reciprocal with respect to the Dirichlet convolution. We study the asymptotic behavior of ∣∣f−1(n)∣∣ with regard to the asymptotic behavior of |f(n)| assuming that the latter one grows or decays with at most polynomial or exponential speed. As a by-product, we obtain simple but constructive upper bounds for the number of ordered factorizations of n into k factors.en
dc.format18 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationBAUSTIAN, F., BOBKOV, V. On asymptotic behavior of Dirichlet inverse. International Journal of Number Theory, 2020, roč. 16, č. 6, s. 1337-1354. ISSN 1793-0421.en
dc.identifier.document-number548536900012
dc.identifier.doi10.1142/S1793042120500700
dc.identifier.issn1793-0421
dc.identifier.obd43929983
dc.identifier.uri2-s2.0-85082101878
dc.identifier.urihttp://hdl.handle.net/11025/39869
dc.language.isoenen
dc.project.IDGA18-03253S/Diferenciální rovnice se speciálními typy nelinearitcs
dc.project.IDLO1506/PUNTIS - Podpora udržitelnosti centra NTIS - Nové technologie pro informační společnostcs
dc.publisherWorld Scientific Publishingen
dc.relation.ispartofseriesInternational Journal of Number Theoryen
dc.rights© World Scientific Publishingen
dc.rightsPlný text není přístupný.en
dc.rights.accessclosedAccessen
dc.subject.translatedDirichlet inverseen
dc.subject.translatedDirichlet convolutionen
dc.subject.translatedasymptoticsen
dc.subject.translatedordered factorizationsen
dc.titleOn asymptotic behavior of Dirichlet inverseen
dc.typečlánekcs
dc.typearticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Collections

OBD
 Articles (NTIS)