Syzygies of Veronese Embeddings

We prove that the Veronese embedding _O ⁿ (d): ^{n N} with n2, d3 does not satisfy property N _p (according to Green and Lazarsfeld) if p3d–2. We make the conjecture that also the converse holds. This is true for n=2 and for n=d=3.     

Arithmetic Properties of Summands of Partitions

Let d d, d2 2. We prove that for almost all partitions of an integer the parts are well distributed in residue classes mod d. The limitations of the uniformity of this distribution are also studied.     

A class of multiple shrinkage estimators

Based on a sample of size n, we investigate a class of estimators of the mean of a p-variate normal distribution with independent components having unknown covariance. This class includes the James-Stein estimator and Lindley's estimator as special cases and was proposed by Stein. The mean squares error improves on that of the sample mean for p3. Simple approximations imations for this improvement are given for large n or p. Lindley's estimator improves on that of James and Stein if either n is large, and the coefficient of variation of is less than a certain increasing function of p, or if p is large. An adaptive estimator is given which for large samples always performs at least as well as these two estimators.     

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.     

Elliptic boundary-value problems in complete scales of Nikol'skii-type spaces

We consider an elliptic boundary-value problem on an infinitely smooth manifold with, generally speaking, disconnected boundary. It is established that the operator of this problem is a Fredholm operator when considered in complete scales of functional spaces that depend on the parameterss ,p[1, ] and, for sufficiently large s0, coincide with the classical Nikol'skii spaces on a manifold.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 46, No. 12, pp. 1647–1654, December, 1994.In conclusion, the author expresses his deep gratitude to V. A. Mikhailets and Ya. A. Roitberg for helpful discussions.     

Sets with fixed congruence in a steiner system

In this paper we study particular sets of a Steiner systemS. More precisely, we study the setsA such that ¦A ¦ d modh for all lines ofS, withd andh integers satisfyingd 0,h 2.Dedicated to Professor M. Scafati Tallini on the occasion of her sixtyfifth birthday     

A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

Slope Estimates of Artin–Schreier Curves

Let X/F_p be an Artin–Schreier curve defined by the affine equation y ^p –y=f(x) where f(x)F_p[x] is monic of degree d. In this paper we develop a method for estimating the first slope of the Newton polygon of X. Denote this first slope by NP₁(X/F_p). We use our method to prove that if p>d2 then NP₁(X/F_p)(p–1)/d/(p–1). If p>2d4, we give a sufficient condition for the equality to hold.     

On properties of the probabilistic constrained linear programming problem and its dual

In this paper, the two problems inf{inf{cx:x R ⁿ,A ₁ xy,A ₂ xb}:y suppF R ^m,F(y)p} and sup{inf{uy:y suppF R ^m,F(y)p}+vb:uA ₁+vA ₂=c, (u,v0} are investigated, whereA ₁,A ₂,b,c are given matrices and vectors of finite dimension,F is the joint probability distribution of the random variables ₁,..., _m, and 0<p<1. The first problem was introduced as the deterministic equivalent and the second problem was introduced as the dual of the probabilistic constrained linear programming problem inf{cx:P(A ₁ x)p,A ₂ xb}.b}. Properties of the sets and the functions involved in the two problems and regularity conditions of optimality are discussed.     

Some applications of the nash-williams lemma to the edge-reconstruction conjecture

It is shown that a graph whose vertices have one of four possible degrees is edgereconstructible if either 8 ord 2log ₂ 68, where andd are the minimum and the average degree of a graph respectively.     

Groups with a class of Frobenius-Abelian elements

Let G be a group, a G ^#, and let F_a be the set of all Frobenius subgroups with noninvariant factor a in G. In Theorems 1–3, we show that if a ² 1and G has sufficiently many subgroups a, a ^g F _a. then a^G F _a.An element a is called (almost) Frobenius if, for (almost) all elements a ^g,the subgroup a, a ^g either belongs to F _a or is Abelian. In Theorems 4–5, we investigate the structure of a ^G in G for the case where a is an (almost) Frobenius-Abelian element of order 2.In Theorem 6, we prove that a binary factorable group is locally completely factorable. Translated fromAlgebra i Logika, Vol. 34, No. 5, pp. 531–549, September-October, 1995.     

Primitive Inner Illuminating Systems for Convex Bodies

A set X of boundary points of a (possibly unbounded) convex body KE ^d illuminating K from within is called primitive if no proper subset of X still illuminates K from within. We prove that for such a primitive set X of an unbounded, convex set KE ^d (distinct from a cone) one has X=2 if d=2, X6 if d=3, and that there is no upper bound for X if d4.     

Weak Laws with Random Indices for Arrays of Random Elements in Rademacher Type p Banach Spaces

For a sequence of constants {a _n,n1}, an array of rowwise independent and stochastically dominated random elements { V _nj, j1, n1} in a real separable Rademacher type p (1p2) Banach space, and a sequence of positive integer-valued random variables {T _n, n1}, a general weak law of large numbers of the form is established where {c _nj, j1, n1}, _n , b _n are suitable sequences. Some related results are also presented. No assumption is made concerning the existence of expected values or absolute moments of the {V _nj, j1, n1}. Illustrative examples include one wherein the strong law of large numbers fails.     

Über die Quadratwurzel-Schranke für Quadratische-Rest-Codes

The minimal distanced of any QR-Code of lengthn 3mod4 over a prime fieldGF (p) with p3 mod4 satisfies the improved square root bound d(3d-2)4(n–1).

---

---

Helmut Karzel zum 60. Geburtstag gewidmet     

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.     

Degenerate multidimensional dispersion laws

A study is made of the degeneracy of multidimensional dispersion laws (k) that increase unboundedly as k and satisfy some additional conditions. Under the assumption that the corresponding degeneracy functionf(k) satisfies a certain condition [Eq. (4)], it is shown that only two-dimensional dispersion laws of the form (p,q)=p ³(q/p)+cp(q/p)(|p|,|q|1), wherep(q/p)=f(p, q) is the corresponding unique degeneracy function, can be degenerate with respect to a 12 process. Some conditions that the function () must satisfy are obtained. The explicit form of a degenerate dispersion law with functionp ³(q/p) of polynomial form is found.Institute of Physics, Georgian Academy of Sciences. Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 95, No. 1, pp. 20–33, April, 1993.     

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.

     

Editorial Policy

Consider the parametric linear complementarity problem w=Mz+q+p, w0, z0, w ^T z=0, where p0, 0q0, and 0. We show that a necessary condition for every complementary map z() to be isotone for every nonzero q0 and every p is that M be either a P-matrix or a -matrix. The Cottle necessary and sufficient conditions for strong and uniform isotonicity for P-matrices are restated, with slight modifications, for -matrices.     

Ü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.     

There Exists a Simple Non Trivial t-design with an Arbitrarily Large Automorphism Group for Every t

In 1987, Teirlinckproved that if t and are two integers such that v t(mod(t + 1)!^(2t+1) and v t + 1 >0, then there exists a t - (v, t + 1, (t + 1)!^(2t+1)) design. We prove that if there exists a (t+1)-(v,k,)design and a t-(v-1,k-2, (k-t-1)/(v-k+1))design with t 2, then there exists a t-(v+1,k, (v-t+1)(v-t)/ (v-k+1)(k-t))design. Using this recursive construction, we prove that forany pair (t,n) of integers (t 2and n 0), there exists a simple non trivial t-(v,k,) design having an automorphism groupisomorphic to ⁿ ₂.