Extremes of a Gaussian Process and the Constant H α

Consider a triangular array of standard Gaussian random variables {_n,i, i 0, n 1} such that {_n,i, i 0} is a stationary normal sequence for each n 1. Let _n,k = corr(_n,i,_n,i+k). If (1-_n,k)log n _k (0,) as n for some k, then the locations where the extreme values occur cluster and the limiting distribution of the maxima is still the Gumbel distribution as in the stationary or i.i.d. case, but shifted by a parameter measuring the clustering. Triangular arrays of Gaussian sequences are used to approximate a continuous Gaussian process X(t), t 0. The cluster behavior of the random sequence refers to the behavior of the extremes values of the continuous process. The relation is analyzed. It reveals a new definition of the constants H used for the limiting distribution of maxima of continuous Gaussian processes and provides further understanding of the limit result for these extremes.     

On convergence subsystems of orthonormal systems

It is proved that for any sequence {R _k} _k=1 of real numbers satisfyingR _kk (k1) andR _k=o(k log₂ k),k, there exists an orthonormal system {n _k(x)} _n=1 ,x (0;1), such that none of its subsystems {n _k(x)} _k=1 withn _kR_k (k1) is a convergence subsystem.     

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.     

Some inequalities about the covering radius of Reed-Muller codes

Let R(r, m) be the rth order Reed-Muller code of length 2 ^m , and let (r, m) be its covering radius. We prove that if 2 k m - r - 1, then (r + k, m + k) (r, m + 2(k - 1). We also prove that if m - r 4, 2 k m - r - 1, and R(r, m) has a coset with minimal weight (r, m) which does not contain any vector of weight (r, m) + 2, then (r + k, m + k) (r, m) + 2k(. These inequalities improve repeated use of the known result (r + 1, m + 1) (r, m).This work was supported by a grant from the Research Council of Wright State University.     

On the chromatic uniqueness of the graphW(n,n − 2, k)

This paper shows that the graphW(n, n – 2, k) is chromatically unique for any even integern 6 and any integerk 1.     

On the smoothness of the moduli space of mathematical instanton bundles

In this paper we prove that the moduli spaces MI _2n+1(k) of mathematical instanton bundles on ²ⁿ⁺¹ with quantum number k are singular for n 2 and k 3 ,giving a positive answer to a conjecture made by Ancona and Ottaviani in 1993.     

Further results on the covering radii of the Reed-Muller codes

LetR(r, m) by therth order Reed-Muller code of length2 ^m , and let (r, m) be its covering radius. We obtain the following new results on the covering radius ofR(r, m): 1. (r+1,m+2) 2(r, m)+2 if 0rm–2. This improves the successive use of the known inequalities (r+1,m+2)2(r+1,m+1) and (r+1,m+1) (r, m).2.(2, 7)44. Previously best known upper bound for (2, 7) was 46. 3. The covering radius ofR(1,m) inR(m–1,m) is the same as the covering radius ofR(1,m) inR(m–2,m) form4.     

On the kernel of intersecting families

Let be at-wises-intersecting family, i.e.,|F ₁ ... F _t | s holds for everyt members of. Then there exists a setY such that|F ₁ ... F _t Y| s still holds for everyF ₁,...,F _t . Here exponential lower and upper bounds are proven for the possible sizes ofY. This work was done while the authors visited Bell Communication Research, NJ 07960, and AT&T Bell Laboratories, Murray Hill, NJ 07974, USA, respectively.Research supported in part by Allon Fellowship and by Bat Sheva de Rothschild Foundation.     

Toughness and the existence ofk-factors. II

In a paper with the same title [3], we proved Chvátal's conjecture thatk-tough graphs havek-factors if they satisfy trivial necessary conditions. In this paper, we prove the following stronger result: Suppose|V(G)| k + 1,k |V(G)| even, and|S| k w(G – S) – 7/8k ifw(G – S) 2, wherew(G – S) is the number of connected components ofG – S. ThenG has ak-factor.     

Edge Coloring of Embedded Graphs with Large Girth

Let G be a simple graph embedded in the surface of Euler characteristic ()0. Denote _e(G), and g the edge chromatic number, the maximum degree and the girth of the graph G, respectively. The paper shows that _e(G)= if 5 and g4, or 4 and g5, or 3 and g9. In addition, if ()>0, then _e(G)= if 3 and g8. Acknowledgments.The authors would like to thank Dr. C.Q. Zhang for carefully reading several versions of this paper during its preparation and for suggesting several stylistic changes that have improved the overall presentation.     

Abschnittspositive Matrizen und Positivitätsfaktoren in der Limitierungstheorie

Let A and B be normal matrices. In :={x=(x_k) ¦ x_k} we define the order relation _A by x_A0:<=> _k=0 ⁿ a_nkx_k0 (n ). Let T be a row-finite matrix. A is called T-section-positive, if _kt_mkx_ke^(k) _A0 (m ) for x_A0 (see [5]). We study the relation between T-sectional positivity and T-sectional boundedness. An (A,B)-summability factor sequence =(_k) is called positive, if (_kx_k)_B0 for each xc_A with x_A0. For B-section-positive matrices A we give a functional analytic characterization of positive (A,B)-summability factor sequences.

---

---

Die Arbeit entstand während eines vom DAAD unterstützten Forschungsaufenthalts an der Fernuniversität-Gesamthochschule Hagen     

A Necessary and Sufficient Condition for the Existence of Some Ternary [n, k, d] Codes Meeting the Greismer Bound

Let k and d be any integers such that k 4 and . Then there exist two integers and in {0,1,2} such that . The purpose of this paper is to prove that (1) in the case k 5 and (,) = (0,1), there exists a ternary code meeting the Griesmer bound if and only if and (2) in the case k 4 and (,) = (0,2) or (1,1), there is no ternary code meeting the Griesmer bound for any integers k and d and (3) in the case k 5 and , there is no projective ternary code for any integers k and such that 1k-3, where and for any integer i 0. In the special case k=6, it follows from (1) that there is no ternary linear code with parameters [233,6,154] , [234,6,155] or [237,6,157] which are new results.     

On a problem of Erdős and Lovász: Random lines in a projective plane

Letn(k) be the least size of an intersecting family ofk-sets with cover numberk, and let _k denote any projective plane of orderk–1.Theorem There is a constant A such that ifH is a random set ofm Aklogk lines from _k then P_r(H<)0(k).Corollary If there exists a _k thenn(k)=O(klogk). These statements were conjectured by P. Erds and L. Lovász in 1973.Supported in part by NSF-DMS87-83558 and AFOSR grants 89-0066, 89-0512 and 90-0008     

A Class of Iterative Algorithms and Solvability of Nonlinear Variational Inequalities Involving Multivalued Mappings

The solvability of the following class of nonlinear variational inequality (NVI) problems based on a class of iterative procedures, which possess an equivalence to a class of projection formulas, is presented.Determine an element x ^* K and u ^* T(x ^*) such that u ^*, x – x ^* 0 for all x K where T: K P(H) is a multivalued mapping from a real Hilbert space H into P(H), the power set of H, and K is a nonempty closed convex subset of H. The iterative procedure adopted here is represented by a nonlinear variational inequality: for arbitrarily chosen initial points x ⁰, y ⁰ K, u ⁰ T(y ⁰) and v ⁰ T(x ⁰), we have u ^k + x ^k+1 – y ^k , x – x ^k+1 0, x K, for u ^k T(y ^k ) and for k 0where v ^k + y ^k – x ^k , x – y ^k 0, x K and for v ^k T(x ^k ).     

On the Embedding of an Affine Space into a Projective Space

Let k, K be fields, and assume that |k| 4 and n, m 2, or |k| = 3 and n 3, m 2. Then, for any embedding of AG(n, k) into PG(m, K), there exists an isomorphism from k into K and an (n+1) × (m+1) matrix B with entries in K such that can be expressed as (x₁,x₂,...,x_n) = [(1,x₁ ,x₂ ,...,x_n )B], where the right-hand side is the equivalence class of (1,x₁ ,x₂ ,...,x_n )B. Moreover, in this expression, is uniquely determined, and B is uniquely determined up to a multiplication of element of K*. Let l 1, and suppose that there exists an embedding of AG(m+l, k) into PG(m, K) which has the above expression. If we put r = dim _k K, then we have r 3 and m > 2 l-1)/(r-2). Conversely, there exists an embedding of AG(l+m, k) into PG(m, K) with the above expression if K is a cyclic extension of k with dim _k K=r 3, and if m 2l/(r-2) with m even or if m 2l/(r-2) +1 with m odd.     

C k -factorization of complete bipartite graphs

In this paper, it is shown that a necessary and sufficient condition for the existence of aC _k-factorization ofK _m,n is (i)m = n 0 (mod 2), (ii)k 0 (mod 2),k 4 and (iii) 2n 0 (modk) with precisely one exception, namely m =n = k = 6.     

New Hadamard matrices and conference matrices obtained via Mathon's construction

We give a formulation, via (1, –1) matrices, of Mathon's construction for conference matrices and derive a new family of conference matrices of order 59^2t+1 + 1,t 0. This family produces a new conference matrix of order 3646 and a new Hadamard matrix of order 7292. In addition we construct new families of Hadamard matrices of orders 69^2t+1 + 2, 109^2t+1 + 2, 8499 ^t ,t 0;q ²(q + 3) + 2 whereq 3 (mod 4) is a prime power and 1/2(q + 5) is the order of a skew-Hadamard matrix); (q + 1)q ²9 ^t ,t 0 (whereq 7 (mod 8) is a prime power and 1/2(q + 1) is the order of an Hadamard matrix). We also give new constructions for Hadamard matrices of order 49 ^t 0 and (q + 1)q ² (whereq 3 (mod 4) is a prime power).This work was supported by grants from ARGS and ACRB.Dedicated to the memory of our esteemed friend Ernst Straus.     

Differential geometry of tensor product immersions II

In the first part of this series, we prove that the tensor product immersionf ₁ f _2k of2k isometric spherical immersions of a Riemannian manifoldM in Euclidean space is of-type with k and classify tensor product immersionsf ₁ f _2k which are ofk-type. In this article we investigate the tensor product immersionsf ₁ f _2k which are of (k+1)-type. Several classification theorems are obtained.     

The Parameters of Bipartite Q-polynomial Distance-Regular Graphs

Let denote a bipartite distance-regular graph with diameter D 3 and valency k 3. Suppose ₀, ₁, ..., _D is a Q-polynomial ordering of the eigenvalues of . This sequence is known to satisfy the recurrence _{i – 1} – _i + _{i + 1} = 0 (0 > i > D), for some real scalar . Let q denote a complex scalar such that q + q ^–1 = . Bannai and Ito have conjectured that q is real if the diameter D is sufficiently large.We settle this conjecture in the bipartite case by showing that q is real if the diameter D 4. Moreover, if D = 3, then q is not real if and only if ₁ is the second largest eigenvalue and the pair (, k) is one of the following: (1, 3), (1, 4), (1, 5), (1, 6), (2, 4), or (2, 5). We observe that each of these pairs has a unique realization by a known bipartite distance-regular graph of diameter 3.     

On a matrix representation of a free group

An analog of the well-known Sanov representation of a free non-Abelian group by matrices of size 3 is studied. Instead of transvections used in the Sanov representation, we use matrices with filled first (second, etc.) column, except for the intersection with the diagonal, and we have ones on the diagonal and zeros at the other places. The filled places are occupied by the same parameterk. It is proved that, for ¦k¦5, these matrices generate a free group. However, fork=2, this is not the case.Translated fromMatematicheskie Zametki, Vol. 64, No. 6, pp. 863–870, December, 1998.