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 the positive definiteness of n ↦ epnα for α close to 2

For >2, let Q ⁺() be the infimum of those q>0 for which the function n e^pn is positive definite on N ₀ for every pq. We shall prove that Q ⁺()0 as 2.     

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.     

On some properties of multiple conjugate trigonometric series

We have obtained an estimate, in terms of partial and mixed moduli, of the continuity of deviation of the Cesáro (C, ) means ( = (₁,...,_n),_i , ₁ > –1, ) of the sequence of rectangular partial sums ofn-multiple (n>1) conjugate trigonometric series from then-multiple truncated conjugate function. This estimate implies the result on them -convergence (1) of (C, ) means (₁ > 0, ) provided that the essential conditions are imposed on the partial moduli of continuity. Finally, it is shown that them -convergence cannot be replaced by ordinary convergence.     

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.     

Mouvement brownien,cônes et processus stables

Summary LetW=(W _t, t0) denote a two-dimensional Brownian motion starting at 0 and, for 0<<, letC be a wedge in ² with vertex 0 and angle 2. We consider the set of timest's such that the path ofW, up to timet, stays inside the translated wedgeW _t-C. It follows from recent results of Burdzy and Shimura that this set, which we denote byH , contains nonzero times if, and only if, >/4. Here we construct a measure, a local time, supported onH . For /4W, time-changed by the inverse of this local time, is shown to be a two-dimensional stable process with index 2-/2. This results extends Spitzer's construction of the Cauchy process, which is recovered by taking =/2. A formula which describes the behaviour ofW before a timetH is established and applied to the proof of a conjecture of Burdzy. We also obtain a two-dimensional version of the famous theorem of Lévy concerning the maximum process of linear Brownian motion. Precisely, for 0<S _t denote the vertex of the smallest wedge of the typez-C which contains the path ofW up to timet. The processS _t-W_t is shown to be a reflected Brownian motion in the wedgeC , with oblique reflection on the sides. Finally, we investigate various extensions of the previous results to Brownian motion inR ^d, d3. LetC be the cone associated with an open subset of the sphereS ^d-1, and letH be defined asH above. Sufficient conditions are given forH to contain nonzero times, in terms of the first eigenvalue of the Dirichlet Laplacian on .     

A generalized sandwich theorem

It is proved for an arbitrary commutative ring A with identity and any integer n3 that if H is a subgroup of GL_n(A) normalized by E _n(A,q), then there is an ideal of A such that E _n(A,) H GL _n (A, (:q⁴⁰).Furthermore, is uniquely determined up to a certain equivalence relation on the set of ideals of A. The result extends a theorem of Bak, by removing a stability condition he uses on A.     

The order of approximation to functions of the Zα. Class by means of positive linear operators

Let C_n (, ) be the upper bound for deviations of periodic functions which form the Zygmund class Z,0 0<<2 from a class of positive linear operators. A study is made of the conditions under which there exists a limit nC_n(, )=C(, ). An explicit expression is given for the functions C(,).Translated from Matematicheskie Zametki, Vol. 4, No. 2, pp. 201–210, August, 1968.     

Bounding the diameter of a distance regular graph by a function ofk d

Let be a distance regular graph with diameterd, and _d () the set of vertices at distanced from. is said to be thin if the induced subgraph on _d () is a union of cliques for every vertex. We show that the diameterd is bounded above by a function depending only onk _d, which is the cardinality of _d (), if is not thin. We also investigate thin distance regular graphs witha _d 0.     

On computing the number of subgroups of a finite Abelian group

We consider the numberN _A (r) of subgroups of orderp ^r ofA, whereA is a finite Abelianp-group of type =₁,₂,..., _l ()), i.e. the direct sum of cyclic groups of order ⁱⁱ. Formulas for computingN _A (r) are well known. Here we derive a recurrence relation forN _A (r), which enables us to prove a conjecture of P. E. Dyubyuk about congruences betweenN _A (r) and the Gaussian binomial coefficient .     

Finding the αn-th largest element

We describe an algorithm for selecting the n-th largest element (where 0<<1), from a totally ordered set ofn elements, using at most (1+(1+o(1))H())·n comparisons whereH() is the binary entropy function and theo(1) stands for a function that tends to 0 as tends to 0. For small values of this is almost the best possible as there is a lower bound of about (1+H())·n comparisons. The algorithm obtained beats the global 3n upper bound of Schönhage, Paterson and Pippenger for <1/3.     

Choosing the maximum from a sequence with a discount function

Choosing the maximum value from a sequence ofN independent values is a well known problem often called the candidate problem or secretary problem. This paper treats the above problem with a discount penalty (0<<1) for each additional observation taken. It is shown that asN increases indefinitely, the optimal stopping policy is bounded although the maximum expected payoff goes to zero, and that there exists a sequence 0= ₀<₁<₂<<1, such that the asymptotic optimal stopping rule is the same for all _i–1<_i.     

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.     

Fredholm integro-differential equation

We consider numerical solution of an integro-differential equation with nonsmooth initspaial values. Unique solvability in Sobolev spaceW ₂ (0, 1), =1,2, is proved. We establish the rate of convergence of the approximate solution to the exact solution in fractional spacesW ₂ ⁺¹ , 01, with approximation order O(h ^++1/2 ) for 01/2 andO(h ⁺¹ |ln h|1/2, for 1/2 #x2264;1.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 64, pp. 8–16, 1988.     

The Parametric Buffer Phenomenon for a Singularly Perturbed Telegraph Equation with a Pendulum Nonlinearity

We consider the boundary-value problem u _tt + u _t + (1 + cos2)sin u =² u _xx, u _x|_x=0=u_x|_x==0, where 0<1, =(1+)t, ,> 0, and the sign of is arbitrary. It is proved that for an appropriate choice of the external parameters and and for sufficiently small the number of exponentially stable solutions 2-periodic in can be made equal to an arbitrary predefined number.     

Sur la convergence presque sure,au sens de Cesaro d'ordre α, 0<α<1, de variables aléatoires indepéndantes et identiquement distribuées

Summary We prove the following theorem: «Given 0<1, the (C, )-means of a sequence of i.i.d. random variables X _n converge a.s. iff E|X _n|^1/<.» For 1/2<1 and 0<<1/2 this result is essentially known. We give here a proof of the case =1/2; an important tool is a theorem of Hsu and Robbins [5].     

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 _,.     

Factorizations of the Complete Graph into C 5-Factors and 1-Factors

In this paper, we show that K_10n can be factored into C₅-factors and 1-factors for all non-negative integers and satisfying 2+=10n–1.Research partially supported by an NSF-AWM Mentoring Travel Grant     

On complexity of subset interconnection designs

Given a setX and subsetsX ₁,...,X _m, we consider the problem of finding a graphG with vertex setX and the minimum number of edges such that fori=1,...,m, the subgraphG _i; induced byX _i is connected. Suppose that for any pointsx ₁,...,x X, there are at mostX _i 's containing the set {x₁,...,x }. In the paper, we show that the problem is polynomial-time solvable for ( 2, 2) and is NP-hard for (3,=1), (=l,6), and (2,3).Support in part by the NSF under grant CCR-9208913 and CCR-8920505.Part work was done while this author was visiting at DIMACS and on leave from Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing.     

α-Sober spaces via the orthogonal closure operator

Each ordinal equipped with the upper topology is a T ₀-space. It is well known that for =2 the reflective hull of in Top₀ is the subcategory of sober spaces. Here, we define -sober space for each 2 in such a way that the reflective hull of in Top₀ is the subcategory of -sober spaces. Moreover, we obtain an order-preserving bijective correspondence between a proper class of ordinals and the corresponding (epi)reflective hulls. Our main tool is the concept of orthogonal closure operator, first introduced in [12].The author acknowledges financial support from Instituto Politécnico de Viseu and from Centro de Matemática da Universidade de Coimbra.