AbstractIt is known that if f is a multiplicative increasing function on N, then either f(n)=0 for all n∈N or f(n)=nα for some α⩾0. It is very natural to ask if there are similar results in other algebraic systems. In this paper, we first study the multiplicative increasing functions over nonnegative square matrices with respect to tensor product and then restrict our result to multidigraphs and loopless multidigraphs
AbstractWe characterize the complex square matrices which are expressible as the product of finitely...
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
A graph is said positively multiplicative when its adjacency matrix A embeds in a matrix algebra adm...
AbstractIt is known that if f is a multiplicative increasing function on N, then either f(n)=0 for a...
AbstractFor any graph H, the function hH, defined by setting hH(G) equal to the number of homomorphi...
AbstractA real-valued function ƒ defined on the set of all graphs, G, such that ƒ(G×H)=ƒ(G)ƒ(H) for ...
AbstractWe introduce a parameter called the level of nonmultiplicativity of a graph, which is relate...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
AbstractA single-matrix multiplicative system consists of an N×N nonnegative matrix Q and an N×1 sem...
AbstractAll triples F, G, M: Kn → K of additive F, G and multiplicative M satisfying the titular fun...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
AbstractLet Mn be the algebra of all n×n matrices, and let φ:Mn→Mn be a linear mapping. We say that ...
Let k be a positive integer and f a multiplicative function with 0 f(p) k for all primes p. Then, fo...
AbstractWe characterize the complex square matrices which are expressible as the product of finitely...
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
A graph is said positively multiplicative when its adjacency matrix A embeds in a matrix algebra adm...
AbstractIt is known that if f is a multiplicative increasing function on N, then either f(n)=0 for a...
AbstractFor any graph H, the function hH, defined by setting hH(G) equal to the number of homomorphi...
AbstractA real-valued function ƒ defined on the set of all graphs, G, such that ƒ(G×H)=ƒ(G)ƒ(H) for ...
AbstractWe introduce a parameter called the level of nonmultiplicativity of a graph, which is relate...
AbstractFor a fixed graph G, the capacity function for G, PG, is defined by PG(H) = limn→∞[γG(Hn)]1/...
AbstractA graph K is called multiplicative if whenever a categorical product of two graphs admits a ...
The study of the distribution of general multiplicative functions on arithmetic progressions is, lar...
AbstractA single-matrix multiplicative system consists of an N×N nonnegative matrix Q and an N×1 sem...
AbstractAll triples F, G, M: Kn → K of additive F, G and multiplicative M satisfying the titular fun...
This thesis gives some order estimates and asymptotic formulae associated with general classes of no...
AbstractLet Mn be the algebra of all n×n matrices, and let φ:Mn→Mn be a linear mapping. We say that ...
Let k be a positive integer and f a multiplicative function with 0 f(p) k for all primes p. Then, fo...
AbstractWe characterize the complex square matrices which are expressible as the product of finitely...
AbstractLet k be a positive integer and f a multiplicative function with 0 < f(p) ≤1/k for all prime...
A graph is said positively multiplicative when its adjacency matrix A embeds in a matrix algebra adm...