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]
Generalized Berwald manifolds are Finsler manifolds admitting linear connections such that the parallel transports preserve the Finslerian length of tangent vectors (compatibility condition). It is known (Vincze in J AMAPN 21:199–204, 2005) that such a linear connection must be metrical with respect to the averaged Riemannian metric given by integration of the Riemann-Finsler metric on the indicatrix hypersurfaces. Therefore the linear connection (preserving the Finslerian length of tangent vectors) is uniquely determined by its torsion. If the torsion is zero then we have a classical Berwald manifold. Otherwise, the torsion is some strange data we need to express in terms of the intrinsic quantities of the Finsler manifold. The paper presents the idea of the extremal compatible linear connection of a generalized Berwald manifold by minimizing the pointwise length of its torsion tensor. It is uniquely determined because the number of the Lagrange multipliers is equal to the number of the equations for the compatibility of the linear connection with the Finslerian metric. Using the reference element method, the extremal compatible linear connection can be expressed in terms of the canonical data as well. It is an intrinsic algorithm to check the existence of compatible linear connections on a Finsler manifold because it is equivalent to the existence of the extremal compatible linear connection. [ABSTRACT FROM AUTHOR]
In this paper, we consider the condition ∑ i = 0 n + 1 φ i (r i x + q i y) ∈ Z for real valued functions defined on a linear space V. We derive necessary and sufficient conditions for functions satisfying this condition to be decent in the following sense: there exist functions f i : V → R , g i : V → Z such that φ i = f i + g i , (i = 0 , ⋯ , n + 1) and ∑ i = 0 n + 1 f i (r i x + q i y) = 0 for all x , y ∈ V . [ABSTRACT FROM AUTHOR]