Results 261 to 270 of about 27,278 (300)

Compositionality beyond bases. [PDF]

Philos Trans R Soc Lond B Biol Sci
Pelland JC.
europepmc   +1 more source

Identities for Multiplicative Functions

Canadian Mathematical Bulletin, 1967
Throughout this paper the arithmetic functions L(n) and w(n) denote respectively the number and product of the distinct prime divisors of the integer n > 1, with L(1) = 0 and w(1) = 1. Also letWe recall that an arithmetic function f(n) is said to be multiplicative if f(1) = 1 and f(mn) = f(m)f(n) whenever (m, n) = 1, where (m, n) denotes as usual ...
Subbarao, M. V., Gioia, A. A.
openaire   +2 more sources

On some classes of multiplicative functions

Aequationes Mathematicae
An arithmetical function f is multiplicative if f(1)=1 and f(mn)=f(m)f(n) whenever m and n are coprime. We study connections between certain subclasses of multiplicative functions, such as strongly multiplicative functions, over-multiplicative functions ...
Pentti Haukkanen, Haukkanen Pentti
exaly   +2 more sources

Some of the next articles are maybe not open access.

Related searches:

The Multiple Functions of Hemoglobin

Critical Reviews in Biochemistry and Molecular Biology, 1995
The aim of this review is to focus and discuss several parallel biological functions of hemoglobin besides its basic function of oxygen transport. In light of the information present in the literature the following possible physiological roles of hemoglobin are discussed: (1) hemoglobin as molecular heat transducer through its oxygenation-deoxygenation
Giardina, Bruno, Messana, I, Scatena, Roberto, Castagnola, Massimo   +3 more
openaire   +3 more sources

The multiplicative complexity of 6-variable Boolean functions [PDF]

Cryptography and Communications, 2018
The multiplicative complexity of a Boolean function is the minimum number of AND gates that are necessary and sufficient to implement the function over the basis (AND, XOR, NOT).
çağdaş Çalik, Meltem Sönmez Turan, René Peralta   +2 more
exaly   +1 more source

Multiplicative Utility Functions

Operations Research, 1974
This paper presents sufficient conditions for a multiattribute utility function to be either multiplicative or additive. The number of requisite assumptions to imply the main result is equal to the number of attributes. Because the assumptions involve only trade-offs between two attributes at a time or lotteries over one attribute, it is reasonable to
openaire   +1 more source

MULTIPLICATION OF WEAK FUNCTIONS

Acta Mathematica Scientia, 2005
This paper is a continuation of the authors' recent work [\textit{X. Ding} and \textit{P. Luo}, Acta Math. Sci., Ser. B, Engl. Ed. 24, 691--697 (2004; Zbl 1081.33012)] and is concerned with multiplication of weak functions. Here the weak functions are treated as generalized expansions in Hermite functions just as in the same authors' earlier paper ...
Ding, Xiagi, Wang, Zhen
openaire   +1 more source

Tight bounds for the multiplicative complexity of symmetric functions

Theoretical Computer Science, 2008
The multiplicative complexity of a Boolean function f is defined as the minimum number of binary conjunction (AND) gates required to construct a circuit representing f, when only exclusive-or, conjunction and negation gates may be used.
Joan Boyar, René Peralta
exaly   +2 more sources

Multiple gamma functions, multiple sine functions, and Appell’s O-functions

The Ramanujan Journal, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source