Doubly β-Derived Translation Planes

Existence and uniqueness of a doubly -derived translation plane of order 49 are proved. Furthermore, we give a complete classification of those translation planes of order 49 which can be obtained from the desarguesian plane of order 49 by a mixed double derivation, namely by applying a -derivation on and a classical derivation (also called Ostrom's derivation or -derivation) on .     

Cone Adaptation Strategies for a Finite and Exact Cutting Plane Algorithm for Concave Minimization

In this paper we are concerned with pure cutting plane algorithms for concave minimization. One of the most common types of cutting planes for performing the cutting operation in such algorithm is the concavity cut. However, it is still unknown whether the finite convergence of a cutting plane algorithm can be enforced by the concavity cut itself or not. Furthermore, computational experiments have shown that concavity cuts tend to become shallower with increasing iteration. To overcome these problems we recently proposed a procedure, called cone adaptation, which deepens concavity cuts in such a way that the resulting cuts have at least a certain depth with 0, where is independent of the respective iteration, which enforces the finite convergence of the cutting plane algorithm. However, a crucial element of our proof that these cuts have a depth of at least was that we had to confine ourselves to -global optimal solutions, where is a prescribed strictly positive constant. In this paper we examine possible ways to ensure the finite convergence of a pure cutting plane algorithm for the case where = 0.     

Maximal inequalities,convexity inequality,and their duality. II

, , . . . [1], , . , , ., , L logL. , , . . . . [5]. , .     

О предельном распределении для сумм независимых слууайных велиуин на бикомпактных коммутативных топологиуеских группах

,      

On equivalence of rearrangements of the Haar system in dyadic Hardy and BMO spaces

H={h ₁,I } — , . : , I ¦(I)¦=¦I¦, ¦I¦ — I. H H ={h _(I),I} . , , . L ^p .

---

---

Dedicated to Professor B. Szökefalvi-Nagy on his 75th birthday

---

This research was supported in part by MTA-NSF Grants INT-8400708 and 8620153.     

Squaring the Triangle

We construct flat Laguerre planes by integrating flat projective planes. The construction is based in an essential way on results from the theory of interpolation. In conjunction with the unifying theory of topological circle planes and generalized quadrangles, the new construction appears to be one of the most natural and powerful constructions of such geometries.     

Logarithms and imaginary powers of closed linear operators

The imaginary powersA ^it of a closed linear operatorA, with inverse, in a Banach spaceX are considered as aC ₀-group {exp(itlogA);t R} of bounded linear operators onX, with generatori logA. Here logA is defined as the closure of log(1+A) – log(1+A ^–1). LetA be a linearm-sectorial operator of typeS(tan ), 0(/2), in a Hilbert spaceX. That is, |Im(Au, u)| (tan )Re(Au, u) foru D(A). Then ±ilog(1+A) ism-accretive inX andilog(1+A) is the generator of aC ₀-group {(1+A) ^it ;t R} of bounded imaginary powers, satisfying the estimate (1+A) ^it exp(|t|),t R. In particular, ifA is invertible, then ±ilogA ism-accretive inX, where logA is exactly given by logA=log(1+A)–log(1+A ^–1), and {A ^it;t R} forms aC ₀-group onX, with the estimate A ^it exp(|t|),t R. This yields a slight improvement of the Heinz-Kato inequality.     

On the optimality of a characterization theorem for the gamma function using the multiplication formula

Summary The following Artin type characterization of : _{+ +} is proved: Assume thatf: _{+ +} satisfies the Gauss multiplication formula for some fixedp 2,f is absolutely continuous on [l/p, 1 + ] for some > 0 and lim _{x 0} xf(x) = 1. Thenf(x) = (x) forx > 0.The optimality of this result is checked by means of counterexamples. For instance, it is shown that the result is no longer true, if f is absolutely continuous is replaced by f is continuous and of finite variation.     

Multi-Faithful Spanning Trees of Infinite Graphs

For an end and a tree T of a graph G we denote respectively by m() and m _T () the maximum numbers of pairwise disjoint rays of G and T belonging to , and we define tm() := min{m _T(): T is a spanning tree of G}. In this paper we give partial answers — affirmative and negative ones — to the general problem of determining if, for a function f mapping every end of G to a cardinal f() such that tm() f() m(), there exists a spanning tree T of G such that m _T () = f() for every end of G.     

Some extremal results on circles containing points

We define (n) to be the largest number such that for every setP ofn points in the plane, there exist two pointsx, y P, where every circle containingx andy contains (n) points ofP. We establish lower and upper bounds for (n) and show that [n/27]+2(n)[n/4]+1. We define for the special case where then points are restricted to be the vertices of a convex polygon. We show that .     

A sharp bound for the number of points where a rank 3 stable reflexive sheaf is not free

Let ³ be the projective space over an algebraically closed field k and let E be a rank 3 stable reflexive sheaf on ³ such that its restriction to a general plane is stable. The aim of this paper is to give a sharp bound of s= lengthExt ¹ (E,G)in terms of the Chern classes of E.     

On Sets of Planes in Projective Spaces Intersecting Mutually in One Point

Let be a projective space. In this paper we consider sets of planes of such that any two planes of intersect in exactly one point. Our investigation will lead to a classification of these sets in most cases. There are the following two main results:- If is a set of planes of a projective space intersecting mutually in one point, then the set of intersection points spans a subspace of dimension 6. There are up to isomorphism only three sets where this dimension is 6. These sets are related to the Fano plane.- If is a set of planes of PG(d,q) intersecting mutually in one point, and if q3, 3(q²+q+1), then is either contained in a Klein quadric in PG(5,q), or is a dual partial spread in PG(4,q), or all elements of pass through a common point.     

A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities

Consider a nonempty convex set in ^m which is defined by a finite number of smooth convex inequalities and which admits a self-concordant logarithmic barrier. We study the analytic center based column generation algorithm for the problem of finding a feasible point in this set. At each iteration the algorithm computes an approximate analytic center of the set defined by the inequalities generated in the previous iterations. If this approximate analytic center is a solution, then the algorithm terminates; otherwise either an existing inequality is shifted or a new inequality is added into the system. As the number of iterations increases, the set defined by the generated inequalities shrinks and the algorithm eventually finds a solution of the problem. The algorithm can be thought of as an extension of the classical cutting plane method. The difference is that we use analytic centers and convex cuts instead of arbitrary infeasible points and linear cuts. In contrast to the cutting plane method, the algorithm has a polynomial worst case complexity of O(Nlog 1/) on the total number of cuts to be used, where N is the number of convex inequalities in the original problem and is the maximum common slack of the original inequality system.     

Characterization of regular singular linear systems of difference equations

This paper deals with linear systems of difference equations whose coefficients admit generalized factorial series representations atz=. We are concerned with the behavior of solutions near the pointz= (the only fixed singularity for difference equations). It is important to know whether a system of linear difference equations has a regular singularity or an irregular singularity. To a given system () we can assign a number , called the Moser's invariant of (), so that the system is regular singular if and only if 1. We shall develop an algorithm, implementable in a computer algebra system, which reduces in a finite number of steps the system of difference equations to an irreducible form. The computation ot the number can be done explicitly from this irreducible form.     

Constraint decomposition algorithms in global optimization

Many global optimization problems can be formulated in the form min{c(x, y): x X, y Y, (x, y) Z, y G} where X, Y are polytopes in ^p , ⁿ , respectively, Z is a closed convex set in ^p+n, while G is the complement of an open convex set in ⁿ . The function c: ^p+n is assumed to be linear. Using the fact that the nonconvex constraints depend only upon they-variables, we modify and combine basic global optimization techniques such that some new decomposition methods result which involve global optimization procedures only in ⁿ . Computational experiments show that the resulting algorithms work well for problems with smalln.     

Twisted derivations and distinct sets of lines that cover the same pairs of points

A partial projective plane of ordern consists of lines andn ² +n + 1 points such that every line hasn+1 points and distinct lines meet in a unique point. Suppose that two essentially different partial projective planes and of ordern, n a perfect square, that are defined on the same set of points cover the same pairs of points. For sufficiently largen we show that this implies that and have at leastn(n+1) lines. This bound is sharp and there exist essentially two different types of examples meeting the bound.As an application, we can show that derived planes provide an example for a pair of projective planes of square order with as much structure as possible in common, that is, as many lines as possible in common. Furthermore, we present a new method (twisted derivations) to obtain planes from one another by replacing the same number of lines as in a derivation.     

On the asymptotic equivalence ofL pmetrics for convergence to normality

Summary This paper is concerned with the rate of convergence to zero of theL _pmetrics _np1p, constructed out of differences between distribution functions, for departure from normality for normed sums of independent and identically distributed random variables with zero mean and unit variance. It is shown that the _np are, under broad conditions, asymptotically equivalent in the strong sense that, for 1p, p, _np/_np is universally bounded away from zero and infinity asn.     

Circularity of Finite Groups without Fixed Points

Let be a fixed point free group given by the presentation where and are relative prime numbers, t = /s and s = gcd( – 1,), and is the order of modulo . We prove that if (1) = 2, and (2) is embeddable into the multiplicative group of some skew field, then is circular. This means that there is some additive group N on which acts fixed point freely, and |((a)+b)((c)+d)| 2 whenever a,b,c,d N, a0c, are such that (a)+b(c)+d.     

Extremal problems of Bloch function spaces

Letf be analytic in a hyperbolic region . The Bloch constant _f off is defined by , where (z)|dz| is the Poincaré metric in . Suppose is hyperbolic and where . Then for allf withf() , we have _f 1/(). In this paper we study the extremal functions defined by _f =1/() and the existence of those functions.Supported by the National Natural Science Foundation of China.     

Estimates for lebesgue constants in dimension two

Summary Let D denote the interior of a piecewise regular curve of R² having a point with Gauss curvature different from zero. We show that the Lebesgue constants L ^D relative to D behave like ^1/2 as .