D λ -cycles in 3-cyclable graphs

Letk and be positive integers, andG a 2-connected graph of ordern with minimum degree and independence number. A cycleC ofG is called aD -cycle if every component ofG – V(C) has order smaller than. The graphG isk-cyclable if anyk vertices ofG lie on a common cycle. A previous result of the author is that if k 2, G isk-connected and every connected subgraphH ofG of order has at leastn +k ² + 1/k + 1 – vertices outsideH adjacent to at least one vertex ofH, thenG contains aD -cycle. Here it is conjectured that k-connected can be replaced by k-cyclable, and this is proved fork = 3. As a consequence it is shown that ifn 4 – 6, or ifG is triangle-free andn 8 – 10, thenG contains aD ₃-cycle orG , where denotes a well-known class of nonhamiltonian graphs of connectivity 2. As an analogue of a result of Nash-Williams it follows that ifn 4 – 6 and – 1, thenG is hamiltonian orG . The results are all best possible and compare favorably with recent results on hamiltonicity of graphs which are close to claw-free.     

Verschärfung einer Ungleichung von Ky Fan

Summary In this paper we prove the following:IfA _n ,G _n andH _n (resp.A _n ,G _n andH _n ) denote the arithmetic, geometric and harmonic means ofa ₁,, a _n (resp. 1 –a ₁,, 1 –a _n ) and ifa _i (0, 1/2],i = 1,,n, then(G _n /G _n ) ⁿ (A _n /A _n ) ^n-1 H _n /H _n , (^*) with equality holding forn = 1,2. Forn 3 equality holds if and only ifa ₁ = =a _n . The inequality (^*) sharpens the well-known inequality of Ky Fan:G _n /G _n A _n /A _n .

     

On the product of sign vectors and unit vectors

For a fixed unit vectora=(a ₁,...,a _n )S ^n-1, consider the 2 ⁿ sign vectors=(₁,..., _n ){±1{ ⁿ and the corresponding scalar products^·a = _n ⁱ⁼¹ = _i a _i . The question that we address is: for how many of the sign vectors must^.a lie between–1 and 1. Besides the straightforward interpretation in terms of the sums ±a ₂ , this question has appealing reformulations using the language of probability theory or of geometry.The natural conjectures are that at least 1/2 the sign vectors yield |.a|1 and at least 3/8 of the sign vectors yield |.a|<1 (the latter excluding the case when |a _i |=1 for somei). These conjectured lower bounds are easily seen to be the best possible. Here we prove a lower bound of 3/8 for both versions of the problem, thus completely solving the version with strict inequality. The main part of the proof is cast in a more general probabilistic framework: it establishes a sharp lower bound of 3/8 for the probability that |X+Y|<1, whereX andY are independent random variables, each having a symmetric distribution with variance 1/2.We also consider an asymptotic version of the question, wheren along a sequence of instances of the problem satisfying ||a||0. Our result, best expressed in probabilistic terms, is that the distribution of .a converges to the standard normal distribution, and in particular the fraction of sign vectors yielding .a between –1 and 1 tends to 68%.This research was supported in part by the Institute for Mathematics and its Applications with funds provided by the National Science Foundation.     

Nonparametric Inference for a Class of Stochastic Partial Differential Equations II

Consider the stochastic partial differential equationdu (t,x) = (t)u (t, x)dt + dW _Q(t,x), 0 t T where = ₂/x ₂, and is a class of positive valued functions. We obtain an estimator for the linear multiplier (t) and establish the consistency, rate of convergence and asymptotic normality of this estimator as 0.     

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.     

Limits of balayage measures

LetA be a subset of a balayage space (X,W) and a measure onX. It is shown that for every sequence _n of measures such that lim_nn and lim_{n n} ^A = the limit measure is of the formf+[(1-f)]^A for some (unique) Borel function 0f1_Cb(A). Furthermore, conditions are given such that any such functionf occurs.     

Resolvent of the Toeplitz operator may increase arbitrarily fast

It is proved that for every sequence of points _n from the unit circle, _n1, and for an arbitrary sequence of positive numbers A_n, A_n, there exists a continuous real function u, such that for the Toeplitz operator T (acting in the Hardy space H²) with the symbol =e ^iu we have the estimates (T–_nI)^–1>A_n, n.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova, AN SSSR, Vol. 157, pp. 175–177, 1987.     

On the Rate of Clustering to the Strassen Set for Increments of the Uniform Empirical Process

We obtain outer rates of clustering in the functional laws of the iterated logarithm of Deheuvels and Mason⁽¹¹⁾ and Deheuvels,⁽⁷⁾ which describe local oscillations of empirical processes. Considering increment sizes a _n 0 such that na _n and na _n(log n)^–7/3 we show that the sets of properly rescaled increment functions cluster with probability one to the _n-enlarged Strassen ball in B(0, 1) endowed with the uniform topology, where _n 0 may be chosen so small as (log (1/a _n) + log log n)^–2/3 for any sufficiently large . This speed of coverage is reduced for smaller a _n.     

Rates of convergence for the stability of large order statistics

Forr1 and eachnr, letM _nr be therth largest ofX ₁,X ₂, ...,X _n , where {X _n ,n1} is an i.i.d. sequence. Necessary and sufficient conditions are presented for the convergence of for all >0 and some –1, where {a _n } is a real sequence. Furthermore, it is shown that this series converges for all >–1, allr1 and all >0 if it converges for some >–1, somer1 and all >0.     

Necessary convergence conditions for series ΣαnSn in the case of identically distributed independent random quantities

Necessary (in some cases also sufficient) conditions are obtained for convergence of the series a _n S _n whereS _n = ₁ ⁿ _k k are independent random quantities. The cases in which k are symmetrical or identically distributed quantities are investigated in more detail.Translated from Matematicheskie Zametki, Vol. 20, No. 4, pp. 529–536, October, 1976.     

A strong law for weighted sums of i.i.d. random variables

A strong law is proved for weighted sumsS _n=a _in X _i whereX _i are i.i.d. and {a _in} is an array of constants. When sup(n ^–1|a _in | ^q )^1/q <, 1<q andX _i are mean zero, we showE|X| ^p <,p ^l+q ^–1=1 impliesS _n /n 0. Whenq= this reduces to a result of Choi and Sung who showed that when the {a _in} are uniformly bounded,EX=0 andE|X|< impliesS _n /n 0. The result is also true whenq=1 under the additional assumption that lim sup |a _in |n ^–1 logn=0. Extensions to more general normalizing sequences are also given. In particular we show that when the {a _in} are uniformly bounded,E|X|^1/< impliesS _n /n 0 for >1, but this is not true in general for 1/2<<1, even when theX _i are symmetric. In that case the additional assumption that (x ^1/ log^1/–1 x)P(|X|x)0 asx provides necessary and sufficient conditions for this to hold for all (fixed) uniformly bounded arrays {a _in}.     

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.     

Canonical contact forms on spherical CR manifolds

We construct the CR invariant canonical contact form can(J) on scalar positive spherical CR manifold (M,J), which is the CR analogue of canonical metric on locally conformally flat manifold constructed by Habermann and Jost. We also construct another canonical contact form on the Kleinian manifold ()/, where is a convex cocompact subgroup of Aut_CRS²ⁿ⁺¹=PU(n+1,1) and () is the discontinuity domain of . This contact form can be used to prove that ()/ is scalar positive (respectively, scalar negative, or scalar vanishing) if and only if the critical exponent ()<n (respectively, ()>n, or ()=n). This generalizes Nayatanis result for convex cocompact subgroups of SO(n+1,1). We also discuss the connected sum of spherical CR manifolds.     

Multi-Faithful Spanning Trees of Infinite Graphs

For an end and a tree T of a graph G we denote respectively by m() and m _T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m _T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m _T () = f() for every end of G.     

Triple Positive Solutions for Multipoint Conjugate Boundary Value Problems

For the nth order nonlinear differential equation y ⁽ⁿ⁾(t)=f(y(t)), t [0,1], satisfying the multipoint conjugate boundary conditions, y ^(j)(a_i) = 0,1 i k, 0 j n _i - 1, 0 =a ₁ < a ₂ < < a _k = 1, and _i=1 ^k n _i =n, where f: [0, ) is continuous, growth condtions are imposed on f which yield the existence of at least three solutions that belong to a cone.     

Some propositions related to a dilation theorem of W. Benz

Summary This paper begins with another proof of a theorem of W. Benz [2] concerning dilations in normed linear spaces. Our proof motivates several questions which are addressed thereafter. For instance it is shown that, ifI is an open interval in ,: I ⁿ , is continuously differentiable and there exista ₁,...,a _n I such that {(a ₁,...,(a _n )} is linearly independent, then {(t): t I} contains a Hamel basis for ⁿ over .     

Compact operators whose singular numbers have powerlike asymptotics

For a compact operator in a Hilbert space, let s_n(A), n =1, 2,... be the singular numbers and let N(s; A) =card{n N:s_n(A)>, s>0. For 0

a _p and not on the individual elementAa, (H. Weyl's lemma); this allows us to write _p (a), _pp (a), a_p. One obtains certain results regarding the functionals _p, _p (and about the analogous functionals for the positive and negative eigenvalues in the casea=a ^*=A ^*:A a. In particular: I. Ifa ₁ a _2p, then. II.Let a ₁,a _{2 pP} ,.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matetmaticheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 126, pp. 21–30, 1983.     

Taut Distance-Regular Graphs of Odd Diameter

Let denote a bipartite distance-regular graph with diameter D 4, valency k 3, and distinct eigenvalues ₀ > ₁ > ··· > _D. Let M denote the Bose-Mesner algebra of . For 0 i D, let E _i denote the primitive idempotent of M associated with _i . We refer to E ₀ and E _D as the trivial idempotents of M. Let E, F denote primitive idempotents of M. We say the pair E, F is taut whenever (i) E, F are nontrivial, and (ii) the entry-wise product E F is a linear combination of two distinct primitive idempotents of M. We show the pair E, F is taut if and only if there exist real scalars , such that _{i + 1 i + 1} – _{i – 1 i – 1} = _i ( _{i + 1} – _{i – 1}) + _i ( _{i + 1} – _{i – 1}) + (1 i D – 1)where ₀, ₁, ..., _D and ₀, ₁, ..., _D denote the cosine sequences of E, F, respectively. We define to be taut whenever has at least one taut pair of primitive idempotents but is not 2-homogeneous in the sense of Nomura and Curtin. Assume is taut and D is odd, and assume the pair E, F is taut. We show

On the concept of code-isomorphy

LetF be a finite set of cardinality ¦F¦ =q 2,n 1 an integer and :F ⁿ×Fⁿ₀ theHamming metric. Acode isomorphism C D between two block codesC,D Fⁿ is defined as an isometry which can be extended to an isometry of the whole space Fⁿ. Any permutation S _n of the positions canonically induces a so-calledequivalence map Aut Fⁿ; any system (₁,₂,...,_n) ofn permutations of the character setF induces a so-calledconfiguration Aat Fⁿ. The group Aut Fⁿ of all isometries of Fⁿ turns out to be semidirect product of the configuration group with the symmetric group of degreen. The codeword estimating failure probability of a maximum likelihood codeword estimator for aq-nary symmetric channel does not depend on the transmitted codeword, if the automorphism group of the code acts transitively on the set of codewords. When using a systematic (n, k)-encoder, the symbol decoding failure probability does not depend on the transmitted symbol or on the time of transmission if the configuration group and the automorphism group act transitively on the set of codewords resp. on the set of thek information positions.In memoriam Giuseppe Tallini     

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