Interpolation of generalized analytical functions of complex variable

A general approach is proposed to the interpolation of x -analytical functions of a complex variable with an arbitrary –,+[Basis x -analytical functions whose imaginary pan is a polynomial in x, and y are obtained in explicit form.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 58, pp. 3–9, 1986.     

Quasiclassical asymptotic behavior of the scattering cross section for asymptotically homogeneous potentials

One considers the total scattering cross section on the potential gV(x), x^m, m3, for large values of the coupling constant g and of the wave number k. One assumes that V(x)(x/|1x|)|x|^–, 2>m+1, as ¦x¦. It is shown that for gk^–1 , g^3–ak^2(a–2) the scattering cross section is equal asymptotically to _a(gk^–1), x=(m–1)(–1)^–1. Here the coefficient _a is determined only by the function and the number . Under the additional conditions >0, V>0, the indicated asymptotic behavior holds in the large domain gk^–1 , gk^a–z c(gk^–1), >0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 152, pp. 105–136, 1986.     

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.     

Nielsen numbers and fixed points of mappings of bouquets of circles

In this note we construct maps of a bouquet of circles into itself, for which the familiar lower bound for the number of fixed points in terms of the Nielsen number is extremely ineffective. Precisely, we prove the following theorem: if n 1 and if f: S¹vS¹-S¹vS¹ is a map such that the homomorphism of the fundamental group induced by it carries the canonical generators and , respectively, into 1 and (gb^–1gb^–1)^n–1, then the Nielsen number of the map f is equal to 0, and any map homotopic to f has not less than 2n–1 fixed points.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 122, pp. 135–136, 1982.     

Eulerian numbers with fractional order parameters

Summary The aim of this paper is to generalize the well-known Eulerian numbers, defined by the recursion relationE(n, k) = (k + 1)E(n – 1, k) + (n – k)E(n – 1, k – 1), to the case thatn is replaced by . It is shown that these Eulerian functionsE(, k), which can also be defined in terms of a generating function, can be represented as a certain sum, as a determinant, or as a fractional Weyl integral. TheE(, k) satisfy recursion formulae, they are monotone ink and, as functions of , are arbitrarily often differentiable. Further, connections with the fractional Stirling numbers of second kind, theS(, k), > 0, introduced by the authors (1989), are discussed. Finally, a certain counterpart of the famous Worpitzky formula is given; it is essentially an approximation ofx in terms of a sum involving theE(, k) and a hypergeometric function.Dedicated to the memory of Alexander M. Ostrowski on the occasion of the 100th anniversary of his birth.     

Spreading maps (polymorphisms), symmetries of poisson processes,and matching summation

The matrix of a permutation is a particular case of Markov transition matrices. In the same way, a measure-preserving bijection of a space (A, ) with a finite measure is a particular case of Markov transition operators. A Markov transition operator can also be considered as a map (polymorphism) (A, ) (A, ), which spreads points of (A, ) into measures on (A, ). Denote by * the multiplicative group of positive real numbers, and by the semigroup of measures on *. In this paper, we discuss *-polymorphisms and -polymorphisms, which are analogs of Markov transition operators (or polymorphisms) for the groups of bijections (A, ) (A, ) leaving the measure quasi-invariant; two types of polymorphisms correspond to the cases where A has finite and infinite measure, respectively. In the case where the space A itself is finite, the *-polymorphisms are some -valued matrices. We construct a functor from -polymorphisms to *-polymorphisms; it is described in terms of summations of -convolution products over matchings of Poisson configurations. Bibliography: 33 titles.Published in Zapiski Nauchnykh Seminarov POMI, Vol. 292, 2002, pp. 62–91.This revised version was published online in April 2005 with a corrected cover date and article title.     

The existence of some resolvable block designs with divisibility into groups

This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; ₁, ₂) without repeated blocks and with arbitrary parameters such that ₁ = k, (v–1)/(k–1) ₂ v^k–2 (and also ₁ k/2, (v–1)/(2(k–1)) ₂ v^k–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.     

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.     

The regularity of Lagrangiansf(x, ξ)=254-01254-01254-01with Hölder exponents α(x)

In this paper the regularity of the Lagrangiansf(x, )=||^(x)(1< ₁(x)₂< +) is studied. Our main result: If(x) is Holder continuous, then the Lagrangianf(x, )=f(x, )=||^(x) is regular. This result gives a negative answer to a conjecture of V. Zhikov.Supported by the National Natural Science Foundation of China.     

K1 of Twisted Rings of Polynomials

We prove that for an arbitrary endomorphism of a ring R the group K1(R[t]) splits into the direct sum of K1(R) and Ñil (r;). Moreover, for any such R and Ñil (R; ) is isomorphic to Ñil (R ; ) for some ring R with : R R – an isomorphism.     

Limits of certain iterates of Post-Widder operators

The paper is a study of the limiting behaviour of the [n t]-th iterates of the well-known Post-Widder operatorsL _{n, x} used in the real inversion of the Laplace transform. It is shown that the limiting operators constitute a semigroup T _t;t0 of class (C ₀) on a family C _,; , >0 of Banach spaces. Applications of the semigroup structure lead to a pointwise saturation theorem forL _{n, x} and a characterization of convex functions inC _, through an inequality involving the action ofL _{n, x}.     

A Periodicity Theorem in K-Theory for Finite Covariant Systems

Let A be a complex Banach algebra. In this paper, we prove a periodicity theorem that K(S ² A, G, )K(A, G,), where (A,G,) is a finite covariant system and K(A,G,) is an Abelian group associated with (A,G,).     

On the Borel-Cantelli lemma

Necessary and sufficient conditions for P(A_n infinitely often) = , [0, 1], are obtained, where {A_n} is a sequence of events such that P(A _n ) = .Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 184, pp. 200–207, 1990.     

Phragmén-Lindelöf theorems for second-order quasilinear elliptic equations

Analogues are formulated of the well-known, in the theory of analytic functions, Phragmen-Lindelöf theorem for the gradients of solutions of a broad class of quasilinear equations of elliptic type. Examples are given illustrating the accuracy of the results obtained for the gradients of solutions of the equations of the form div(|U|^–2u)=f(x, u, u), where f(x, u, u) is a function locally bounded in ²ⁿ⁺¹. f(x, 0, u)=0, uf(x, u, u) c¦u¦1+q(1+ ¦u|), > 1, c > 0, q > 0, is an arbitrary real number, and n >- 2. The basic role in the technique employed in the paper is played by the apparatus of capacitary characteristics.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 10, pp. 1376–1381, October, 1992.The author sincerely appreciates E. M. Landis's permanent attention and numerous useful discussions.     

On blocking sets in affine planes

Denote by _q an affine plane of order q. In the desarguesian case _q=AG(2,q), q 5(q= p^h, p prime), we prove that the smallest cardinality of a blocking set is 2q–1. In any arbitrary affine plane _q (desarguesian or not) with q5, for any integer k with 2q–1 k(q–1)², we construct a blocking set S with ¦S¦=k. For an irreducible blocking set S of _q we determine the upper bound S [qq]+1. We prove that if _q contains a blocking set S which is irreducible with its complementary blocking set, then necessarily _q=AG(2, 4) and S is uniquely determined. Finally we introduce techniques to obtain blocking sets in AG(2, q) and in PG(2, q).Research partially supported by G.N.S.A.G.A. (CNR)     

Maximum of the fourth diameter in the family of continua with prescribed capacity

We obtain a complete solution of the problem of the maximum of the fourth diameter in the family of continua with capacity 1. Let E(o, eⁱ, e^–i). 0<i, e^–i; H(=cap E(o, eⁱ, e^–i). Let C() be the common point of three analytic arcs which form E(o, eⁱ, e^–i). One shows that the indicated maximum is realized by the continuum ={z:H(₀)z ²E(o, eⁱ, e^–i)} where ₀, o<₀z eⁱ z+C ( is a real and C is a complex constant). One finds the value of the required maximum. The paper contains a brief exposition of the proof of this result.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 59, pp. 60–79, 1976.     

On a new class of multiplicative pseudo-random number generators

In the computing literature, there are few detailed analytical studies of the global statistical characteristics of a class of multiplicative pseudo-random number generators.We comment briefly on normal numbers and study analytically the approximately uniform discrete distribution or (j,)-normality in the sense of Besicovitch for complete periods of fractional parts {x _{0 1} ⁱ /p} on [0, 1] fori=0, 1,..., (p–1)p^–1–1, i.e. in current terminology, generators given byx _{n+1 1} x _n mod p wheren=0, 1,..., (p–1)p ^–1–1,p is any odd prime, (x ₀,p)=1, ₁ is a primitive root modp ², and 1 is any positive integer.We derive the expectationsE(X, ),E(X ², ),E(X _nX_n+k); the varianceV(X, ), and the serial correlation coefficient k. By means of Dedekind sums and some results of H. Rademacher, we investigate the asymptotic properties of k for various lagsk and integers 1 and give numerical illustrations. For the frequently used case =1, we find comparable results to estimates of Coveyou and Jansson as well as a mathematical demonstration of a so-called rule of thumb related to the choice of ₁ for small k.Due to the number of parameters in this class of generators, it may be possible to obtain increased control over the statistical behavior of these pseudo-random sequences both analytically as well as computationally.     

The embedding of linearly ordered sets

It is shown that if a linearly ordered set B does not contain as subsets sets of order type and ^* then B can be embedded in 2 . We construct an example of a set satisfying the above conditions which cannot be embedded in any 2 if < . Simultaneously we show that for any ordinal, 2 ⁺¹ cannot be embedded in 2 and that there exists at least ₊₁ distinct dense order types of cardinality 2 .Translated from Matematicheskie Zametki, Vol. 11, No. 1, pp. 83–88, January, 1972.In conclusion, I wish to take the opportunity to thank Yu. L. Ershov for kindness and assistance in this work.     

Growth of length of sequential derivation transformed into natural one

We consider the (&, )-fragment of the intuitionistic propositional calculus. It is proved that under the standard transformation of a Gentzen derivation into a natural derivation(), the length of (())2^2·length( ). There is constructed a sequence of Gentzen derivations of length _i, for which the length of (( _i))2^{1/3·length(i}), which shows that the upper bound obtained is not too weak.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 88, pp. 192–196, 1979.     

Spline finite difference methods for singular two point boundary value problems

Summary In this paper we discuss the construction of a spline function for a class of singular two-point boundary value problemx ^–(x u)=f (x, u),u(0)=A,u(1)=B, 0<<1 or =1,2. The boundary conditions may also be of the formu(0)=0,u(1)=B. Three point finite difference methods, using the above splines, are obtained for the solution of the boundary value problem. These methods are of second order and are illustrated by four numerical examples.