Results 241 to 250 of about 2,422,350 (276)
Some of the next articles are maybe not open access.

Delta Complete Monotonicity and Completely Monotonic Degree on Time Scales

Bulletin of the Malaysian Mathematical Sciences Society, 2023
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jing-Feng Tian
exaly   +3 more sources

Complete Monotonicity and Logarithmically Complete Monotonicity Properties for the Gamma and Psi Functions

open access: yesJournal of Mathematical Analysis and Applications, 2007
Recently, several authors have studied the monotonicity properties of functions such as \(\psi(x)= \Gamma'(x)/\Gamma(x)\,.\) See, for instance, [\textit{H. Alzer, C. Berg}, ``Some classes of completely monotonic functions. II.'' Ramanujan J. 11, 225--248 (2006; Zbl 1110.26015), \textit{N. Batir}, J. Math. Anal. Appl.
Chao-Ping Chen
exaly   +2 more sources

Some Absolutely Monotonic and Completely Monotonic Functions

SIAM Journal on Mathematical Analysis, 1974
The functions $(1 - r)^{ - 2|\lambda |} (1 - 2xr + r^2 )^{ - \lambda } $ are shown to be absolutely monotonic, or equivalently, that their power series have nonnegative coefficients for $ - 1 \leqq x \leqq 1$. One consequence is a simple proof of Kogbetliantz’s theorem on positive Cesaro summability for ultraspherical series, [7].
Askey, Richard, Pollard, Harry
openaire   +2 more sources

Monotonic circuits with complete acknowledgement

Ninth International Symposium on Asynchronous Circuits and Systems, 2003. Proceedings., 2003
The paper studies a class of asynchronous circuits in which every signal transition on the inputs of every gate is acknowledged during the circuit operation. This property is called complete acknowledgement (CA) and it is considered here for circuits that consist of gates described by monotonic Boolean functions only.
Nikolai Starodoubtsev   +2 more
openaire   +2 more sources

APPROXIMATION OF AND BY COMPLETELY MONOTONE FUNCTIONS

The ANZIAM Journal, 2019
We investigate convergence in the cone of completely monotone functions. Particular attention is paid to the approximation of and by exponentials and stretched exponentials. The need for such an analysis is a consequence of the fact that although stretched exponentials can be approximated by sums of exponentials, exponentials cannot in general be ...
R. J. LOY, R. S. ANDERSSEN
openaire   +1 more source

Monotone Completions of the Fermion Algebra

The Quarterly Journal of Mathematics, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Saitô, Kazuyuki, Wright, J. D. Maitland
openaire   +2 more sources

A Property of completely monotonic functions

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics, 1987
AbstractA non-negative function f(t), t > 0, is said to be completely monotonic if its derivatives satisfy (-1)n fn (t) ≥ 0 for all t and n = 1, 2, …, For such a function, either f(t + δ) / f(t) is strictly increasing in t for each δ > 0, or f(t) = ce-dt for some constants c and d, and for all t. An application of this result is given.
openaire   +2 more sources

A Graphical Method for Checking Complete Monotonicity

IEEE Transactions on Computers, 1971
Complete monotonicity is a necessary condition for linear separability of a switching function and it is equivalent to the 2-asummable property. A test for this property using a tabular representation of a switching function and an easily generated test card is given. This method may be used reasonably well up to six variables.
exaly   +2 more sources

Completely monotonic functions

Integral Transforms and Special Functions, 2001
In this expository article we survey some properties of completely monotonic functions and give various examples, including some famous special functions. Such function are useful, for example, in probability theory. It is known, [1, p.450], for example, that a function w is the Laplace transform of an infinitely divisible probability distribution on ...
K.S. Miller, S.G. Samko
openaire   +1 more source

On the complete monotonicity of symbol error rates

2012 IEEE International Symposium on Information Theory Proceedings, 2012
In this paper, it is shown that the symbol error rate of an arbitrary multi-dimensional constellation impaired by independent and identically distributed additive white Gaussian noise under maximum likelihood detection is completely monotonic in the average SNR, if the rank of the constellation matrix is either one or two.
Adithya Rajan, Cihan Tepedelenlioglu
openaire   +2 more sources

Home - About - Disclaimer - Privacy