On the singular Bochner-Martinelli integral

The Bochner-Martinelli (B.-M.) kernel inherits, forn2, only some of properties of the Cauchy kernel in . For instance it is known that the singular B.-M. operatorM _n is not an involution forn2. M. Shapiro and N. Vasilevski found a formula forM ₂ ² using methods of quaternionic analysis which are essentially complex-twodimensional. The aim of this article is to present a formula forM _n ² for anyn2. We use now Clifford Analysis but forn=2 our formula coincides, of course, with the above-mentioned one.     

Resolution of the Symmetric Nonnegative Inverse Eigenvalue Problem for Matrices Subordinate to a Bipartite Graph

There is a symmetric nonnegative matrix A, subordinate to a given bipartite graph G on n vertices, with eigenvalues _{12 n} if and only if, ₁ + _n 0, ₂ + _n-10,..., _m + _{n - m + 1}0, _{m + 1}0,..., _{n - m} 0, in which m is the matching numberof G. Other observations are also made about the symmetric nonnegative inverse eigenvalue problem with respect to a graph     

Steiner minimal trees for regular polygons

Fifty years ago Jarnik and Kössler showed that a Steiner minimal tree for the vertices of a regularn-gon contains Steiner points for 3 n5 and contains no Steiner point forn=6 andn13. We complete the story by showing that the case for 7n12 is the same asn13. We also show that the set ofn equally spaced points yields the longest Steiner minimal tree among all sets ofn cocircular points on a given circle.     

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.     

On a characterization of complete matrix rings

Peter R. Fuchs established in 1991 a new characterization of complete matrix rings by showing that a ringR with identity is isomorphic to a matrix ringM _n (S) for some ringS (and somen 2) if and only if there are elementsx andy inR such thatx ^n–1 0,x ⁿ=0=y ²,x+y is invertible, and Ann(x ^n–1)Ry={0} (theintersection condition), and he showed that the intersection condition is superfluous in casen=2. We show that the intersection condition cannot be omitted from Fuchs' characterization ifn3; in fact, we show that if the intersection condition is omitted, then not only may it happen that we do not obtain a completen ×n matrix ring for then under consideration, but it may even happen that we do not obtain a completem ×m matrix ring for anym2.     

Graphs isomorphic to subgraphs of their iterated line graphs

A graphG is said to be embeddable into a graphH, if there is an isomorphism ofG into a subgraph ofH. It is shown in this paper that every unicycle or tree which is neither a path norK _1,3 embeds in itsn-th iterated line graph forn1 or 2, 3, and that every other connected graph that embeds in itsn-th iterated line graph may be constructed from such an embedded unicycle or tree in a natural way. A special kind of embedding of graph into itsn-th iterated line graph, called incidence embedding, is studied. Moreover, it is shown that for every positive integerk, there exists a graphG such that (G) = , where (G) is the leastn1 for whichG embeds inL ⁿ(G).     

Some natural constructions on vector fields and higher order cotangent bundles

We prove that forn-manifolds (n3) the sets of all natural operatorsT(T ^r* ,T ^q* ) andT-TT ^r* , respectively, are free finitely generatedC (R ^r)-modules. We construct explicitly the bases of theC (R ^r)-modules.     

Integral Representation of Harmonic Functions Defined Outside a Compact Set in a Harmonic Space

Given here is an integral representation for any harmonic function u0 defined outside a compact set in a Brelot harmonic space with or without positive potentials by means of signed measurers on . This generalizes the Bôcher theorem on positive harmonic singularities in ; ⁿ , n2.     

Nonexistence of certain symmetric spherical codes

A spherical 1-codeW is any finite subset of the unit sphere inn dimensionsS ^n–1, for whichd(u, v)1 for everyu, v fromW, uv. A spherical 1-code is symmetric ifuW implies –uW. The best upper bounds in the size of symmetric spherical codes onS ^n–1 were obtained in [1]. Here we obtain the same bounds by a similar method and improve these bounds forn=5, 10, 14 and 22.     

The Barrier Principle for Minimal Submanifolds of Arbitrary Codimension

We establish a barrier principle for minimal submanifolds of a Riemannianmanifold of arbitrary codimension. We construct examples of barriers fortwo-dimensional minimal surfaces in ⁿ, n 4, and apply these to deduceexistence as well as nonexistence theorems for Plateau's problem.     

Smallest maximally nonhamiltonian graphs

A graphG ismaximally nonhamiltonian iffG is not hamiltonian butG + e is hamiltonian for each edgee inG ^c, i.e., any two non-adjacent vertices ofG are ends of a hamiltonian path. Bollobás posed the problem of finding the least number of edges,f(n), possible in a maximally nonhamiltonian graph of ordern. Results of Bondy show thatf(n) 3/2 n forn 7. We exhibit graphs of even ordern 36 for which the bound is attained. These graphs are the snarks,J _k, of Isaacs and mild variations of them. For oddn 55 we construct graphs from the graphsJ _k showing that in this case,f(n) = 3n + 1/2 or 3n + 3/2 and leave the determination of which is correct as an open problem. Finally we note that the graphsJ _k, k 7 are hypohamiltonian cubics with girth 6.     

A Remark on Bernstein,Prokhorov, Bennett,Hoeffding, and Talagrand Inequalities

Let X ₁,..., X_n be independent random variables such that {X_j 1}=1 and E X _j=0 for all j. We prove an upper bound for the tail probabilities of the sum M _n=X₁+...+ X_n. Namely, we prove the inequality {M _nx} 3.7 {S_n x}, where S _n=₁+...+ _n is a sum of centered independent identically distributed Bernoulli random variables such that E S _n ² =ME M _n ² and {_k=1}=E S _n ² /(n+E S _n ² ) for all k (we call a random variable Bernoulli if it assumes at most two values). The inequality holds for x at which the survival function x{S _nx} has a jump down. For remaining x, the inequality still holds provided that we interpolate the function between the adjacent jump points linearly or log-linearly. If necessary, in order to estimate {S _nx} one can use special bounds for binomial probabilities. Up to the factor at most 2.375, the inequality is final. The inequality improves the classical Bernstein, Prokhorov, Bennett, Hoeffding, Talagrand, and other bounds.     

Striktionseigenschaften von Regelscharen imE n

Let ={e(u)|uI} be a one-parameter family of straight lines forming a ruledC ^r-2-surface E ⁿ (n2,r1) without singular generatorse(u) (uI). As a synopsis, a generalization and an improvement of various results already known about the strictional properties of ruled surfaces E ⁿ (especially in the casen=3) the author demonstrates a uniform geometrical way of defining and uniquely obtaining thestriction point S(u) and theparameter of distribution d(u) of a generatore(u) under the minimal assumptions thate(u)E ⁿ (n2) be noncylindrical andr1. Other methods of obtainingS(u) andd(u) are discussed in comparison, and special strictional properties ofskew ruled surfaces E ⁿ are proved.

---

---

Herrn Prof. Dr. H. R. Müller zum 65. Geburtstag     

The number of different distances determined by a set of points in the Euclidean plane

In 1946 P. Erdös posed the problem of determining the minimum numberd(n) of different distances determined by a set ofn points in the Euclidean plane. Erdös provedd(n) cn ^1/2 and conjectured thatd(n)cn/ logn. If true, this inequality is best possible as is shown by the lattice points in the plane. We showd(n)n ^4/5/(logn) ^c .The research of W. T. Trotter was supported in part by the National Science Foundation under DMS 8713994 and DMS 89-02481.     

Iterated means of convex bodies

LetK be a convex body inR ⁿ with polarK . Let _p refer to Fireyp orp-dot means. If 0<<1,p1, andK _i+1 =K _{i p} (1–)K _i , fori1, then K _i is the unit ball inR ⁿ.     

Über die Häufigkeit großer Differenzen konsekutiver Primzahlen

The following theorem is going to be proved. Letp _m be them-th prime and putd _m :=p _m+1–p _m . LetN(,T), 1/21,T3. denote the number of zeros =+i of the Riemann zeta function which fulfill and ||T. Letc2 andh0 be constants such thatN(,T)T ^c(1–) (logT) ^h holds true uniformly in 1/21. Let >0 be given. Then there is some constantK>0 such that      

Drachennetze mit geradlinigen Hauptdiagonalen

A C^s-net of curves N (s1) [3] in a regular C^s-2-surface Eⁿ (n2) is called a C^s-kite- net [4] if N and the net N₁ of its angular bisecting curves form a pair of diagonal nets [1] in such a way that each mesh of N-curves possessing two N₁-diagonals shows, with respect to one of these (calledmain diagonal), the same symmetry of angles and lengths as a rectilinear kite in E². Referring to the fact that the main diagonals of any C^s-kite-net N (s2) are geodesics in [5], we ask in this paper for all C^s-kite-nets and, more generally, C^s-D-nets [5] (s1) withstraight main diagonals. This leads, among other results, to a characterization of the skew ruled surfaces in Eⁿ (n3) with constant parameter of distribution and the constant striction /2.

---

---

Herrn Professor Dr. WERNER BURAU zum 70. Geburtstag gewidmet     

A parametric linear complementarity problem involving derivatives

The problem considered in this paper is given by the conditions:w = q + tp + Mz, w 0, 0,w ^T = 0, where a dot denotes the derivative with respect to the scalar parametert 0. In this problem,q, p aren-vectors withq 0 andM is an byn P-matrix. This problem arises in a certain basic problem in the field of structural mechanics. The main result in this paper is the existence and uniqueness theorem of a solution to this problem. The existence proof is constructive providing a computational method of obtaining the solution asymptotically.This research is in part supported by the National Science Foundation under Grant No. ENG77-11136.     

A New Law of the Iterated Logarithm in Rd with Application to Matrix-Normalized Sums of Random Vectors

Let (X _n , n1) be a sequence of independent centered random vectors in R ^d . We study the law of the iterated logarithm lim sup _n(2 log log B _n )^–1/2 B ^–1/2 _n S _n =1 a.s., where B _n is the covariance matrix of S _n = ⁿ _i=1 X _i , n1. Application to matrix-normalized sums of independent random vectors is given.     

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.