The Prym and Ganning Vector Bundles over the Teichmueller Space

We introduce and study the Prym vector bundle P of holomorphic Prym differentials and the Ganning cohomology bundle G over the Teichmueller space of compact Riemann surfaces of genus g2 and over the Torelli space of genus g2. We construct a basis of holomorphic Prym differentials on a variable compact Riemann surface which depends on the moduli of the compact Riemann surface and on the essential characters. From these bundles we compose an exact sequence of holomorphic vector bundles over the product of the Teichmueller space of genus g and a special domain in the complex manifold C ^2g/Z ^2g.     

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.     

The Higher K-Theory of Real Curves

If X is a smooth curve defined over the real numbers , we show that K _n (X) is the sum of a divisible group and a finite elementary Abelian 2-group when n 2. We determine the torsion subgroup of K _n (X), which is a finite sum of copies of and 2, only depending on the topological invariants of X() and X(), and show that (for n 2) these torsion subgroups are periodic of order 8.     

On the smoothness of the moduli space of mathematical instanton bundles

In this paper we prove that the moduli spaces MI _2n+1(k) of mathematical instanton bundles on ²ⁿ⁺¹ with quantum number k are singular for n 2 and k 3 ,giving a positive answer to a conjecture made by Ancona and Ottaviani in 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.

     

Edge Coloring of Embedded Graphs with Large Girth

Let G be a simple graph embedded in the surface of Euler characteristic ()0. Denote _e(G), and g the edge chromatic number, the maximum degree and the girth of the graph G, respectively. The paper shows that _e(G)= if 5 and g4, or 4 and g5, or 3 and g9. In addition, if ()>0, then _e(G)= if 3 and g8. Acknowledgments.The authors would like to thank Dr. C.Q. Zhang for carefully reading several versions of this paper during its preparation and for suggesting several stylistic changes that have improved the overall presentation.     

Rates of convergence for the stability of large order statistics

Forr1 and eachnr, letM _nr be therth largest ofX ₁,X ₂, ...,X _n , where {X _n ,n1} is an i.i.d. sequence. Necessary and sufficient conditions are presented for the convergence of for all >0 and some –1, where {a _n } is a real sequence. Furthermore, it is shown that this series converges for all >–1, allr1 and all >0 if it converges for some >–1, somer1 and all >0.     

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.     

A combinatorial property of points and ellipsoids

For eachd1 there is a constantc _d>0 such that any finite setXR ^d contains a subsetYX, |Y|[1/4d(d+3)]+1 having the following property: ifEY is an ellipsoid, then |E X|c _d |X|.On leave from the Mathematical Institute of the Hungarian Academy of Sciences, 1364 Budapest, P.O. Box 127, Hungary. Supported by a research fellowship from the Science and Engineering Research Council, U.K., and by Hungarian National Foundation for Scientific Research Grant No. 1812.     

Asymptotics of Dominated Gaussian Maxima

Let {X _n , n1} be a sequence of independent Gaussian random vectors in R ^d d2. In this paper an asymptotic evaluation of P{max₁in X _i a _n Z+b _n } with Z another Gaussian random vector is obtained for a _n, b _n R ^d two vectors obeying certain conditions.     

Complete stability of large order statistics

Fix an integerr1. For eachnr, letM _nr be the rth largest ofX ₁,...,X _n, where {X _n,n1} is a sequence of i.i.d. random variables. Necessary and sufficient conditions are given for the convergence of _n=r n P[|M _nr /a _n –1|<] for every >0, where {a _n} is a real sequence and –1. Moreover, it is shown that if this series converges for somer1 and some >–1, then it converges for everyr1 and every >–1.     

Approximation of the Distribution of the Supremum of a Centered Random Walk. Application to the Local Score

Let (X _n ) _{n 0} be a real random walk starting at 0, with centered increments bounded by a constant K. The main result of this study is: |P(S _n n x)–P( sup_{0 u 1} B _u x)| C(n,K) n/n, where x 0, ² is the variance of the increments, S _n is the supremum at time n of the random walk, (B _u ,u 0) is a standard linear Brownian motion and C(n,K) is an explicit constant. We also prove that in the previous inequality S _n can be replaced by the local score and sup₀ u 1 B _u by sup₀ u 1|B _u |.     

Weight functions on the Kneser graph and the solution of an intersection problem of Sali

LetX, Y be finite sets and suppose thatF is a collection of pairs of sets (F, G),FX,GY satisfying |FF|s, |GG|t and |FF|+|GG|s+t+1 for all (F, G),F, GF. Extending a result of Sali, we determine the maximum ofF.     

Some best possible bounds concerning the traces of finite sets II

LetX be ann-element set and be a family of its subsets. Consider the family _x = {F – {x} : F } for a givenx X. We write(m, n) (m – k, n – 1), when for all with || m, there exists an elementx ofX such that| _x| m – k. We show that (m, n) (m – 10,n – 1) for allm 5n and (m, n) (m – 13,n – 1) for allm 29n/5.     

Minima of decomposable forms of degree n in n variables for n ≥ 3

The following theorem is proved: if for all (X0)one has ¦ F(x) ¦ >0, where F(x) is a decomposable form of degree n of n variables, then, for n 3, F(x) is proportional to an integral form.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova Akademii Nauk SSSR, Vol. 183, pp. 142–154, 1990.     

Diagonale Netze aus Schmieg- und Krümmungslinien I

In this paper we develop the theory of nets of curves in a regular C^r-2-surface Eⁿ (r1, n2) using the concept C^s-net (of curves); the term diagonal nets of curves defined by W. BPLASCHKE [2] in E² is generalized accordingly. A regular C^r-surface E³ (r2) of negative GAUSSian curvature is called a (C^r-)D_SK-surface if its asymptotic lines (S-lines) and lines of curvature (K-lines) locally form a pair of diagonal nets. For the C³-D_SK-surfaces a criterion is given and distinct categories are determined, in particular all those C³-D_SK-surfaces in which the S- and K-lines can be arranged as (curvilinear) kites, respectively parallelograms and their diagonals.

---

---

Auszugsweise vorgetragen auf der Geometrietagung in Oberwolfach (1.10.l974).     

A note on characterizations of Abelian varieties by topological invariants

In this note, for any given n3 and 2mn (when m=n, we assume n divides 3 and n6), we construct examples of smooth projective varieties X of dimension n with p_g(X)=1, ₁(X)²ⁿ and the Kodaira dimension (X)=m.Mathematics Subject Classification (2000):14H45, 14H99     

On the diameters of certain classes of analytic functions. II

In the spaces E_q(), q1, we consider the classes W^rE_p(), p1, consisting of analytic functions f(z) E_P() the integral moduli of continuity of whose r-th derivatives are majorized by a given nonnegative nondecreasing function .Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 44, No. 8, pp. 1135–1138, August, 1992.     

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.     

A finite characterization ofK-matrices in dimensions less than four

The class of realn × n matricesM, known asK-matrices, for which the linear complementarity problemw – Mz = q, w 0, z 0, w ^T z =0 has a solution wheneverw – Mz =q, w 0, z 0 has a solution is characterized for dimensionsn <4. The characterization is finite and practical. Several necessary conditions, sufficient conditions, and counterexamples pertaining toK-matrices are also given. A finite characterization of completelyK-matrices (K-matrices all of whose principal submatrices are alsoK-matrices) is proved for dimensions <4.Partially supported by NSF Grant MCS-8207217.Research partially supported by NSF Grant No. ECS-8401081.