Search

In its additive version, Bohr–Mollerup's remarkable theorem states that the unique (up to an additive constant) convex solution f(x) to the equation Δ f (x) = ln x on the open half-line (0 , ∞) is the log-gamma function f (x) = ln Γ (x) , where Δ denotes the classical difference operator and Γ (x) denotes the Euler gamma function. In a recently published open access book, the authors provided and illustrated a far-reaching generalization of Bohr–Mollerup's theorem by considering the functional equation Δ f (x) = g (x) , where g can be chosen from a wide and rich class of functions that have convexity or concavity properties of any order. They also showed that the solutions f(x) arising from this generalization satisfy counterparts of many properties of the log-gamma function (or equivalently, the gamma function), including analogues of Bohr–Mollerup's theorem itself, Burnside's formula, Euler's infinite product, Euler's reflection formula, Gauss' limit, Gauss' multiplication formula, Gautschi's inequality, Legendre's duplication formula, Raabe's formula, Stirling's formula, Wallis's product formula, Weierstrass' infinite product, and Wendel's inequality for the gamma function. In this paper, we review the main results of this new and intriguing theory and provide an illustrative application. [ABSTRACT FROM AUTHOR]

The classical result of L. Székelyhidi states that (under some assumptions) every solution of a general linear equation must be a polynomial function. It is known that Székelyhidi's result may be generalized to equations where some occurrences of the unknown functions are multiplied by a linear combination of the variables. In this paper we study the equations where two such combinations appear. The simplest nontrivial example of such a case is given by the equation F (x + y) - F (x) - F (y) = y f (x) + x f (y) considered by Fechner and Gselmann (Publ Math Debrecen 80(1–2):143–154, 2012). In the present paper we prove several results concerning the systematic approach to the generalizations of this equation. [ABSTRACT FROM AUTHOR]

We investigate the functional equation f (p (x)) = q (f (x)) where p and q are given real functions. In the paper "On solvability of f (p (x)) = q (f (x)) for given real functionsp, q, Aequat. Math. 90 (2016), 471 - 494", we solved the problem of the solvability of f (p (x)) = q (f (x)) under the assumption that p, q are strictly increasing continuous real functions. Now, we extend the solutions of this problem for any strictly monotonous continuous real functions p, q. Thereby, we use the methods of the just mentioned paper. Further, we present computations of the so called characteristics of the given functions p, q using the results of this paper and, finally, present a quite short algorithm with input p, q and output 'solvable/not solvable'. [ABSTRACT FROM AUTHOR]

The equality problem of two-variable Bajraktarević means can be expressed as the functional equation f g - 1 ( f (x) + f (y) g (x) + g (y) ) = h k - 1 ( h (x) + h (y) k (x) + k (y) ) (x , y ∈ I) , where I is a nonempty open real interval, f , g , h , k : I → R are continuous functions, g, k are positive and f/g, h/k are strictly monotone. This functional equation, for the first time, was solved by Losonczi in 1999 under 6th-order continuous differentiability assumptions. Additional and new characterizations of this equality problem have been found recently by Losonczi, Páles and Zakaria under the same regularity assumptions in 2021. In this paper it is shown that the same conclusion can be obtained under substantially weaker regularity conditions, namely, assuming only first-order differentiability. [ABSTRACT FROM AUTHOR]

The conditional distributivity between two different aggregation operators, which has received wide attention from the researchers, is vital for many fields, for example, utility theory, integration theory and so on. In some existing generalization, the restrictive but not completely justified condition that the values of the inner operator are less than 1. However, for a more general and reasonable setting, the values of the inner operator should be strictly bounded between 0 and 1. Therefore, the aim of this paper is to introduce and fully characterize this kind of conditional distributivity of a semi-t-operator over a uninorm. In comparison with the corresponding results obtained, there are many new solutions. [ABSTRACT FROM AUTHOR]

It is known that if a bivariate mean K is symmetric, continuous and strictly increasing in each variable, then for every mean M there is a unique mean N such that K is invariant with respect to the mean-type mapping M , N , which means that K ∘ M , N = K and N is called a K-complementary mean for M (Matkowski in Aequ Math 57(1):87–107, 1999). This paper extends this result for a large class of nonsymmetric means. As an application, the limits of the sequences of iterates of the related mean-type mappings are determined, which allows us to find all continuous solutions of some functional equations. [ABSTRACT FROM AUTHOR]

Given two functions f , g : I → R and a probability measure μ on the Borel subsets of [0, 1], the two-variable mean M f , g ; μ : I 2 → I is defined by M f , g ; μ (x , y) : = (f g ) - 1 ∫ 0 1 f (t x + (1 - t) y) d μ (t) ∫ 0 1 g (t x + (1 - t) y) d μ (t) (x , y ∈ I). This class of means includes quasiarithmetic as well as Cauchy and Bajraktarević means. The aim of this paper is, for a fixed probability measure μ , to study their equality problem, i.e., to characterize those pairs of functions (f, g) and (F, G) for which M f , g ; μ (x , y) = M F , G ; μ (x , y) (x , y ∈ I) holds. Under at most sixth-order differentiability assumptions for the unknown functions f, g and F, G, we obtain several necessary conditions in terms of ordinary differential equations for the solutions of the above equation. For two particular measures, a complete description is obtained. These latter results offer eight equivalent conditions for the equality of Bajraktarević means and of Cauchy means. [ABSTRACT FROM AUTHOR]

The present article is devoted to generalized Salem functions, the generalized shift operator, and certain related problems. A description of further investigations of the author of this article is given. These investigations (in terms of various representations of real numbers) include generalized Salem functions and generalizations of the Gauss–Kuzmin problem. [ABSTRACT FROM AUTHOR]

In this work, we present the Cauchy functional equation in the context of connected Lie groups. We consider two generalizations of this equation with higher orders of the finite difference. [ABSTRACT FROM AUTHOR]

We observe that every quadrature of numerical integration together with a strictly increasing and continuous function generates a mean and then we study this family of means. We characterize the functions which generate weighted arithmetic means in this way and we show how to obtain comparison type theorems for means generated by different quadratures. [ABSTRACT FROM AUTHOR]

Aichinger's equation is used to give simple proofs of several well-known characterizations of polynomial functions as solutions of certain functional equations. Concretely, we use that Aichinger's equation characterizes polynomial functions to solve, for arbitrary commutative groups, Ghurye–Olkin's functional equation, Wilson's functional equation, the Kakutani–Nagumo–Walsh functional equation, and a general version of Fréchet's unmixed functional equation. [ABSTRACT FROM AUTHOR]

There is an asymptotic correspondence between the multiplicative relations among multinomial coefficients and the (additive) recursive property of Shannon entropy known as the chain rule. We show that both types of identities are manifestations of a unique algebraic construction: a 1-cocycle condition in information cohomology, an algebraic invariant of presheaves of modules on certain categories of observables. Depending on the coefficients, the 1-cocycles can be information measures (Shannon entropy, Tsallis α -entropy) or generalized (Fontené-Ward) multinomial coefficients. In each case the 1-cocycle condition encodes a system of functional equations. We obtain in particular a combinatorial analogue of the "fundamental equation of information theory": a simple functional equation that uniquely characterizes the generalized binomial coefficients. The asymptotic correspondence mentioned above extends to any α -entropy and certain multinomial coefficients with compatible asymptotic behavior, shedding new light on the meaning of the chain rule and its deformations. [ABSTRACT FROM AUTHOR]

We show that, for a (not necessarily continuous) weakly contractive mean-type mapping M : I p → I p (where I is an interval and p ∈ N ), the functional equation K ∘ M = K has at most one solution in the family of continuous means K : I p → I . Some general approach to this equation is also given. [ABSTRACT FROM AUTHOR]

The section method provides a technique for solving certain functional equations with the help of their characteristic equations. We prove here that a large class of such equations are functionally stable in the hypothesis of the stability of the corresponding characteristic equations. We use these results to solve two equations that have composite functions as solutions and to give classes of control functions that ensure their generalized stability. [ABSTRACT FROM AUTHOR]

The general solutions of the functional equations F (p q) = q α G (p) + p α H (q) + K (p) L (q) , F (p q) = q β G (p) + p α H (q) + c K (p) K (q) and f (p q) = q α f (p) + p α f (q) + c g (p) g (q) with g (1) = 0 and c, a given nonzero real constant, are obtained. Here F, G, H, K, L, f and g are real-valued functions each with domain I, the unit closed interval and 1 ≠ α > 0 , α ∈ R ; 1 ≠ β > 0 , β ∈ R . [ABSTRACT FROM AUTHOR]

This work establishes the existence of addition theorems and double-angle formulas for C k real scalar functions. Moreover, we determine necessary and sufficient conditions for a bivariate function to be an addition formula for a C k real function. The double-angle formulas allow us to generate a duplication algorithm, which can be used as an alternative to the classical numerical methods to obtain an approximation for the solution of an ordinary differential equation. We demonstrate that this algorithm converges uniformly in any compact domain contained in the maximal domain of that solution. Finally, we carry out some numerical simulations showing a good performance of the duplication algorithm when compared with standard numerical methods. [ABSTRACT FROM AUTHOR]