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.     

Variations on Tilings in the Manhattan Metric

We investigate tilings of the integer lattice in the Euclidean n-dimensional space. The tiles considered here are the union of spheres defined by the Manhattan metric. We give a necessary condition for the existence of such a tiling for Z ⁿ when n 2. We prove that this condition is sufficient when n=2. Finally, we give some tilings of Z ⁿ when n 3.     

Über nullstellenfreie Gebiete von ζ(itk) (s)

Let ^(itk) (s) denote thek-th derivative of the Riemann Zeta-function,s=+it, ,t real numbers,k1 rational integers. Using ideas fromT. C. Titchmarsh and from a paper ofR. Spira, lower bounds are derived for |^(itk)(s)|, |^(itk)(1-s) for >1 and some infinitely many, sufficiently large values oft. Further let be an algebraic number of degreen and heightH; then a lower bound for |^(itk)(its)|, dependent onn, H, k is established for alln,H1,k3, 2+7k/4 and all realt.     

Extremal Eigenvalues of the Laplacian in a Conformal Class of Metrics: The `Conformal Spectrum'

Let M be a compact connected manifold of dimension n endowed witha conformal class C ofRiemannian metrics of volume one. For any integer k 0, we consider the conformal invariant _k ^c (C) defined as the supremum of the k-th eigenvalue _k (g) of the Laplace–Beltrami operator _g , where g runs over C.First, we give a sharp universal lower bound for _k ^c (C) extending to all k a result obtained by Friedlander andNadirashvili for k = 1. Then, we show that the sequence \{ _k ^c (C)\}, that we call `conformal spectrum',is strictly increasing and satisfies, k 0, _k+1 ^c (C) ^n/2– _k ^c (C) ^n/2 n ^n/2 _n , where _n is the volume of the n-dimensionalstandard sphere.When M is an orientable surface of genus , we also considerthe supremum _k ^top()of _k (g) over theset of all the area one Riemannian metrics on M, and study thebehavior of _k ^top() in terms of .     

On the E- and MV-optimality of block designs having k≥v

In this paper we consider the problem of determining and constructing E- and MV-optimal block designs to use in experimental settings where treatments are applied to experimental units occurring in b blocks of size k, k. It is shown that some of the well-known methods for constructing E- and MV-optimal unequally replicated designs having k fail to yield optimal designs in the case where . Some sufficient conditions are derived for the E- and MV-optimality of block designs having and methods for constructing designs satisfying these sufficient conditions are given.     

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.     

Strong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems

Summary In this paper a Strong-Cut Enumerative Procedure for solving Extreme Point Mathematical Programming Problem:MaxC X subject toAX=b and thatX is an extreme point ofDX=d, X is developed. The procedure will avoid the investigation of many of the extreme points ofDX=d,X 0 and also alternative optimas of different best extreme points ofDX=d, X 0 will not be needed. The algorithm is expected to work very efficiently.

---

Zusammenfassung In dieser Arbeit Strong-Cut Enumerative Procedure for Extrem Point Mathematical Programming Problem wird ein sehr effizientes enumeratives Verfahren zur Lösung des ProblemsMax {cx}¦Ax=b;x Extremzahl vonDx=d, x 0entwickelt. Extrempunkte vonDx=d, x 0 werden in systematischer Weise abgesucht, bis Zulässigkeit inAx=b erreicht ist. Die dabei benutzten Kriterien vermeiden die Untersuchung vieler nichtoptimaler Extrempunkte und die Bestimmung alternativer Optimalpunkte vonDx=d, x 0.

     

Long paths and cycles in tough graphs

For a graphG, letp(G) andc(G) denote the length of a longest path and cycle, respectively. Let (t,n) be the minimum ofp(G), whereG ranges over allt-tough connected graphs onn vertices. Similarly, let (t,n) be the minimum ofc(G), whereG ranges over allt-tough 2-connected graphs onn vertices. It is shown that for fixedt>0 there exist constantsA, B such that (t,n)A·log(n) and (t,n)·log((t,n))B·log(n). Examples are presented showing that fort1 there exist constantsA, B such that (t,n)A·log(n) and (t,n)B· log(n). It is conjectured that (t,n) B·log(n) for some constantB. This conjecture is shown to be valid within the class of 3-connected graphs and, as conjectured in Bondy [1] forl=3, within the class of 2-connectedK _1.l-free graphs, wherel is fixed.     

Feller Processes Generated by Pseudo-Differential Operators: On the Hausdorff Dimension of Their Sample Paths

Let {X _t} _t0 be a Feller process generated by a pseudo-differential operator whose symbol satisfiesÇⁿ|q(Ç,)|c(1=)()) for some fixed continuous negative definite function (). The Hausdorff dimension of the set {X _t:tE}, E [0, 1] is any analytic set, is a.s. bounded above by dim E. is the Blumenthal–Getoor upper index of the Levy Process associated with ().     

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.     

On the immersion of metrics close to immersible metrics

For a C^r,-immersion z:X E, r 2, 0 < < 1, of an n-dimensional (n 1) simply-connected C^r+2,-manifold X into Euclidean space E, the metric I(z) induced by z has a neighborhood in C^r,-topology in which every metric from a given subbundle of metrics is C^r,-immersible into E. In particular, it is proved that metric ds ₀ ² of the Riemannian product of p spheres of dimensions ₁, , _p 2 has a neighborhood in C^2,-topology from which any conformally equivalent metric to ds ₀ ² , is immersible into E with dimE = ₁ + + _p + p. The proofs are based on the investigation of a varied system of Gauss—Codazzi—Ricci equations for an infinitely small deformation of surface z(X) in E with a prescribed variation of the metric.Translated from Ukrainskii Geometricheskii Sbornik, No. 35, pp. 49–67, 1992.     

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     

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.     

Connected and alternating vectors: Polyhedra and algorithms

Given a graphG = (V, E), leta ^S, S L, be the edge set incidence vectors of its nontrivial connected subgraphs.The extreme points of = {x R ^E: a^sx |V(S)| - |S|, S L} are shown to be integer 0/± 1 and characterized. They are the alternating vectorsb ^k, k K, ofG. WhenG is a tree, the extreme points ofB 0,b ^kx 1,k K} are shown to be the connected vectors ofG together with the origin. For the four LP's associated with andA, good algorithms are given and total dual integrality of andA proven.On leave from Swiss Federal Institute of Technology, Zurich.     

The Logarithmic Frequency of Values of Additive Functions

We consider the weak convergence of distribution functions (_mx 1/ m)^-1 _{m x},f_x(m)x is a set (x 2) of strongly additive functions such that f_x(p){0,1} for each prime number p.     

Complete stability of large order statistics

Fix an integerr1. For eachnr, letM _nr be the rth largest ofX ₁,...,X _n, where {X _n,n1} is a sequence of i.i.d. random variables. Necessary and sufficient conditions are given for the convergence of _n=r n P[|M _nr /a _n –1|<] for every >0, where {a _n} is a real sequence and –1. Moreover, it is shown that if this series converges for somer1 and some >–1, then it converges for everyr1 and every >–1.     

A series of search designs for 2m factorial designs of resolution V which permit search of one or two unknown extra three-factor interactions

In the absence of four-factor and higher order interactions, we present a series of search designs for 2^m factorials (m6) which allow the search of at most k (=1,2) nonnegligible three-factor interactions, and the estimation of them along with the general mean, main effects and two-factor interactions. These designs are derived from balanced arrays of strength 6. In particular, the nonisomorphic weighted graphs with 4 vertices in which two distinct vertices are assigned with integer weight (13), are useful in obtaining search designs for k=2. Furthermore, it is shown that a search design obtained for each m6 is of the minimum number of treatments among balanced arrays of strenth 6. By modifying the results for m6, we also present a search design for m=5 and k=2.     

Characterizations of the Poisson process as a renewal process via two conditional moments

Given two independent positive random variables, under some minor conditions, it is known that fromE(X^rX+Y)=a(X+Y)^r andE(X^sX+Y)=b(X+Y)^s, for certain pairs ofr ands, wherea andb are two constants, we can characterizeX andY to have gamma distributions. Inspired by this, in this article we will characterize the Poisson process among the class of renewal processes via two conditional moments. More precisely, let {A(t), t0} be a renewal process, with {S _k, k1} the sequence of arrival times, andF the common distribution function of the inter-arrival times. We prove that for some fixedn andk, kn, ifE(S _k ^r A(t)=n)=at^r andE(S _k ^s A(t)=n)=bt^s, for certain pairs ofr ands, wherea andb are independent oft, then {A(t), t0} has to be a Poisson process. We also give some corresponding results about characterizingFto be geometric whenF is discrete.Support for this research was provided in part by the National Science Council of the Republic of China, Grant No. NSC 81-0208-M110-06.     

Random Walks Crossing High Level Curved Boundaries

Let {S _n} be a random walk, generated by i.i.d. increments X _i which drifts weakly to in the sense that as n . Suppose k0, k1, and E|X ₁|^1\k = if k>1. Then we show that the probability that S. crosses the curve nan ^K before it crosses the curve n –an ^k tends to 1 as a . This intuitively plausible result is not true for k = 1, however, and for 1/2 <k<1, the converse results are not true in general, either. More general boundaries g(n) than g(n) = n ^k are also considered, and we also prove similar results for first passages out of regions like { (n, y): n1, |y| (a + n) ^k } as a .     

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.