Results 11 to 20 of about 373,315 (309)

On Finitely Null-additive and Finitely Weakly Null-additive Relative to the σ–ring

open access: yesمجلة بغداد للعلوم, 2022
     This article introduces the concept of finitely null-additive set function relative to the σ– ring and many properties of this concept have been discussed. Furthermore, to introduce and study the notion of finitely weakly null-additive set function
Samah H. Asaad   +2 more
doaj   +1 more source

On additive representation functions [PDF]

open access: yesInternational Journal of Number Theory, 2015
Let 𝒜 = {a1 < a2 < a3 < ⋯ < an < ⋯} be an infinite sequence of nonnegative integers and let R2(n) = |{(i, j) : ai + aj = n; ai, aj ∈ 𝒜; i ≤ j}|. We define [Formula: see text]. We prove that if the L∞-norm of [Formula: see text] is small, then the L1-norm of [Formula: see text] is large.
Balasubramanian, R., Giri, Sumit
openaire   +2 more sources

Stability of the Popoviciu type functional equations on groups [PDF]

open access: yesOpuscula Mathematica, 2011
We consider the stability problem for a class of functional equations related to the Popoviciu equation.
Małgorzata Chudziak
doaj   +1 more source

On an additive arithmetic function [PDF]

open access: yesPacific Journal of Mathematics, 1977
Let \(n\) be a positive integer, \(n=\prod\limits_{i=1}^rp_i^{\alpha_i}\) in canonical form, and let \(A(n)=\sum\limits_{i=1}^r\alpha_ip_i\). Clearly \(A\) is an additive arithmetic function.
Alladi, K., Erdős, P.
openaire   +2 more sources

Another look at inheritance of uniform continuity of 1-dimensional aggregation functions by their super-additive transformations [PDF]

open access: yesJournal of Mahani Mathematical Research, 2022
In an earlier paper by Seliga, Siran and the second author (J. Mahani Math. Res. Center 8 (2019) 37–51) on lifting continuity properties of aggregation functions to their super- and sub-additive transformations it was shown that uniform continuity is ...
Fateme Kouchakinejad, Alexandra Siposova
doaj   +1 more source

AN ADDITIVE FUNCTIONAL INEQUALITY [PDF]

open access: yesKorean Journal of Mathematics, 2014
Summary: In this paper, we solve the additive functional inequality \[\|f(x)+f(y)+f(z)\| \le \| \rho f( s (x+y+z)\| ,\] where \(s\) is a nonzero real number and \(\rho\) is a real number with \(|\rho| < 3\). Moreover, we prove the Hyers-Ulam stability of the above additive functional inequality in Banach spaces.
Lee, Sung Jin   +2 more
openaire   +1 more source

ON ADDITIVE REPRESENTATION FUNCTIONS [PDF]

open access: yesBulletin of the Australian Mathematical Society, 2017
For any finite abelian group$G$with$|G|=m$,$A\subseteq G$and$g\in G$, let$R_{A}(g)$be the number of solutions of the equation$g=a+b$,$a,b\in A$. Recently, Sándor and Yang [‘A lower bound of Ruzsa’s number related to the Erdős–Turán conjecture’, Preprint, 2016,arXiv:1612.08722v1] proved that, if$m\geq 36$and$R_{A}(n)\geq 1$for all$n\in \mathbb{Z}_{m ...
YA-LI LI, YONG-GAO CHEN
openaire   +1 more source

MEAN VALUE OF THE ADDITIVE ANALOGUE OF SMARANDACHE FUNCTION [PDF]

open access: yes, 2005
For any positive integer n, let Sdf(n) denotes the Smarandance double factorial function, then Sdf(n) is defined as least positive integer m such that m!! is divisible by n.
Zhu, Minhui
core   +1 more source

Distribution of the combinatorial multisets component vectors

open access: yesLietuvos Matematikos Rinkinys, 2012
We explore a class of random combinatorial structures called weighted multisets. Their components are taken from an initial set satisfying general boundedness conditions posed on the number of elements with a given weight.
Eugenijus Manstavičius   +1 more
doaj   +1 more source

MEAN VALUE OF THE ADDITIVE ANALOGUE OF SMARANDACHE FUNCTION [PDF]

open access: yes, 2006
For any positive integer n, let S(n) denotes the Smarandache function, then S(n) is defined the smallest m 2 N+, where njm!. In this paper, we study the mean value properties of the additive analogue of S(n), and give an interesting mean value formula ...
Yi, Yuan and Zhang Wenpeng   +1 more
core   +1 more source

Home - About - Disclaimer - Privacy