J. Hanumanthachari
Abstract
Open-access reader
In this paper the congruence (f ∘ g)(n) = 0 (mod n) and the functional equation f ∘ f ∘ … ∘ f = g, are studied, where ∘ is an exponential regular convolution.
OpenAlex reports 8 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper the congruence (f ∘ g)(n) = 0 (mod n) and the functional equation f ∘ f ∘ … ∘ f = g, are studied, where ∘ is an exponential regular convolution.
Key concepts: Mathematics, Convolution (computer science), Congruence (geometry), Arithmetic, Exponential function, Convolution power, Pure mathematics, Algebra over a field