Search

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]

The study of quantum integers and their operations is closely related to the studies of symmetries of roots of polynomials and of fundamental questions of decompositions in Additive Number Theory. In his papers on quantum arithmetics, Melvyn Nathanson raises the question of classifying solutions of functional equations arising from the multiplication of quantum integers, starting with polynomial solutions and then generalizing to rational function solutions. The classification of polynomial solutions with fields of coefficients of characteristic zero and support base P has been completed. In a paper concerning the Grothendieck group associated to the collection of polynomial solutions, Nathanson poses a problem which asks whether the set of rational function solutions strictly contains the set of ratios of polynomial solutions. It is now known that there are infinitely many rational function solutions Γ with fields of coefficients of characteristic zero not constructible as ratios of polynomial solutions, even in the purely cyclotomic case, which is the case most similar to the polynomial solution case. The classification of polynomial solutions is thus not sufficient, in essential ways, to resolve the classification problem of all rational function solutions with fields of coefficients of characteristic zero. In this paper we study symmetries of roots of rational functions and the classification of the important class-the last and main obstruction to the classification problem-of rational function solutions, the purely cyclotomic, purely nonrational primitive solutions with fields of coefficients of characteristic zero and support base P, which allows us to complete the classification problem raised by Nathanson. [ABSTRACT FROM AUTHOR]

In the present paper, a general class of linear functional equations is considered and a computer program is described, which determines the exact solutions of systems of equations belonging to this class. [ABSTRACT FROM AUTHOR]

The aim of the present paper is to describe some properties of functions with finite dimensional difference spaces by means of spectral analysis and spectral synthesis. We are going to apply these results to a version of a Levi-Civita functional equation, which has been recently studied by J. M. Almira and E. Shulman. [ABSTRACT FROM AUTHOR]

We study the stability properties of the equation which is motivated by numerical integration. In Szostok and Wa̧sowicz (Appl Math Lett 24(4):541-544, ) the stability of the simplest equation of the type (0.1) was investigated thus the inequality was studied. In the current paper we present a somewhat different approach to the problem of stability of (0.1). Namely, we deal with the inequality [ABSTRACT FROM AUTHOR]

Given rational vector spaces V, W a mapping $${f \colon V \to W}$$ is called a generalized polynomial of degree at most n, if there are homogeneous generalized polynomials f of degree i such that $${f = \sum_{i = 0}^n f_i}$$ . Homogeneous generalized polynomials f of degree i are mappings of the form $${f_i (x) = f_i^*(x, x, \ldots , x)}$$ with $${f_i^* \colon V^i \to W i}$$ -linear. In the literature one may find quite a lot of functional equations such that their general solution is of the form f or $${f_n + f_{n - 1}}$$ where n is a small positive integer ( ≤ 6 or ≤ 4 respectively). In this paper, given an arbitrary positive integer n and an arbitrary subset $${L \subseteq \{0, 1, \ldots, n\}}$$ such that $${n \in L}$$ , a method is described to find (many) functional equations, such that their general solution is given by $${\sum_{i \in L} f_i}$$ . For the cases $${L = \{n\}}$$ and $${L = \{n - 1, n\}}$$ additional equations are given. [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]