In this paper, a computer program developed in the computer algebra system Maple is presented, which investigates alienness and strong alienness of linear functional equations. [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]
In this paper we prove that if a generalized polynomial function f satisfies the condition f( x) f( y) = 0 for all solutions of the equation x + y = 1, then f is identically equal to 0. [ABSTRACT FROM AUTHOR]