On the admissible families of components of hamming codes

In this paper, the properties of the i-components of Hamming codes are described. We suggest constructions of the admissible families of components of Hamming codes. Each q-ary code of length m and minimum distance 5 (for q = 3, the minimum distance is 3) is shown to embed in a q-ary 1-perfect code of length n = (q ^m − 1)/(q − 1). Moreover, each binary code of length m+k and minimum distance 3k + 3 embeds in a binary 1-perfect code of length n = 2 ^m − 1.     

On cyclic codes of length $${2^{2^r}-1}$$ with two zeros whose dual codes have three weights

In 1976, Helleseth conjectured that two binary m-sequences of length 2 ^m − 1 can not have a three-valued crosscorrelation function when m is a power of 2. We show that this conjecture is true when −1 is a correlation value. In other words, if C_1,k{{\mathcal{C}}_{1,k}} is the cyclic code of length 2 ^m − 1 with two zeros α, α ^k , where α is a primitive element of \mathbbF_2^m{{\mathbb{F}}_{2^m}} and gcd(k, 2 ^m − 1) = 1, then its dual C_1,k^{^}{{\mathcal{C}}_{1,k}^{\perp}} can not have three weights when m is a power of 2.     

On K 1,k -factorization of bipartite multigraphs

A K1,k-factorization of λKm,n is a set of edge-disjoint K1,k-factors of λKm,n, which partition the set of edges of λKm,n. In this paper, it is proved that a sufficient condition for the existence of K1,k-factorization of λKm,n, whenever k is any positive integer, is that （1） m ≤ kn, （2） n ≤ km, （3） km-n = kn-m ≡ 0 （mod （k^2- 1）） and （4） λ（km-n）（kn-m） ≡ 0 （mod k（k- 1）（k^2 - 1）（m ＋ n））.     

On the binary codes with parameters of triply-shortened 1-perfect codes

We study properties of binary codes with parameters close to the parameters of 1-perfect codes. An arbitrary binary (n?=?2 ^m ? 3, 2 ^n-m-1, 4) code C, i.e., a code with parameters of a triply-shortened extended Hamming code, is a cell of an equitable partition of the n-cube into six cells. An arbitrary binary (n?=?2 ^m ? 4, 2 ^n-m , 3) code D, i.e., a code with parameters of a triply-shortened Hamming code, is a cell of an equitable family (but not a partition) with six cells. As a corollary, the codes C and D are completely semiregular; i.e., the weight distribution of such codes depends only on the minimal and maximal codeword weights and the code parameters. Moreover, if D is self-complementary, then it is completely regular. As an intermediate result, we prove, in terms of distance distributions, a general criterion for a partition of the vertices of a graph (from rather general class of graphs, including the distance-regular graphs) to be equitable.     

On Intersection Problem for Perfect Binary Codes

The main result is that to any even integer q in the interval 0 ≤ q ≤ 2^{n+1-2log(n+1)}, there are two perfect codes C₁ and C₂ of length n = 2^m − 1, m ≥ 4, such that |C₁ ∩ C₂| = q.     

On nonsystematic perfect codes over finite fields

The nonsystematic perfect q-ary codes over finite field F _q of length n = (q ^m − 1)/(q − 1) are constructed in the case when m ≥ 4 and q ≥ 2 and also when m = 3 and q is not prime. For q ≠ 3, 5, these codes can be constructed by switching seven disjoint components of the Hamming code H _q ⁿ ; and, for q = 3, 5, eight disjoint components.     

Error Correcting Sequence and Projective De Bruijn Graph

Let X be a finite set of q elements, and n, K, d be integers. A subset C ⊂ X ⁿ is an (n, K, d) error-correcting code, if #(C) = K and its minimum distance is d. We define an (n, K, d) error-correcting sequence over X as a periodic sequence {a _i } _i=0,1,... (a _i ∈ X) with period K, such that the set of all consecutive n-tuples of this sequence form an (n, K, d) error-correcting code over X. Under a moderate conjecture on the existence of some type of primitive polynomials, we prove that there is a error correcting sequence, such that its code-set is the q-ary Hamming code with 0 removed, for q > 2 being a prime power. For the case q = 2, under a similar conjecture, we prove that there is a error-correcting sequence, such that its code-set supplemented with 0 is the subset of the binary Hamming code [2 ^m  − 1, 2 ^m  − 1 − m, 3] obtained by requiring one specified coordinate being 0. Received: October 27, 2005. Final Version received: December 31, 2007     

On Kneser solutions of higher order nonlinear ordinary differential equations

The equationx ⁽ⁿ⁾(t)=(−1) ⁿ │x(t)│ ^k withk>1 is considered. In the casen≦4 it is proved that solutions defined in a neighbourhood of infinity coincide withC(t−t₀)^−n/(k−1), whereC is a constant depending only onn andk. In the general case such solutions are Kneser solutions and can be estimated from above and below by a constant times (t−t ₀)^−n/(k−1). It is shown that they do not necessarily coincide withC(t−t₀)^−n/(k−1). This gives a negative answer to two conjectures posed by Kiguradze that Kneser solutions are determined by their value in a point and that blow-up solutions have prescribed asymptotics. Dedicated to Professor Vladimir Maz'ya on the occasion of his 60th birthday. The author was supported by the Swedish Natural Science Research Council (NFR) grant M-AA/MA 10879-304.     

Factorization for non-nevanlinna classes of analytic functions

A generalization of the Blaschke product is constructed. This product enables one to factor out the zeros of the members of certain non-Nevanlinna classes of functions analytic in the unit disc, so that the remaining (non-vanishing) functions still belong to the same class. This is done for the classesA ⁻ⁿ (0<n<∞) andB ⁻ⁿ (0<n<2) defined as follows:f ∈A ⁻ⁿ iff |f(z)|≦C _f (1−|z|)⁻ⁿ ,f ∈B ⁻ⁿ iff |f(z)|≦exp {C _f (1−|z|)⁻ⁿ }, whereC _f depends onf.     

A class of optimal linear codes of length one above the Griesmer bound

In this paper, we determine the smallest lengths of linear codes with some minimum distances. We construct a [g _q (k, d) + 1, k, d] _q code for sq ^k-1 − sq ^k-2 − q ^s  − q ² + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s with 3 ≤ s ≤ k − 2 and q ≥ s + 1. Then we get n _q (k, d) = g _q (k, d) + 1 for (k − 2)q ^k-1 − (k − 1)q ^k-2 − q ² + 1 ≤ d ≤ (k − 2)q ^k-1 − (k − 1)q ^k-2, k ≥ 6, q ≥ 2k − 3; and sq ^k-1 − sq ^k-2 − q ^s  − q + 1 ≤ d ≤ sq ^k-1 − sq ^k-2 − q ^s , s ≥ 2, k ≥ 2s + 1 and q ≥ 2s − 1. This work was partially supported by the Com²MaC-SRC/ERC program of MOST/KOSEF (grant ^# R11-1999-054) and was partially supported by the Korea Research Foundation Grant funded by the Korean Government(MOEHRD)(KRF-2005-214-C00175).     

Smooth convex bodies with proportional projection functions

For a convex body K ⊂ ℝⁿ and i ∈ {1, …, n − 1}, the function assigning to any i-dimensional subspace L of ℝⁿ, the i-dimensional volume of the orthogonal projection of K to L, is called the i-th projection function of K. Let K, K ₀ ⊂ ℝⁿ be smooth convex bodies with boundaries of class C ² and positive Gauss-Kronecker curvature and assume K ₀ is centrally symmetric. Excluding two exceptional cases, (i, j) = (1, n − 1) and (i, j) = (n − 2, n − 1), we prove that K and K ₀ are homothetic if their i-th and j-th projection functions are proportional. When K ₀ is a Euclidean ball this shows that a convex body with C ² boundary and positive Gauss-Kronecker with constant i-th and j-th projection functions is a Euclidean ball. The second author was supported in part by the European Network PHD, FP6 Marie Curie Actions, RTN, Contract MCRN-511953.     

A new extension theorem for 3-weight modulo q linear codes over $${\mathbb{F}_ q}$$

We prove that every [n, k, d] _q code with q ≥ 4, k ≥ 3, whose weights are congruent to 0, −1 or −2 modulo q and is extendable unless its diversity is for odd q, where .      

Polynomials of best approximation inC[−1,1]

Equivalences between the condition |P _n ^(k) (x)|≦K(n ⁻¹√1−x ²+1/n ²) ^k n ^-a, whereP _n(x) is the bestn-th degree polynomial approximation tof(x), and the Peetre interpolation space betweenC[−1,1] and the space (1−x ²) ^k f ^(2k)(x)∈C[−1,1] is established. A similar result is shown forE _n(f)= ‖f−P _n‖ _C[−1,1]. Rates other thann ^-a are also discussed. Supported by NSERC grant A4816 of Canada.     

Algebraic relations for reciprocal sums of odd terms in Fibonacci numbers

In this paper, we prove the algebraic independence of the reciprocal sums of odd terms in Fibonacci numbers ∑ _n=1^∞ F _2n−1⁻¹, ∑ _n=1^∞ F _2n−1⁻², ∑ _n=1^∞ F _2n−1⁻³ and write each ∑ _n=1^∞ F _2n−1^−s (s≥4) as an explicit rational function of these three numbers over ℚ. Similar results are obtained for various series including the reciprocal sums of odd terms in Lucas numbers.      

A central limit theorem for “critical” first-passage percolation in two dimensions

Summary. Consider (independent) first-passage percolation on the edges of ℤ ² . Denote the passage time of the edge e in ℤ ² by t(e), and assume that P{t(e) = 0} = 1/2, P{0<t(e)<C ₀ } = 0 for some constant C ₀ >0 and that E[t ^δ (e)]<∞ for some δ>4. Denote by b _0,n the passage time from 0 to the halfplane {(x,y): x ≧ n}, and by T( 0 ,nu) the passage time from 0 to the nearest lattice point to nu, for u a unit vector. We prove that there exist constants 0<C ₁ , C ₂ <∞ and γ _n such that C ₁ ( log n) ^1/2 ≦γ _n ≦ C ₂ ( log n) ^1/2 and such that γ _n ⁻¹ [b _0,n −Eb _0,n ] and (√ 2γ _n ) ⁻¹ [T( 0 ,nu) − ET( 0 ,nu)] converge in distribution to a standard normal variable (as n →∞, u fixed). A similar result holds for the site version of first-passage percolation on ℤ ² , when the common distribution of the passage times {t(v)} of the vertices satisfies P{t(v) = 0} = 1−P{t(v) ≧ C ₀ } = p _c (ℤ ² , site ) := critical probability of site percolation on ℤ ² , and E[t ^δ (u)]<∞ for some δ>4. Received: 6 February 1996 / In revised form: 17 July 1996     

UNIFORM CONVERGENCE OF CESARO MEANS OF NEGATIVE ORDER OF DOUBLE TRIGONOMETRIC FOURIER SERIES

In this paper we prove that iff ∈ C([-π,π]2) and the function f is bounded partial p-variation for some p ∈ [1, ∞), then the double trigonometric Fourier series of a function f is uniformly (C;-α,-β) summable (α β＜ 1/p,α,β＞ 0) in the sense of Pringsheim. If α β≥ 1/p, then there exists a continuous function f0 of bounded partial double trigonometric Fourier series of fo diverge over cubes.     

On Lp-convergence of Grunwald interpolation

In this paper, the L_p-convergence of Grünwald interpolation G_n(f,x) based on the zeros of Jacobi polynomials J _n ^(α,β) (x)(−1<α,β<1) is considered. L_p-convergence (0<p<2) of Grünwald interpolation G_n(f,x) is proved for p·Max(α,β)<1. Moreover, L_p-convergence (p>0) of G_n(f,x) is obtained for −1<α,β≤0. Therefore, the results of [1] and [3–5] are improved.     

On Some Three-Color Ramsey Numbers

 In this paper we study three-color Ramsey numbers. Let K _i,j denote a complete i by j bipartite graph. We shall show that (i) for any connected graphs G ₁, G ₂ and G ₃, if r(G ₁, G ₂)≥s(G ₃), then r(G ₁, G ₂, G ₃)≥(r(G ₁, G ₂)−1)(χ(G ₃)−1)+s(G ₃), where s(G ₃) is the chromatic surplus of G ₃; (ii) (k+m−2)(n−1)+1≤r(K _1,k , K _1,m , K _n )≤ (k+m−1)(n−1)+1, and if k or m is odd, the second inequality becomes an equality; (iii) for any fixed m≥k≥2, there is a constant c such that r(K _k,m , K _k,m , K _n )≤c(n/logn), and r(C _2m , C _2m , K _n )≤c(n/logn) ^m/(m−1) for sufficiently large n. Received: July 25, 2000 Final version received: July 30, 2002 RID="*" ID="*" Partially supported by RGC, Hong Kong; FRG, Hong Kong Baptist University; and by NSFC, the scientific foundations of education ministry of China, and the foundations of Jiangsu Province Acknowledgments. The authors are grateful to the referee for his valuable comments. AMS 2000 MSC: 05C55     

New Families in the Stable Homotopy of Spheres Revisited

This paper constructs a new family in the stable homotopy of spheres π _{t −6} S represented by h _n g ₀γ₃∈E ^{6 t} ₂ in the Adams spectral sequence which revisits the b _{n −1} g ₀γ₃-elements ∈π _{t −7} S constructed in [3], where t = 2p ⁿ (p− 1) + 6(p ² + p + 1)(p− 1) and p≥ 7 is a prime, n≥ 4. Received October 7, 1998, Revised May 8, 2000, Accepted August 8, 2000.     

Hyperplane codes

We construct a family of linear codes of lengthN=( _m ⁿ )(q-1) ^m-1 and of dimensionn (orn−1) overGF(q). Their minimum distance and their weight distribution are calculated. These codes are subschemes of the hypercubic association schemeH(N,q).