On the Achievement of the Griesmer Bound

The main theorem in this paper is that there does not exist an [n,k,d]_q code with d = (k-2)q ^k-1 - (k-1)q^k-2 attaining the Griesmer bound for q k, k=3,4,5 and for q 2k-3, k 6.     

Steady vortex rings with swirl in an ideal fluid: asymptotics for some solutions in exterior domains

In this paper, the axisymmetric flow in an ideal fluid outside the infinite cylinder (rd) where (r, , z) denotes the cylindrical co-ordinates in ³ is considered. The motion is with swirl (i.e. the -component of the velocity of the flow is non constant). The (non-dimensional) equation governing the phenomenon is (Pd) displayed below. It is known from e.g. [9] that for the problem without swirl (f _q = 0 in (f)) in the whole space, as the flux constant k tends to 1) dist(0z, A) = O(k ^1/2); diam A = O(exp(–c ₀ k ^3/2));2) k^1/2)_k converges to a vortex cylinder U _m (see (1.2)).We show that for the problem with swirl, as k , 1) holds; if m q + 2 then 2) holds and if m > q + 2 it holds with U _q+2 instead of U _m. Moreover, these results are independent of f ₀, f _q and d > 0.     

Krasnosel'skii numbers for bounded finitely starlike sets inR d

For eachk andd, 1kd, definef(d, d)=d+1 andf(d, k)=2d if 1kd–1. The following results are established:Let be a uniformly bounded collection of compact, convex sets inR ^d . For a fixedk, 1kd, dim {MM in }k if and only if for some > 0, everyf(d, k) members of contain a commonk-dimensional set of measure (volume) at least.LetS be a bounded subset ofR ^d . Assume that for some fixedk, 1kd, there exists a countable family of (k–l)-flats {H _i :i1} inR ^d such that clS S {H_i i 1 } and for eachi1, (clS S) H _i has (k–1) dimensional measure zero. Every finite subset ofS sees viaS a set of positivek-dimensional measure if and only if for some>0, everyf(d,k) points ofS see viaS a set ofk-dimensional measure at least .The numbers off(d,d) andf(d, 1) above are best possible.Supported in part by NSF grant DMS-8705336.     

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)     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

Evolution in a Gaussian Random Field

We consider an evolution process in a Gaussian random field V(q) with the mean ‹V(q)› = 0 and the correlation function W(|q – q|) ‹V(q)V(q)›, where q ^d and d is the dimension of the Euclidean space ^d . For the value ‹G(q,t;q ₀)›, t > 0, of the Green's function of the evolution equation averaged over all realizations of the random field, we use the Feynman–Kac formula to establish an integral equation that is invariant with respect to a continuous renormalization group. This invariance property allows using the renormalization group method to find an asymptotic expression for ‹G(q,t;q ₀)› as |q – q ₀| and t .     

Asymptotic behavior of the dwell time distribution for a random walk on a positive semi-axis

Let ₁, ₂, ... be a sequence of independent identically distributed random variables with zero means. We consider the functional _n = _k=o ⁿ (S _k ) where S₁=0, S_k= _i=1 ^k _i (k1) and(x)=1 for x0,(x) = 0 for x<0. It is readily seen that _n is the time spent by the random walk S_n, n0, on the positive semi-axis after n steps. For the simplest walk the asymptotics of the distribution P (_n = k) for n and k, as well as for k = O(n) and k/n<1, was studied in [1]. In this paper we obtain the asymptotic expansions in powers of n^–1 of the probabilities P(h_n = nx) and P(nx_{1 n} nx₂) for 0<₁, x = k/n ₂<1, 0<₁x₁2₂<1.Translated from Matematicheskie Zametki, Vol. 15, No. 4, pp. 613–620, April, 1974.The author wishes to thank B. A. Rogozin for valuable discussions in the course of his work.     

Distribution of primes of the form P=[tc]-[nd] in arithmetic progressions

Ew obtain an asymptotic formula and a theorem about the mean (of the type of the large sieve) for the numberF _c,d (x;q,l) of primes px such thatp=(modq), p=[t^c]=[n ^d ], t,n , whereq>0, ,c,d are given numbers.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 121, pp. 94–202, 1983.     

Mean-field critical behaviour for correlation length for percolation in high dimensions

Summary Extending the method of [27], we prove that the corrlation length of independent bond percolation models exhibits mean-field type critical behaviour (i.e. (p(p _c –p)^–1/2 aspp _c ) in two situations: i) for nearest-neighbour independent bond percolation models on ad-dimensional hypercubic lattice ^d , withd sufficiently large, and ii) for a class of spread-out independent bond percolation models, which are believed to belong to the same universality class as the nearest-neighbour model, in more than six dimensions. The proof is based on, and extends, a method developed in [27], where it was used to prove the triangle condition and hence mean-field behaviour of the critical exponents , , , and ₂ for the above two cases.     

A Second Descent Problem for Quadratic Forms

Let F be a field of characteristic different from 2. We discuss a new descent problem for quadratic forms, complementing the one studied by Kahn and Laghribi. More precisely, we conjecture that for any quadratic form q over F and any Im(W(F) W(F(q))), there exists a quadratic form W(F) such that dim 2 dim and _F(q), where F(q) is the function field of the projective quadric defined by q = 0. We prove this conjecture for dim 3 and any q, and get partial results for dim {4, 5,6}. We also give other related results.     

On empty convex polytopes

Letn andd be integers,n>d 2. We examine the smallest integerg(n,d) such that any setS of at leastg(n,d) points, in general position in E^d, containsn points which are the vertices of an empty convexd-polytopeP, that is, SintP = 0. In particular we show thatg(d+k, d) = d+2k–1 for 1 k iLd/2rL+1.     

On the Minimum Size of Some Minihypers and Related Linear Codes

We denote by m_r,q(s) the minimum value of f for which an {f, _r-2+s ; r,q }-minihyper exists for r 3, 1 s q–1, where _j=(q^j+1–1)/(q–1). It is proved that m_3,q(s)=₁(₁+s) for many cases (e.g., for all q 4 when ) and that m_r,q(s) _r-1+s₁+q for 1 s q – 1,~q 3,~r 4. The nonexistence of some [n,k,n+s–q^k-2]_q codes attaining the Griesmer bound is given as an application.AMS classification: 94B27, 94B05, 51E22, 51E21     

A graded scale of parametric families of distributions,and parameter estimates based on the sample mean

Summary Denote by _k a class of familiesP={P} of distributions on the line R¹ depending on a general scalar parameter , being an interval of R¹, and such that the moments µ₁()=xdP ,...,µ_2k ()=x ^2k dP are finite, ₁ (), ..., _k (), _k+1 () ..., _k () exist and are continuous, with ₁ () 0, and _j +1 ()= ₁ () _j () +[₂() -₁()²] _j ()/ ₁ (), J=2, ..., k. Let ₁=¯x=x ₁ + ... +x _n/n, ₂=x ₁ ² + ... +x _n ²/n, ..., _k =(x ₁ ^k + ... +x _n ^k/n denote the sample moments constructed for a sample x₁, ..., x_n from a population with distribution Pg. We prove that the estimator of the parameter by the method of moments determined from the equation ₁= ₁() and depending on the observations x₁, ..., x_n only via the sample mean ¯x is asymptotically admissible (and optimal) in the class _k of the estimators determined by the estimator equations of the form ₀ () + ₁ () ₁ + ... + _k () _k =0 if and only ifP _k .The asymptotic admissibility (respectively, optimality) means that the variance of the limit, as n (normal) distribution of an estimator normalized in a standard way is less than the same characteristic for any estimator in the class under consideration for at least one 9 (respectively, for every ).The scales arise of classes _{1 2}... of parametric families and of classes _{1 2} ... of estimators related so that the asymptotic admissibility of an estimator by the method of moments in the class _k is equivalent to the membership of the familyP in the class _k .The intersection consists only of the families of distributions with densities of the form h(x) exp {C₀() + C₁() x } when for the latter the problem of moments is definite, that is, there is no other family with the same moments ₁ (), ₂ (), ...Such scales in the problem of estimating the location parameter were predicted by Linnik about 20 years ago and were constructed by the author in [1] (see also [2, 3]) in exact, not asymptotic, formulation.Translated from Problemy Ustoichivosti Stokhasticheskikh Modelei, pp. 41–47, 1981.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

Cutting disjoint disks by straight lines

Fork>0 letf(k) denote the minimum integerf such that, for any family ofk pairwise disjoint congruent disks in the plane, there is a direction such that any line having direction intersects at mostf of the disks. We determine the exact asymptotic behavior off(k) by proving that there are two positive constantsd ₁,d ₂ such thatd ₁k logkf(k)d ₂k logk. This result has been motivated by problems dealing with the separation of convex sets by straight lines.The work of the first author was supported in part by the Allon Fellowship, by the Bat Sheva de Rothschild Foundation, by the Fund for Basic Research administered by the Israel Academy of Sciences, and by the Center for Absorbtion in Science. Work by the second author was supported by the Technion V. P.R. Fund, Grant No. 100-0679. The third author's work was supported by the Natural Sciences and Engineering Research Council, Canada, and the joint project Combinatorial Optimization of the Natural Science and Engineering Research Council (NSERC), Canada, and the German Research Association (Deutsche Forschungsgemeinschaft, SFB 303).     

On Inhomogeneous Diophantine Approximation with Some Quasi-Periodic Expressions

We consider the values _|q||q|q – , where is a Hurwitzian number, in other words, its continued fraction expansion includes a quasi-periodic form. Especially, we set = e ^1/s , where s is a positive integer.     

Imbedding of pseudo-Riemannian manifolds in a pseudo-euclidean space

It is proved that every pseudo-Riemannian manifold M _{(p, q)} ⁿ with the C^k metric (3k) has an isometric C^k imbedding in the large in E _{(p, q)} ^{n(n+1)(3n+11)/2} , p(n+1)², q(n+1)².Translated from Matematicheskie Zametki, Vol. 9, No. 2, pp. 193–198, February, 1971.     

1-Homogeneous Graphs with Cocktail Party μ-Graphs

Let be a graph with diameter d 2. Recall is 1-homogeneous (in the sense of Nomura) whenever for every edge xy of the distance partition{{z V() | (z, y) = i, (x, z) = j} | 0 i, j d}is equitable and its parameters do not depend on the edge xy. Let be 1-homogeneous. Then is distance-regular and also locally strongly regular with parameters (v,k,,), where v = k, k = a ₁, (v – k – 1) = k(k – 1 – ) and c ₂ + 1, since a -graph is a regular graph with valency . If c ₂ = + 1 and c ₂ 1, then is a Terwilliger graph, i.e., all the -graphs of are complete. In [11] we classified the Terwilliger 1-homogeneous graphs with c ₂ 2 and obtained that there are only three such examples. In this article we consider the case c ₂ = + 2 3, i.e., the case when the -graphs of are the Cocktail Party graphs, and obtain that either = 0, = 2 or is one of the following graphs: (i) a Johnson graph J(2m, m) with m 2, (ii) a folded Johnson graph J¯(4m, 2m) with m 3, (iii) a halved m-cube with m 4, (iv) a folded halved (2m)-cube with m 5, (v) a Cocktail Party graph K _{m × 2} with m 3, (vi) the Schläfli graph, (vii) the Gosset graph.     

A Distance-Regular Graph with Strongly Closed Subgraphs

Let be a distance-regular graph of diameter d, valency k and r := maxi | (c _i,b _i) = (c ₁,b ₁). Let q be an integer with r + 1 q d – 1.In this paper we prove the following results: Theorem 1 Suppose for any pair of vertices at distance q there exists a strongly closed subgraph of diameter q containing them. Then for any integer i with 1 i q and for any pair of vertices at distance i there exists a strongly closed subgraph of diameter i containing them. Theorem 2 If r 2, then c _2r+3 1.As a corollary of Theorem 2 we have d k ²(r + 1) if r 2.     

A Criterion for Convergence of Weak Greedy Algorithms

We find a class V of sequences such that the condition V is necessary and sufficient for convergence of weak greedy algorithm with weakness sequence for each f and all Hilbert spaces H and dictionaries D. We denote by V the class of sequences x={x _{k k=1} , x _k 0, k=1,2,..., with the following property: there exists a sequence 0=q ₀<q ₁< such that _s=1 2 ^s /q _s )< and _s=1 2^–s _k=1 ^q s ^x _k ²<, where q _s :=q _s –q _s–1.