Cyclic codes over the rings Z 2?+ uZ 2 and Z 2?+ uZ 2?+ u 2 Z 2

In this paper, we study cyclic codes over the rings Z ₂ + uZ ₂ and Z ₂ + uZ ₂ + u ² Z ₂ . We find a set of generators for these codes. The rank, the dual, and the Hamming distance of these codes are studied as well. Examples of cyclic codes of various lengths are also studied.      

Uniqueness in the Inverse Conductivity Problem for Conductivities with 3/2 Derivatives inLp,p> 2n

We establish uniqueness in the inverse conductivity problem for conductivities which have 3/2 derivatives in L^p, p > 2n. Our results are in dimensions three and higher.     

Semiorders and the 1/3–2/3 conjecture

A well-known conjecture of Fredman is that, for every finite partially ordered set (X, <) which is not a chain, there is a pair of elements x, y such that P(x, the proportion of linear extensions of (X, <) with x below y, lies between 1/3 and 2/3. In this paper, we prove the conjecture in the special case when (X, <) is a semiorder. A property we call 2-separation appears to be crucial, and we classify all locally finite 2-separated posets of bounded width.     

Rado Numbers for the Equation ∑i = 1 xi + c = xm, for Negative Values of c

For every integer m ≥ 3 and every integer c, let r(m, c) be the least integer, if it exists, such that for every 2-coloring of the set {1, 2, …, r(m, c)} there exists a monochromatic solution to the equation The values of r(m, c) were previously known for all values of m and all nonnegative values of c. In this paper, exact values of r(m, c) are found for all values of m and all values of c such that − m + 2 < c < 0 or c < − (m − 1)(m − 2). Upper and lower bounds are given for the remaining values of c.     

On the k-error linear complexity of sequences with period 2pn over GF(q)

In this paper, we first optimize the structure of the Wei–Xiao–Chen algorithm for the linear complexity of sequences over GF(q) with period N =  2p ⁿ , where p and q are odd primes, and q is a primitive root modulo p ². The second, an union cost is proposed, so that an efficient algorithm for computing the k-error linear complexity of a sequence with period 2p ⁿ over GF(q) is derived, where p and q are odd primes, and q is a primitive root modulo p ². The third, we give a validity of the proposed algorithm, and also prove that there exists an error sequence e ^N , where the Hamming weight of e ^N is not greater than k, such that the linear complexity of (s + e) ^N reaches the k-error linear complexity c. We also present a numerical example to illustrate the algorithm. Finally, we present the minimum value k for which the k-error linear complexity is strictly less than the linear complexity.     

The least squares problem of the matrix equation A1X1B1^T ＋ A2X2B2^T = T

The matrix least squares （LS） problem minx ｜｜AXB^T--T｜｜F is trivial and its solution can be simply formulated in terms of the generalized inverse of A and B. Its generalized problem minx1,x2 ｜｜A1X1B1^T ＋ A2X2B2^T - T｜｜F can also be regarded as the constrained LS problem minx=diag（x1,x2） ｜｜AXB^T -T｜｜F with A = [A1, A2] and B = [B1, B2]. The authors transform T to T such that min x1,x2 ｜｜A1X1B1^T＋A2X2B2^T -T｜｜F is equivalent to min x=diag（x1 ,x2） ｜｜AXB^T - T｜｜F whose solutions are included in the solution set of unconstrained problem minx ｜｜AXB^T - T｜｜F. So the general solutions of min x1,x2 ｜｜A1X1B^T ＋ A2X2B2^T -T｜｜F are reconstructed by selecting the parameter matrix in that of minx ｜｜AXB^T - T｜｜F.     

On the number of words in the language {w σ W = w}

Let S be the set of all palindromes over Σ^*. It is well known, that the language S² is an ultralinear, inherently ambiguous context-free language. In this paper we derive an explicit expression for the number of words of length n in S². Furthermore, we show, that for card(Σ) > 1 the asymptotical density of the language S² is zero and that, in the average, each word w of length n in S² has exactly one factorization into two palindromes for large n; the variance is zero for large n. Finally, we compute an expression for the structure-generating- function T(S²;z) of the language S²; it remains the open problem, if T(S²;z) is a transcendental or an algebraic function.     

Embedding the diamond graph inLpand dimension reduction inL1

We show that any embedding of the level k diamond graph of Newman and Rabinovich [NR] into L_p, 1 < p 2, requires distortion at least . An immediate corollary is that there exist arbitrarily large n-point sets such that any D-embedding of X into requires . This gives a simple proof of a recent result of Brinkman and Charikar [BrC] which settles the long standing question of whether there is an L₁ analogue of the Johnson-Lindenstrauss dimension reduction lemma [JL].     

A method for the resolution of the Jacobi equation Y ″ + RY = 0 on the manifold Sp (2)/ SU (2)

In this paper a method for the resolution of the differential equation of the Jacobi vector fields in the manifold V ₁ = Sp(2)/SU(2) is exposed. These results are applied to determine areas and volumes of geodesic spheres and balls.     

A conjecture of Abe-Iiyori and the Ree groups 2F4(q), II

In this paper the author has solved a problem of Abe and liyori for the finite simple groups ² F ₄(q) and ² F ₄(2)′.     

Characterizability of the Group ^2Dp（3） by its Order Components,Where p ≥ 5 is a Prime Number Not of the Form 2^m ＋ 1

The author will prove that the group ^2Dp（3） can be uniquely determined by its order components, where p ≠ 2^m ＋ 1 is a prime number, p ≥ 5. More precisely, if OC（G） denotes the set of order components of G, we will prove OC（G） = OC（^2Dp（3）） if and only if G is isomorphic to ^2Dp（3）. A main consequence of our result is the validity of Thompson＇s conjecture for the groups under consideration.     

Lp Markov–Bernstein Inequalities on All Arcs of the Circle

Let 0<p<∞ and 0α<β2π. We prove that for n1 and trigonometric polynomials s_n of degree n, we have

Full-size image

cn^p ∫^β_α |s_n(θ)|^p dθ, where c is independent of α, β, n, s_n. The essential feature is the uniformity in [α,β] of the estimate and the fact that as [α,β] approaches [0,2π], we recover the L_p Markov inequality. The result may be viewed as the complete L_p form of Videnskii's inequalities, improving earlier work of the second author.     

The kernel of the Rost invariant, Serre''s Conjecture II and the Hasse principle for quasi-split groups 3,6 D 4 , E 6 , E 7

 We prove that for a simple simply connected quasi-split group of type ^3,6 D ₄ ,E ₆ ,E ₇ defined over a perfect field F of characteristic ≠=2,3 the Rost invariant has trivial kernel. In certain cases we give a formula for the Rost invariant. It follows immediately from the result above that if cd F≤2 (resp. vcd F≤2) then Serre's Conjecture II (resp. the Hasse principle) holds for such a group. For a (C ₂ )-field, in particular ℂ(x,y), we prove the stronger result that Serre's Conjecture II holds for all (not necessary quasi-split) exceptional groups of type ^3,6 D ₄ ,E ₆ ,E ₇ . Received: 27 March 2002 / Published online: 28 March 2003 The author gratefully acknowledge the support of TMR ERB FMRX CT-97-0107 and Forschungsinstitut für Mathematik, ETH in Zürich     

Cap representations of G2 and the spin L-function of PGSp6

We give a construction of a family of CAP representations of the exceptional group G ₂, whose existence is predicted by Arthur’s conjecture. These are constructed by lifting certain cuspidal representations of PGS _p6. To show that the lifting is non-zero, we establish a Rankin-Selberg integral for the degree 8 Spin L-function of these cuspidal representations of PGS _p6.     

K2 of a Ring via the G-Construction

We interpret the Steinberg symbols x_i,j(a) as homotopies contracting the elementary matrices e_i,j(a), the latters being represented by certain arcs in a simplicial model of the K-theory. We further prove the Steinberg relations for these homotopies. This provides an explicit map from K₂ of a ring, defined classically as ker(St(R) → GL(R)), to π₂ of the G-construction assigned to R. Though the two groups are known to be isomorphic, a certain work is to be done to prove that this explicit map is an isomorphism. Mathematics Subject Classification 1991: Primary 19B99, 19D99; secondary 18E10, 18F25.     

Algebraic K-Theory and the Conjectural Leibniz K-Theory

The analogy between algebraic K-theory and cyclic homology is used to build a program aiming at understanding the algebraic K-theory of fields and the periodicity phenomena in algebraic K-theory. In particular, we conjecture the existence of a Leibniz K-theory which would play the role of Hochschild homology. We propose a motivated presentation for the Leibniz K ₂-group ofa field.     

On the Diophantine System a^2 ＋ b^2 = c^3 and a^x ＋ b^y = c^z for b is an Odd Prime

Let a, b and c be fixed coprime positive integers. In this paper we prove that if a^2 ＋ b^2 = c^3 and b is an odd prime, then the equation a^x ＋ b^y = c^z has only the positive integer solution （x, y, z） = （2,2,3）.     

Euler-type transformations for the generalized hypergeometric function r+2Fr+1(x)

We provide generalizations of two of Euler’s classical transformation formulas for the Gauss hypergeometric function extended to the case of the generalized hypergeometric function _r+2 F _r+1(x) when there are additional numeratorial and denominatorial parameters differing by unity. The method employed to deduce the latter is also implemented to obtain a Kummer-type transformation formula for _r+1 F _r+1 (x) that was recently derived in a different way.     

F_2+vF_2上的循环码

本文研究了环F_2+vF_2上的循环码.利用标准形生成元集刻画了环F_2+vF_2上的循环码的代数结构,证明了环F_2+vF_2上的每一个非零的循环码均有唯一的标准形生成元集,进而得到了每一个循环码均是由一个多项式生成的.     

Exact Convergence Rate for the Distributions of GI/M/c/K Queue as K Tends to Infinity

We obtain the exact convergence rate of the stationary distribution ^(K) of the embedded Markov chain in GI/M/c/K queue to the stationary distribution of the embedded Markov chain in GI/M/c queue as K. Similar result for the time-stationary distributions of queue size is also included. These generalize Choi and Kim's results of the case c=1 by nontrivial ways. Our results also strengthen the Simonot's results [5].