Montgomery's weighted sieve for dimension two

The most well-known application of Montgomery's weighted sieve is to the so-called Brun-Titchmarsh inequality, which was proved byH. L. Montgomery andR. C. Vaughan in the form (x, k, l)2x((k)log(x/k))^–1 for 1k<x, (k, l)=1, (x, k, l) being the number of primespx andpl modk, (k) being Euler's function. In this paper an upper estimate is given for a certain class of two-dimensional sieve problems, among them bounds for the number of twin primes and the number of Goldbach representations.     

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.     

Efficient Regular Polygon Dissections

We study the minimum number g(m,n) (respectively, p(m,n)) of pieces needed to dissect a regular m-gon into a regular n-gon of the same area using glass-cuts (respectively, polygonal cuts). First we study regular polygon-square dissections and show that n/2 -2 g(4,n) (n/2) + o(n) and n/4 g(n,4) (n/2) + o(n) hold for sufficiently large n. We also consider polygonal cuts, i.e., the minimum number p(4,n) of pieces needed to dissect a square into a regular n-gon of the same area using polygonal cuts and show that n/4 p(4,n) (n/2) + o(n) holds for sufficiently large n. We also consider regular polygon-polygon dissections and obtain similar bounds for g(m,n) and p(m,n).     

Quasianapole Interaction of Charged Fermions

We obtain the analytic expression for the total cross section of the reaction e ^– e ⁺l ^– l ⁺ (l=,) taking possible quasianapole interaction effects into account. We find numerical restrictions on the interaction parameter value from data for the reaction e ^– e ^+–+ in the energy domain below the Z ⁰ peak.     

Infinitesimal obstructions to weakly mixing

Let ^t be the flow (parametrized with respect to arc length) of a smooth unit vector field v on a closed Riemannian manifold M ⁿ , whose orbits are geodesics. Then the (n-1)-plane field normal to v, v, is invariant under d ^t and, for each x M, we define a smooth real function _x (t) : (1 + _i (t)), where the _i(t) are the eigenvalues of AA ^T, A being the matrix (with respect to orthonormal bases) of the non-singular linear map d^2t , restricted to v at the point _x ^-t M ⁿ.Among other things, we prove the Theorem (Theorem II, below). Assume v is also volume preserving and that _x ^' (t) 0 for all x M and real t; then, if _x ^t : M M is weakly missng for some t, it is necessary that vx 0 at all x M.     

On the exactness of a theorem of G.A. Fomin

, . . [1] - . .     

A Proof of the Jungnickel-Tonchev Conjecture on Quasi-Multiple Quasi-Symmetric Designs

A proof of the following conjecture of Jungnickel and Tonchev on quasi-multiple quasi-symmetric designs is given: Let D be a design whose parameter set (v,b,r,k,) equals (v,sv,sk,k, s) for some positive integer s and for some integers v,k, that satisfy (v-1) = k(k-1) (that is, these integers satisfy the parametric feasibility conditions for a symmetric (v,k,)-design). Further assume that D is a quasi-symmetric design, that is D has at most two block intersection numbers. If (k, (s-1)) = 1, then the only way D can be constructed is by taking multiple copies of a symmetric (v,k, )-design.     

Quasi-coherence of Hardy spaces in several complex variables

In this paper, we prove that the Hardy spaceH ^p (), 1p<, over a strictly pseudoconvex domain in ⁿ with smooth boundary is quasi-coherent. More precisely, we show that Toeplitz tuplesT with suitable symbols onH ^p () have property (). This proof is based on a well known exactness result for the tangential Cauchy-Riemann complex.     

Асимптоический Анализ Распределения Статистики Диксона

. u 60-u u     

Critical points of essential norms of singular integral operators in weighted spaces

We show that for any simple piecewise Ljapunov contour there exists a power weight such that the essential norm |S | in the spaceL ₂(, ) does not depend on the angles of the contour and it is given by formula (2). All such weights are described. For the union =₁₂ of two simple piecewise Lyapunov curves we prove that the essential norm |S | inL ₂() is minimal if both ₁ and ₂ are smooth in some neighborhoods of the common points. It is the case when the norm |S | in the spaceL ₂() as well as inL ₂(, ) does not depend on the values of the angles and it can be calculated by formula (5).     

Waterman classes and triangular sums of double Fourier series

Let ^a ={nln^a (n+1)}, where a R. The following results are established: For every &fnof ^a BV ((- ]²), the triangular partial sums of its Fourier series are uniformly bounded if a = -1, and converge everywhere if a < -1.For every a>0, there exists &fnof ^a BV ((- ]²) such that the triangular partial sums of its Fourier series are unbounded at the point (0;0).     

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

Local isometric immersions of two-dimensional metrics inE 4 with prescribed Gaussian torsion

Suppose that in a domain R(, B) of variables (r, ): (0 r , ₁ +B(r–r ₀ ) ₂–B(r–r₀), where > 0, B > 0, ₁ < 0 < ₂ are numbers) a metric ds² = dr² +G(r, )d ² and a function k(r, ) are given. The problem of isometrically immersing ds² in E ⁴ with prescribed Gaussian torsion is considered. The following is proved: The class C ⁵ metric ds ² is locally realized in the form of a class C ³ surface F ² whose Gaussian torsion is the prescribed class C ³ function (r, ).Translated from Ukrainskii Geometricheskii Sbornik, No. 35, pp. 38–47, 1992.     

Les classes de Chern des représentations galoisiennes complexes

Let F be a field, G _F its absolute Galois group, : G _FGL(C) a continuous complex representation of G _F and c _i() H_2i(F, Z) its Chern classes. We show, under a mild assumption on F. that c _i ()=0 for all i2. For general F, one has that 2c_i ()=0 for all i 2.

Cette dernière condition résulte en fait de la continuité de .     

On generalized gamma functions related to the Laurent coefficients of the Riemann zeta function

Summary We study a class of generalized gamma functions _k (z) which relate to the generalized Euler constants _k (basically the Laurent coefficients of(s)) as (z) does to the Euler constant. A new series expansion for _k is derived, and the constant term in the asymptotic expansion for log _k (z) is studied in detail. These and related constants are numerically computed for 1 k 15.     

Large-Deviation Local Theorem for Additive Functionals of a Markov Gaussian Field. I

We prove a local limit theorem (LLT) on Cramer-type large deviations for sums S _V = _t V ( _t ), where _t , t Z , 1, is a Markov Gaussian random field, V Z , and is a bounded Borel function. We get an estimate from below for the variance of S _V and construct two classes of functions , for which the LLT of large deviations holds.     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

Linear cyclic codes of wordlength v over GF(q s ) which are also linear cyclic codes of wordlength sv over GF(q)

Any nonsingular linear transformation : GF(q^s) GF(q^s) can be used to treat a linear cyclic code of wordlength v over GF(q^s) as a linear code () of Wordlength sv over GF(q). This paper determines those linear cyclic codes and transformations for which the resulting linear code () is also cyclic.     

On a problem of B. I. Golubov

. . . : s_n(x) — , _n-(, 1)- n L ². , . , : a _k l ² _n () [0,1] , (*) , (**) . a _k l ² u _n () [0,1] , (**), (*) .     

Convolution semigroups and central limit theorem associated with a dual convolution structure

We consider hypergroups associated with Jacobi functions ⁽⁾ (x), (–1/2). We prove the existence of a dual convolution structure on [0,+[i(]0,s ₀]{{) =++1,s ₀=min(,–+1). Next we establish a Lévy-Khintchine type formula which permits to characterize the semigroup and the infinitely divisible probabilities associated with this dual convolution, finally we prove a central limit theorem.