On some functional equations of Goląb-Schinzel type

Summary LetE be a real Hausdorff topological vector space. We consider the following binary law * on ·E:(, ) * (, ) = (, ^k + ) for(, ), (, ) × E where is a nonnegative real number,k andl are integers.In order to find all subgroupoids of ( ·E, *) which depend faithfully on a set of parameters, we have to solve the following functional equation:f(f(y) ^k x +f(x) ^l y) =f(x)f(y) (x, y E). (1)In this paper, all solutionsf: of (1) which are in the Baire class I and have the Darboux property are obtained. We obtain also all continuous solutionsf: E of (1). The subgroupoids of (^* ·E, *) which dapend faithfully and continuously on a set of parameters are then determined in different cases. We also deduce from this that the only subsemigroup ofL _n ¹ of the form {(F(x ₂,x ₃, ,x _n ),x ₂,x ₃, ,x _n ); (x ₂, ,x _n ) ^{n – 1} }, where the mappingF: ^{n – 1 *} has some regularity property, is {1} × ^{n – 1} .We may noitice that the Gob-Schinzel functional equation is a particular case of equation (1)(k = 0, l = 1, = 1). So we can say that (1) is of Gob—Schinzel type. More generally, whenE is a real algebra, we shall say that a functional equation is of Gob—Schinzel type if it is of the form:f(f(y) ^k x +f(x) ^l y) =F(x,y,f(x),f(y),f(xy)) wherek andl are integers andF is a given function in five variables. In this category of functional equations, we study here the equation:f(f(y) ^k x +f(x) ^l y) =f(xy) (x, y f: ). (4)This paper extends the results obtained by N. Brillouët and J. Dhombres in [3] and completes some results obtained by P. Urban in his Ph.D. thesis [11] (this work has not yet been published).Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth     

A chord-stretching map of a convex loop is an isometry

Let ⁿ be n-dimensional Euclidean space, and let : [0, L] ⁿ and : [0, L] ⁿ be closed rectifiable arcs in ⁿ of the same total length L which are parametrized via their arc length. is said to be a chord-stretched version of if for each 0s tL, |(t)–(s)| |(t)–(s)|. is said to be convex if is simple and if ([0, L]) is the frontier of some plane convex set. Individual work by Professors G. Choquet and G. T. Sallee demonstrated that if were simple then there existed a convex chord-stretched version of . This result led Professor Yang Lu to conjecture that if were convex and were a chord-stretched version of then and would be congruent, i.e. any chord-stretching map of a convex arc is an isometry. Professor Yang Lu has proved this conjecture in the case where and are C ² curves. In this paper we prove the conjecture in general.     

Fundamental equation of information revisited

Summary This paper presents a new, shorter and more direct proof of the following result of J. Aczél and C. T. Ng: IfM: J R (J =]0, 1[ ^k ) is both multiplicative and additive, then the general solution: J R of(x) + M(1 – x)(y/1 – x) = (y) + M(1 – y)(x/1 – y) (x, y, x + y J) is given by(x) = ifM = 0,(x) = M(x)[L(x) + ] + M(1 – x)L(1 – x) ifM 0,where is an arbitrary constant andL: J R is an arbitrary solution of the logarithmic functional equationL(xy) = L(x) + L(y) (x, y J). Also, some extensions of this result to fields more general than the reals are given.     

Bounds for optimalα-β binary trees

In this paper we consider a special kind of binary trees where each right edge is associated with a positive number and each left edge with a positive number( ). Given, and the number of nodesn, an optimal tree is one which minimizes the total weighted path length. An algorithm for constructing an optimal tree for given, , n is presented, based on which bounds for balances and total weighted path lengths of optimal trees are derived.     

Numerical application of Euler's series transformation and its generalizations

Summary A nonlinear generalizationÊ _z of Euler's series transformation is compared with the (linear) Euler-Knopp transformationE _z and a twoparametric methodE . It is shown how to applyE orE _, to compute the valuef(z_o) of a functionf from the power series at 0 iff is holomorphic in a half plane or in the cut plane. BothE andE _, are superior toÊ _z . A compact recursive algorithm is given for computingE andE _,.     

Differentiability properties of the minimal average action

Given aZ ⁿ⁺¹-periodic variational principle onR ⁿ⁺¹ we look for solutionsu:R ⁿ R minimizing the variational integral with respect to compactly supported variations. To every vector R ⁿ we consider a subset of solutions which have an average slope when averaging overR ⁿ. The minimal average action A() is defined by the average value of the variational integral given by a solution with average slope . Our main result is:A is differentiable at if and only if the set is totally ordered (in the natural sense). In case that is not totally ordered,A is differentiable at in some direction R ⁿ{0} if and only if is orthogonal to the subspace defined by the rational dependency of . Assuming that the i^th component of is rational with denominator sⁱ N in lowest terms, we show: The difference of right- and left-sided derivative in the i^th standard unit direction is bounded by const · .     

Measures of inset information on the open domain — I: Inset entropies and information functions of all degrees

This is one in a series of papers studying measures of information in the so-called mixed theory of information (i.e. considering the events as well as their probabilities) on the open domain (i.e. without empty sets and zero probabilities). In this paper we find all-recursive, 3-semisymmetric inset entropies on the open domain. We do this by solving the fundamental equation of inset information of degree () on the open domain.Dedicated to Professor János Aczél on his 60th birthday.     

Modified (0, 2)-Interpolation on the Roots of Jacobi Polynomials. II (Convergence)

In [4] A. M. Chak, A. Sharma and J. Szabados characterized the Jacobi matrices P(,), (, > –1) for which the (0,2)-interpolation problem is regular. It follows from their result, that if n is odd and = , or if , are both odd integers and n > 1 + ( + )/2, then the (0,2)-interpolation problem is not regular. Recently, the author proved that for , both odd integers, the (0,2)-interpolation problem augmented with boundary (Hermite-type) conditions at the endpoints of the interval [–1,1] is regular. In this paper the convergence of this modified (0,2)-interpolation procedure is studied, if the inner nodal points are the roots of the ultraspherical polynomials with odd integer parameter.     

A note on the global asymptotic stability of the unreacting state in a simple model for quadratic autocatalysis with linear decay

In this note we consider a reaction-diffusion problem which describes a simple model chemical reaction scheme for quadratic autocatalysis with linear decay. We show that withk>1 (wherek is a parameter measuring the relative strength of the decay step to the autocatalytic step) the dimensionless unreacting state 1, 0 is globally asymptotically stable, with 1+0(t ^–1/2) and 0(t ^–1/2 e ^–(k–1)t) ast-. Here and are the concentrations of the reactant and the autocatalyst respectively, andt is time. The casek<1 has been considered in detail by Merkin et al. [1].     

On a generalized Eulerian distribution

The distribution with probability function p _k(n, , ) = A _{n, k}(, )/(+ )^[p], k = 0, 1, 2, ..., n, where the parameters and are positive real numbers, A _{n, k} (, ) is the generalized Eulerian number and ( + )^[n] = ( + )( + +1) ... ( + +n – 1), introduced and discussed by Janardan (1988, Ann. Inst. Statist. Math., 40, 439–450), is further studied. The probability generating function of the generalized Eulerian distribution is expressed by a generalized Eulerian polynomial which, when expanded suitably, provides the factorial moments in closed form in terms of non-central Stirling numbers. Further, it is shown that the generalized Eulerian distribution is unimodal and asymptotically normal.     

Solution of two sequencing problems

The solution of the following problems is offered. Suppose a multiset J (¦J¦=p) is given. For each pair of elements and J, a number 1 P is given. Moreover, if 1 < x<p then x is undefined. If x=1, then x=p. Problem 1. Find the permutation ₁..._F of elements of the multiset J satisfying the following conditions. Let _i, _i=. If i,j < x, thenj <i. If i,j > x, then i<j. Such a permutation is called a PC-schedule. Problem 2. Find a PC-schedule in which the following property holds: if i < x < j, _i=, _j=, then. Such a PC-schedule is called an SC-schedule. The conditions under which these problems have solutions are studied. For their solution an algorithm of shifts is used with the complexity O(¦B(J)¦²¦J¦).Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 124, pp. 44–72, 1983.     

Symmetrische Permutationsmengen

A permutation set (M, I) consisting of a setM and a set of permutations ofM, is calledsymmetric, if for any two permutations, the existence of anx M with (x) (x) and ^–1 (x) = ^–1 (x) implies ^–1 = ^–1 , andsharply 3-transitive, if for any two triples (x ₁,x ₂,x ₃), (y ₁,y ₂,y ₃) M ³ with|{x ₁,x ₂,x ₃ }| = |{y ₁,y ₂,y ₃ }| = 3 there is exactly one permutation with(x ₁) =y ₁,(x ₂) =y ₂,(x ₃) =y ₃. The following theorem will be proved.THEOREM.Let (M, ) be a sharply 3-transitive symmetric permutation set with |M|3, such that contains the identity. Then is a group and there is a commutative field K such that and the projective linear group PGL(2, K) are isomorphic.     

On the equation of similar profiles

Summary Considerf+ ff+ (1–f²)+ f=0 together with the boundary conditionsf(0)=f(0)=0,f ()=1. If=–1,>0, arbitrary there is at least one solution which satisfies 0<f<1 on (0, ). By the additional conditionf>0 on (0, ) or, alternately 0<1, the uniqueness of the solution is demonstrated.If=1,<0, arbitrary the existence of solutions for which –1<f<0 in some initial interval (0,t) and satisfying generallyf>1 is established. In both problems, bounds forf (0) and qualitative behavior of the solutions are shown.

---

Sommario Si consideri il problema definito dall'equazionef+ f f+ (1–f²)+ f=0 e dalle condizioni al contornof(0)=f (0)=0,f()=1. Assumendo=–1,>0, arbitrario si dimostra che esiste almeno una soluzione che soddisfa 0<f<1 nell'intervallo (0, ). Se in aggiunta si ipotizzaf>0 in (0, ), oppure 0<=1, l'unicità délia soluzione è assicurata.Successivamente si considéra il problema di valori al contorno con=1,<0, arbitrario. In questo caso esiste un'intera classe di soluzioni che soddisfano –1<f<0 in un intorno dell'origine e tali chef>1, in generale.Di detti problemi viene studiato il comportamento délle soluzioni e vengono determinate dalle maggiorazioni e minorazioni del valoref(0).

     

On cyclic biquadratic fields related to a problem of Hasse

In this note we shall prove that there exist infinitely many cyclic biquadratic fieldsK whose integral bases are neither {1, , ², } nor {1, , , ³) for any numbers , inK. Next, we shall construct infinitely many cyclic biquadratic fieldsK which have the index 1, but still have not the integral basis {1, , ², ³) for every inK. Finally we shall give a class of biquadratic fields for a problem of Hasse concerning an integral basis.     

Zeros in tables of characters for the groups Sn and An

In the representation theory of symmetric groups, for each partition of a natural number n, the partition h() of n is defined so as to obtain a certain set of zeros in the table of characters for S_n. Namely, h() is the greatest (under the lexicographic ordering ) partition among P(n) such that (g) 0. Here, is an irreducible character of S_n, indexed by a partition , and g is a conjugacy class of elements in S_n, indexed by a partition . We point out an extra set of zeros in the table that we are dealing with. For every non self-associated partition P(n), the partition f() of n is defined so that f() is greatest among the partitions of n which are opposite in sign to h() and are such that (g) 0 (Thm. 1). Also, for any self-associated partition of n > 1, we construct a partition () P(n) such that () is greatest among the partitions of n which are distinct from h() and are such that (g) 0 (Thm. 2).Supported by RFBR grant No. 04-01-00463 and by RFBR-BRFBR grant No. 04-01-81001.Translated from Algebra i Logika, Vol. 44, No. 1, pp. 24–43, January–February, 2005.     

A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

On a certain class of transcendental numbers

We show that the numbers ea are transcendental, where a 0; 1, is irrational, 0, and is algebraic.After this paper was in press the author discovered that Baker (Mathematika, 14(1967), 220–228) proved the transcendental nature of the numbers ea ₁ ¹ ...a_ss where , ₁... are algebraic numbers, 0, and In a₁...,ln a_s, are linearly independent over the field of rationals. The arguments in our paper differ slightly from the arguments of Baker.Translated from Matematicheskie Zametki, Vol. 4, No. 3, pp. 341–348, September, 1968.     

Properties of certain integral operators

Two integral operatorsP andQ for analytic functions in the open unit disk are introduced. The object of the present paper is to derive some properties of integral operatorsP andQ .     

Approximation of one class of transcendental numbers

The author studies the approximation of fixed-degree transcendental numbers e a by algebraic numbers where 0, a 0; and 1 and irrational are algebraic numbers.Translated from Matematicheskie Zametki, Vol. 5, No. 1, pp. 117–128, January, 1969.     

Notes on Interpolation. X (Two Boundary Value Problems)

In this paper we use (0, 2) interpolational polynomials to give an approximate solution of the differential equation y(x) + A(x)y(x) = F(x), x I := [-1, 1] j in case when the boundary values are y(-1) = and y(1) = , , R.