Related papers: On additive and multiplicative arithmetical functi…
The purpose of this paper is to propose an efficient method to compute the automorphism group of an arbitrary hyperelliptic function field (genus>1) over a given ground field of characteristic >2 as well as over its algebraic extensions.
In this paper, we study connections between the structure of a group and the structure of the group (under pointwise product) of its polynomial functions.
We investigate properties of a multivariate function $E(m_1,m_2,...,m_r)$, called {\it orbicyclic}, that arises in enumerative combinatorics in counting non-isomorphic maps on orientable surfaces. $E(m_1,m_2,...,m_r)$ proves to be…
We first introduce the arithmetic subderivative of a positive integer with respect to a non-empty set of primes. This notion generalizes the concepts of the arithmetic derivative and arithmetic partial derivative. More generally, we then…
The so called quantized algebras of functions on affine Hecke algebras of type A and the corresponding q-Schur algebras are defined and their irreducible unitarizable representations are classified.
We compare two classes of functions arising from genus-one superstring amplitudes: modular and holomorphic graph functions. We focus on their analytic properties, we recall the known asymptotic behaviour of modular graph functions and we…
In this note, we establish some new results on some special types of function algebras and also give new proofs to some existing ones
One-parameter generalizations of the logarithmic and exponential functions have been obtained as well as algebraic operators to retrieve extensivity. Analytical expressions for the successive applications of the sum or product operators on…
We will generalize the concept of aggregation function for mathematical structures as a certain function between quantales. In fact, these functions turn to be exactly the lax morphism of quantales. This provides a global framework for the…
Extending the work of Freese and Cook, which develop the basic theory of calculus and power series over real associative algebras, we examine what can be said about the logarithmic functions over an algebra. In particular, we find that for…
We introduce the notion of the generalized-analytical function of the poly-number variable, which is a non-trivial generalization of the notion of analytical function of the complex variable and, therefore, may turn out to be fundamental in…
A map is given showing that convolutions of independent random variables over a finite group and matrix multiplications of doubly stochastic matrices are homomorphic. As an application, a short proof is given to the theorem that the…
In this paper, we introduce and share the new concept of $\mathcal{MT}(\lambda )$-functions and its some characterizations.
In the present work we explore relationships between multiplicative functions defined in \cite{Garonzi_2018}, \cite{Lazorec}. To do so, we use other important quotients defined and studied in \cite{ndeg}, \cite{Marius}, thus establishing…
We determine multiplication and convolution topological algebras for classes of $\omega$-ultradifferentiable functions of Beurling type. Hypocontinuity and discontinuity of the multiplication and convolution mappings are also investigated.
We describe isomorphisms of groups of several periodic infinite matrices and isomorphisms of groups of invertible elements of unital locally matrix algebras.
An arithmetic function $f$ is Leibniz-additive if there is a completely multiplicative function $h_f$, i.e., $h_f(1)=1$ and $h_f(mn)=h_f(m)h_f(n)$ for all positive integers $m$ and $n$, satisfying $$ f(mn)=f(m)h_f(n)+f(n)h_f(m) $$ for all…
In this work we present some arithmetic properties of families of abelian $p$--extensions of global function fields, among which are their generators and their type of ramification and decomposition.
We introduce and study a family of functions we call the "mock characters". These functions satisfy a number of interesting properties, and of all completely multiplicative arithmetic functions seem to come as close as possible to being…
In the present note we prove an asymptotically tight relation between additive and multiplicative complexity of Boolean functions with respect to implementation by circuits over the basis {+,*,1}.