Given S a semigroup. We study two Pexider-type functional equations f(xy) + g(xy) = f(x) + f(y) + g(x)g(y), x,y ∈ S, and ∫Sf(xyt)dμ(t) + ∫Sg(xyt)dμ(t) = f(x) + f(y) + g(x)g(y), x,y ∈ S, for unknown functions f and g mapping S into ℂ, where μ is a linear combination of Dirac measures (δz_i})i∈I for some fixed elements (zi)i∈I contained in S such that ∫Sdμ(t) = 1. The main goal of this paper is to solve the above two functional equations and examine whether or not they are equivalent to the systems of equations f(xy) = f(x) + f(y), g(xy) = g(x)g(y), x,y ∈ S, and ∫Sf(xyt)dμ(t) = f(x) + f(y), ∫Sg(xyt)dμ(t) = g(x)g(y), x,y ∈ S, respectively.
Let S be a semigroup, ℍ be the skew field of quaternions, and ψ: S→S be an anti-endomorphism. We determine the general solution of the functional equation g(xy) - g(xψ(y)) = 2g(x)g(y), x,y ∈ S, where g: S→ℂ is the unknown function. And when S = M is a monoid, we solve the functional equation g(xy) + g(xψ(y)) = 2g(x)g(y), x,y ∈ M, where g: M→ℍ is the unknown function.
In this paper, by Schauder's fixed point theorem and the Banach contraction principle, we consider the existence, uniqueness, and stability of convex solutions of a nonhomogeneous iterative functional differential equation. Finally, some examples were considered by our results.
In this work we focus on a dynamical system with jumps, where the intensity of the jumps depends on the system’s state. By verifying the assumptions of the theorem from [4], we show that our model satisfies the central limit theorem.
We use the approach from Czudek and Szarek (see [1]) to prove the central limit theorem for a stationary Markov chain generated by an iterative function system for a family of increasing, injective functions on [0, 1] with "contractive" properties. We introduce a new approach to prove existence of an unique invariant measure using e-property (see [2]).
We study a recent conjecture proposed by Horst Alzer and Janusz Matkowski concerning a bilinearity property of the Cauchy exponential difference for real-to-real functions. The original conjecture was affirmatively resolved by Tomasz Małolepszy. We deal with generalizations for real or complex mappings acting on a linear space.
This article examines integral inequalities dealing with functions of the form “a function raised to the power of another function” under varying monotonicity and convexity assumptions. First, we assess the validity of a referenced theorem on the subject. Specifically, we present a counterexample and identify a gap in its proof. We then propose an alternative version of the theorem with more flexible convexity assumptions. In addition, we establish new lower and upper bounds for the same integral using refined Hermite–Hadamard integral inequalities. A complementary variant is also discussed. Thus, our results fill gaps in the literature and extend existing results on integral inequalities under classical assumptions.
In this paper, the bidimensional extensions of the Fibonacci numbers are explored, along with a detailed examination of their properties, characteristics, and some identities. We introduce and study the matrices with bidimensional Fibonacci numbers, focusing in particular on their recurrence relation, key properties, determinant, and various other identities. It is our purpose to study the matrix version of bidimensional Fibonacci numbers and provide new results and sometimes extensions of some results existing in the literature. We aim to introduce these matrices using the bidimensional Fibonacci numbers and to give the determinant of these matrices.
We determine the solutions of the conditional Drygas equation for functions f1 and f2 that satisfy (y2+y)f1(x) = (x2+x)f2(y) for all (x, y)∈ℝ2 under the additional conditions y = x2, or y = log(x), x > 0 or y = exp(x).
In this paper, we deal with the question: under what conditions n distinct points Pi(xi,yi) (i=1,...,n) provided x1<...<xn form a convex polygon? One of the main findings of the paper can be stated as follows: Let P1(x1,y1),..., Pn(xn,yn) be n distinct points (n≥3) with x1<...<xn. Then \overline{P1P2},...,\overline{PnP1} form a convex n-gon lying in the half-space \underline{H} = {(x,y)| x∈ℝ and y≤y1 + [(x-x1)/(xn-x1)](yn-y1)} ⊆ ℝ2 if and only if the following inequality holds (yi-yi-1)/(xi-xi-1) ≤ (yi+1-yi)/(xi+1-xi) for all i∈{2,...,n−1}. Based on this result, we establish a connection between the property of sequential convexity and convex polygon. We show that in a plane if any n points are scattered in such a way that their horizontal and vertical distances preserve some specific monotonic properties, then those points form a 2-dimensional convex polytope.
Generalized commutative quaternions generalize elliptic, parabolic and hyperbolic quaternions, bicomplex numbers, complex hyperbolic numbers and hyperbolic complex numbers. In this paper, we use the Mersenne numbers and polynomials in the theory of these quaternions. We introduce and study generalized commutative Mersenne quaternion polynomials and generalized commutative Mersenne–Lucas quaternion polynomials.
In this paper we will try to answer what conditions must be met by the fuzzy Xor to be used for cryptographic purposes. We will also show that defining the fuzzy Xor using other fuzzy connectives is not suitable for this purpose.
10.2478/amsil
English