Linear cyclic codes of wordlength v over GF(q s ) which are also linear cyclic codes of wordlength sv over GF(q)

Any nonsingular linear transformation : GF(q^s) GF(q^s) can be used to treat a linear cyclic code of wordlength v over GF(q^s) as a linear code () of Wordlength sv over GF(q). This paper determines those linear cyclic codes and transformations for which the resulting linear code () is also cyclic.     

Characterization of {(q + 1) + 2, 1;t,q}-min · hypers and {2(q + 1) + 2, 2; 2,q}-min · hypers in a Finite projective geometry

In this paper, we shall characterize all {(q + 1) + 2, 1;t, q}-min · hypers and all {2(q + 1) + 2, 2; 2,q}-min · hypers for any integert 2 and any prime powerq 3. In the next paper [8], we shall characterize all {2(q + 1) + 2, 2;t, q}-min · hypers for any integert 3 and any prime powerq 5 using the results in this paper.     

A Stability Estimate for a Solution to the Problem of Determination of Two Coefficients of a Hyperbolic Equation

We consider the problem of determination of two coefficients (x) and q(x) in a hyperbolic equation. Here (x) is the coefficient of the first derivative with respect to t and q(x) is the coefficient of the solution itself. We suppose that these coefficients are small in some norm and supported in a disk D. Oscillations are excited by the impulse function (t)(x·) supported on the straight line t=0, x·=0. Here is a unit vector playing the role of a parameter of the problem. The acoustic field generated by this source lying outside D is measured at the points of the boundary of D together with the normal derivative on some time interval of a fixed length T for two different values of the parameter . We prove that, for a sufficiently large T, the given information determines the sought coefficients uniquely. We obtain a stability estimate for a solution to the problem.     

Characterization of a Two-Weighted Vector-Valued Inequality for Fractional Maximal Operators

We give a characterization of the weights u(·) and v(·) for which the fractional maximal operator M _s is bounded from the weighted Lebesgue spaces L ^p(l ^r, vdx) into L ^q(l ^r, udx) whenever 0 s < n, 1 < p, r < , and 1 q < .     

Simultaneous Nonvanishing of Twists of Automorphic L-Functions

Given three distinct primitive complex characters ₁,₂,₃ satisfying some technical conditions, we prove that the triple product of twisted L-functions L(f·₁,1/2) L(f·₂,1/2) L(f·₃,1/2) does not vanish for a positive proportion of weight 2 primitive forms for ₀(q), when q goes to infinity through the set of prime numbers. This result, together with some variants, implies the existence of quotients of J ₀(q) of large dimension satisfying the Birch–Swinnerton-Dyer conjecture over cyclic number fields of degree less than 5.P.M. is partially supported by NSF Grant DMS-97-2992 and by the Ellentuck fund (by grants to the Institute for Advanced Study) and by the Institut Universitaire de France.     

Spreads and ovoids in finite generalized quadrangles

This paper is a survey on the existence and non-existence of ovoids and spreads in the known finite generalized quadrangles. It also contains the following new results. We prove that translation generalized quadrangles of order (s,s ²), satisfying certain properties, have a spread. This applies to three known infinite classes of translation generalized quadrangles. Further a new class of ovoids in the classical generalized quadranglesQ(4, 3 ^e ),e3, is constructed. Then, by the duality betweenQ(4, 3 ^e ) and the classical generalized quadrangleW (3 ^e ), we get line spreads of PG(3, 3 ^e ) and hence translation planes of order 3^2e . These planes appear to be new. Note also that only a few classes of ovoids ofQ(4,q) are known. Next we prove that each generalized quadrangle of order (q ²,q) arising from a flock of a quadratic cone has an ovoid. Finally, we give the following characterization of the classical generalized quadranglesQ(5,q): IfS is a generalized quadrangle of order (q,q ²),q even, having a subquadrangleS isomorphic toQ(4,q) and if inS each ovoid consisting of all points collinear with a given pointx ofS\S is an elliptic quadric, thenS is isomorphic toQ(5,q).     

Evolution in a Gaussian Random Field

We consider an evolution process in a Gaussian random field V(q) with the mean ‹V(q)› = 0 and the correlation function W(|q – q|) ‹V(q)V(q)›, where q ^d and d is the dimension of the Euclidean space ^d . For the value ‹G(q,t;q ₀)›, t > 0, of the Green's function of the evolution equation averaged over all realizations of the random field, we use the Feynman–Kac formula to establish an integral equation that is invariant with respect to a continuous renormalization group. This invariance property allows using the renormalization group method to find an asymptotic expression for ‹G(q,t;q ₀)› as |q – q ₀| and t .     

On the number of nowhere zero points in linear mappings

LetA be a nonsingularn byn matrix over the finite fieldGF _q ,k=n/2,q=p ^a ,a1, wherep is prime. LetP(A,q) denote the number of vectorsx in (GF _q ) ⁿ such that bothx andAx have no zero component. We prove that forn2, and ,P(A,q)[(q–1)(q–3)] ^k (q–2) ^n–2k and describe all matricesA for which the equality holds. We also prove that the result conjectured in [1], namely thatP(A,q)1, is true for allqn+23 orqn+14.     

Degeneracy in linear complementarity problems: a survey

Given a square matrixM of ordern and a vectorq ⁿ , the linear complementarity problem is the problem of either finding aw ⁿ and az ⁿ such thatw–Mz=q,w0,z0 andw ^T z=0 or showing that no such (w, z) exists. This problem is denoted asLCP(q, M). We say that a solution (w, z) toLCP(q, M) is degenerate if the number of positive coordinates in (w, z) is less thann. As in linear programming, degeneracy may cause cycling in an adjacent vertex following methods like Lemke's algorithm. Moreover, ifLCP(0,M) has a nontrivial solution, a condition related to degeneracy, then unless certain other conditions are satisfied, the algorithm may not be able to decide about the solvability of the givenLCP(q, M). In this paper we review the literature on the implications of degeneracy to the linear complementarity theory.     

Finite extinction time for some perturbed Hamilton-Jacobi equations

In this paper we study initial value problems likeu _t–R¦u¦^m+u^q=0 in ⁿ× ₊, u(·,0⁺)=u_o(·) in ^N, whereR > 0, 0 <q < 1,m 1, andu _o is a positive uniformly continuous function verifying –R¦u _o¦^m+u ₀ ^q 0 in ^N . We show the existence of the minimum nonnegative continuous viscosity solutionu, as well as the existence of the function t(·) defined byu(x, t) > 0 if 0<t<t (x) andu(x, t)=0 ift t (x). Regularity, extinction rate, and asymptotic behavior of t(x) are also studied. Moreover, form=1 we obtain the representation formulau(x, t)=max{([(u _o(x – t))^1–q –(1–q)t]₊)^1/(1–q): ¦¦R}, (x, t) ₊ ^N+1 .Partially supported by the DGICYT No. 86/0405 project.     

On Bures Distance and *-Algebraic Transition Probability between Inner Derived Positive Linear Forms over W*-Algebras

On a W^*-algebra M, for given two positive linear forms , M ₊ ^* and algebra elements a, b M, a variational expression for the Bures distance d _B( ^a , ^b ) between the inner derived positive linear forms ^a =(a _*·a) and ^b =(b ^*·b) is obtained. Along with the proof of the formula, also an earlier result of S. Gudder on noncommutative probability will be slighly extended. Also, the given expression of the Bures distance relates nicely to the system of seminorms proposed by D. Buchholz which occurs, along with the problem of estimating the so-called `weak intertwiners", in algebraic quantum field theory. In the last section, some optimization problem will be considered.     

Special Pairs in the Generating Subset of the Weierstrass Semigroup at a Pair

We discuss the structure of the Weierstrass semigroup at a pair of points on an algebraic curve. It is known that the Weierstrass semigroup at a pair (P, Q) contains the unique generating subset (P, Q). We find some characterizations of the elements of (P, Q) and prove that, for any point P on a curve, (P, Q) consists of only maximal elements for all except for finitely many points QP on the given curve. Also we obtain more results concerning special and nonspecial pairs.     

Admissibility of linear estimators of regression coefficients under quadratic loss

For the general fixed effects linear model:Y=X+, N(0,V),V0, we obtain the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS in the class of all estimators under the loss function (d -S)D(d -S), whereD0 is known. For the general random effects linear model: =XV ₁₁ X+XV ₁₂+V ₂₁ X+V ₂₂0, we also get the necessary and sufficient conditions forLY+a to be admissible for a linear estimable functionS+Q in the class of all estimators under the loss function (d -S -Q)D(d -S -Q), whereD0 is known.     

Some Problems for Cubic Nonlinear Equations on a Half-Line

The paper deals with a problem of developing an inverse-scattering based formalism for solving problems for the cubic nonlinear (or the modified Korteweg–de Vries (KdV)) equations: q _t +q _xxx +6q ² q _x =0, 0x<, –<t<,q _t +q _xxx –6q ² q _x =0, with the given initial and boundary conditions: q(x,0)=q(x),q(0,t)=p(t), p(t)L ₁(–,). The relation between the solution of the initial-boundary value problem (1), (3), (4) and that of the KdV equation on the half-line is shown. The Cauchy problem for the cubic nonlinear equation: q _t +q _xxx –6|q|² q _x =0, 0x<, –<t<, with the given initial condition (3) is considered also. Here we solve the above problems on the half-line 0x< but with –<t<.     

On the estimation of prediction errors in linear regression models

Estimating the prediction error is a common practice in the statistical literature. Under a linear regression model, lete be the conditional prediction error andê be its estimate. We use (ê, e), the correlation coefficient betweene andê, to measure the performance of a particular estimation method. Reasons are given why correlation is chosen over the more popular mean squared error loss. The main results of this paper conclude that it is generally not possible to obtain good estimates of the prediction error. In particular, we show that (ê, e)=O(n ^–1/2) whenn . When the sample size is small, we argue that high values of (ê, e) can be achieved only when the residual error distribution has very heavy tails and when no outlier presents in the data. Finally, we show that in order for (ê, e) to be bounded away from zero asymptotically,ê has to be biased.     

GBRD's: Some new constructions for difference matrices,generalised hadamard matrices and balanced generalised weighing matrices

A new construction is given for difference matrices. The generalized Hadamard matrices GH(q(q – 1)²; EA(q)) are constructed whenq andq – 1 are both prime powers. Other generalised Hadamard matrices are also shown to exist. For example, there exist GH(n; G) forn = 5² 2 3, 2⁶ 3², 11² 2² 3, 17² 2 3², 53² 2 3³, 71² 2² 3², 107² 2² 3³, 149² 5² 2 3,.... Finally, a new construction for the BGW ((q ⁴ – 1)/(q – 1),q ³,q ²(q – 1);q _q-1), and a construction for the new BGW ((q ⁸ – 1)/(q ² – 1),q ⁶,q ⁴(q ² – 1);G) are given, wheneverq is a prime power, andG is a group of orderq + 1.     

The birth and death processes with zero as their absorbing barrier

LetE=(0, 1,...), Q ^b=(q_ij), i, j=0, 1, ..., whereq _{i, i–1}=a_i, q_{i, i+1}=b_i, q_ii=–(a_i+b_i), q_ij=0, when|i–j|>1. a ₀=0, b₀=b>0, a_i, b_i>0 (i>0). Lettingb=0 inQ ^b, we get the matrixQ ⁰.The time homogeneous Markov processX ^b ={x ^b (t,w), 0t< ^b (w)} (X ⁰={x⁰(t,w), 0t<⁰(w)}), withQ ^b (Q ⁰, respectively) as its density matrix and withE as its state space, is calledQ ^b (Q ⁰, respectively) process in this paper.Q ^b andQ ⁰ processes are all called the birth and death processes, with zero being the reflecting barrier ofQ ^b processes, the absorbing barrier ofQ ⁰ processes.AllQ ^b processes have been constructed by both probability and analytical methods (Wang [2], Yang [1]). In this paper, theQ ⁰ processes are imbedded intoQ ^b processes and all theQ ⁰ processes are directly constructed from theQ ^b processes. The main results are:Letb>0 be arbitrarily fixed, then there is a one to one correspondence between theQ ⁰ processes and theQ ^b processes (in the sense of transition probability).TheQ ⁰ process is unique iffR ^*=. SupposingR<, then:IfX ⁰={x⁰(t,w), 0t<⁰(w)} is a non-minimalQ ⁰ process, then its eigensequence (p, q, r _n, n–1) satisfies § 4(7).Conversely, let a non-negative number sequence (p, q, r _n, n–1) satisfying § 4(7) be arbitrarily given, then there exists a unique non-minimalQ ⁰ processX ⁰ with eigensequence (p, q, r _n, n–1). The Laplace transform of the transition probability (p _ij ⁰ (t)) ofX ⁰ is determined by § 4(15). X ⁰ is honest iffr _–1=0.X ⁰ satisfies the forward equation iffp=0.     

A remark on finiteness of the lower spectrum of uniformly elliptic operators with singular potentials

In this paper, we extend the result of Donig[Do] and show the finiteness of the lower spectrum of the uniformly elliptic operators–·(A(x))+q with singular potentialsq which belong to the Kato class. Even in the case of the Schrödinger operator–+q, our proof simplifies the one in [Do].     

Q-matrices and boundedness of solutions to linear complementarity problems

This paper is concerned with the existence and boundedness of the solutions to the linear complementarity problemw=Mz+q,w0,z0,w ^T z=0, for eachq ⁿ . It has been previously established that, ifM is copositive plus, then the solution set is nonempty and bounded for eachq ⁿ iffM is aQ-matrix. This result is shown to be valid also forL ₂-matrices,P ₀-matrices, nonnegative matrices, andZ-matrices.     

The random-cluster model on the complete graph

Summary The random-cluster model of Fortuin and Kasteleyn contains as special cases the percolation, Ising, and Potts models of statistical physics. When the underlying graph is the complete graph onn vertices, then the associated processes are called mean-field. In this study of the mean-field random-cluster model with parametersp=/n andq, we show that its properties for any value ofq(0, ) may be derived from those of an Erds-Rényi random graph. In this way we calculate the critical point _c (q) of the model, and show that the associated phase transition is continuous if and only ifq2. Exact formulae are given for _C (q), the density of the largest component, the density of edges of the model, and the free energy. This work generalizes earlier results valid for the Potts model, whereq is an integer satisfyingq2. Equivalent results are obtained for a fixed edge-number random-cluster model. As a consequence of the results of this paper, one obtains large-deviation theorems for the number of components in the classical random-graph models (whereq=1).