About generalized ideals in a distributive lattice

Let L be a distributive lattice characterized by a ternary operation (, ,), where (a,b,c)=(ab)(bc)(ac)=(ab)(ac)(bc), a,b,cL. The note considers convex sublattices of L, called generalized ideals of L generated by the operation (, ,). Some remarks have been stated about the graph of a distributive lattice.     

Beitrag zur Reduktion des Entscheidungsproblems auf Klassen von Hornformeln mit kurzen Alternationen

Ohne Zusammenfassung Zusatz bei der Korrektur: Ein vollständiger und korrekter Beweis für die Entscheidbarkeit der eingangs angeführten Aanderaaschen Klasse ((0, ), (, , ...)) erscheint demnächst im JSL (S.O. Aanderaa/H.R.Lewis: Prefix classes of Krom formulas). Ebendort wird auch die Reduktionstypeneigenschaft für ((0, ), (0, 0, )) und ((0, )), (0, 0, )) nachgewiesen, während ((0, ), (, )) sich als entscheidbar herausgestellt hat (s. E. Börger: Eine entscheidbare Klasse von Kromformeln. ZMLG 19 (1973), 117–120.) Der Kromsche Reduktionstyp konnte mittlerweile einerseits zu ((0, ), (0, 4)) verschärft werden (s. D. Rödding, E. Börger: The undecidability of (0, 4)-formulae with binary disjunctions, vorgetragen auf dem Logic Coll. Bristol 1973, ein abstract erscheint im JSL), andererseits kündigt H.R.Lewis die Reduktionstypeneigenschaft für ((0, ), (0, 1)) an (s. H.R.Lewis: Krom formulas with one dyadic predicate letter. Notices AMS 20, 5 (1973) A-500, abstr. no. 73T-E78.)Dieser Aufsatz geht aus der Dissertation [2] hervor, die dem Fachbereich Mathematik der Mathematisch-Naturwissenschaftlichen Fakultät der Universität Münster im Sommersemester 1971 vorgelegt worden ist. Die Ergebnisse stammen aus dem Wintersemester 1970/71. Eine Ankündigung der hauptsächlichen Resultate ist in den Notices of the American Mathematical Society 19, 2 (1972) A-333 unter der abstract no. * 72T-E24 erschienen.     

Relaxation of a Quadratic Functional Defined by a Nonnegative Unbounded Matrix

We study the lower semicontinuous envelope in L^p(), F, of a functional F of the form F(u)=A uudx where A=A(x) is not strictly elliptic and not bounded. We prove that F; may also be written as F;(u)= Buudx with B=AP A for a matrix P which is the matrix of an orthogonal projection. In the one-dimensional case, we characterize the domain of F and we explicit the matrix P.     

On an application of infinitely divisible distributions to quadrature problems

— - , .     

Limits of certain iterates of Post-Widder operators

The paper is a study of the limiting behaviour of the [n t]-th iterates of the well-known Post-Widder operatorsL _{n, x} used in the real inversion of the Laplace transform. It is shown that the limiting operators constitute a semigroup T _t;t0 of class (C ₀) on a family C _,; , >0 of Banach spaces. Applications of the semigroup structure lead to a pointwise saturation theorem forL _{n, x} and a characterization of convex functions inC _, through an inequality involving the action ofL _{n, x}.     

Nonnegative Hall Polynomials

The number of subgroups of type and cotype in a finite abelian p-group of type is a polynomialg with integral coefficients. We prove g has nonnegative coefficients for all partitions and if and only if no two parts of differ by more than one. Necessity follows from a few simple facts about Hall-Littlewood symmetric functions; sufficiency relies on properties of certain order-preserving surjections that associate to each subgroup a vector dominated componentwise by . The nonzero components of (H) are the parts of , the type of H; if no two parts of differ by more than one, the nonzero components of – (H) are the parts of , the cotype of H. In fact, we provide an order-theoretic characterization of those isomorphism types of finite abelian p-groups all of whose Hall polynomials have nonnegative coefficients.     

Orders of one-sided approximations of functions inL p -metric

. L _p , 0<p<, . , f, {E _n (f) _p } ₁ p>0 .

---

---

The author expresses his thanks to S. B. Stekin for the attention he has paid to this work.     

On the uniform (C, 1)-summability of Fourier series and integrability of series with respect to multiplicative orthonormal systems

H (G), f(g)H (G) , (, 1)- OHMC G. , OHMC, A. H. . , . , OHMC, lim supp _n=, , ,n .. . , 117 234 . . -      

Local isometric immersions of two-dimensional metrics inE 4 with prescribed Gaussian torsion

Suppose that in a domain R(, B) of variables (r, ): (0 r , ₁ +B(r–r ₀ ) ₂–B(r–r₀), where > 0, B > 0, ₁ < 0 < ₂ are numbers) a metric ds² = dr² +G(r, )d ² and a function k(r, ) are given. The problem of isometrically immersing ds² in E ⁴ with prescribed Gaussian torsion is considered. The following is proved: The class C ⁵ metric ds ² is locally realized in the form of a class C ³ surface F ² whose Gaussian torsion is the prescribed class C ³ function (r, ).Translated from Ukrainskii Geometricheskii Sbornik, No. 35, pp. 38–47, 1992.     

On the stability of the transport equation

We consider boundary value problems associated with the equation T=–A in a Hilbert Space, where T and A are bounded, self adjoint, injective, and A has a bounded inverse. We discuss the stability of the solution when A is perturbed by a self adjoint operator.     

Analysis of a class of fractional programming problems

We propose a solution strategy for fractional programming problems of the form max _xx g(x)/ (u(x)), where the function satisfies certain convexity conditions. It is shown that subject to these conditions optimal solutions to this problem can be obtained from the solution of the problem max _xx g(x) + u(x), where is an exogenous parameter. The proposed strategy combines fractional programming andc-programming techniques. A maximal mean-standard deviation ratio problem is solved to illustrate the strategy in action.     

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.     

Interpolation of generalized analytical functions of complex variable

A general approach is proposed to the interpolation of x -analytical functions of a complex variable with an arbitrary –,+[Basis x -analytical functions whose imaginary pan is a polynomial in x, and y are obtained in explicit form.Translated from Vychislitel'naya i Prikladnaya Matematika, No. 58, pp. 3–9, 1986.     

Compressible flow induced by the transient motion of a wavemaker

The effect of fluid compressibility on the evolution of the pressure distribution and free surface elevation, following the initiation of a horizontal motion of a vertical wavemaker, is analysed. This effect is significant even in a liquid (like water) when the time scale of the motion is very short (e.g. impulsive motions).In the leading order the present problem is analogous to that of supersonic flow about a thin wing, thus the solution is represented by means of an appropriate supersonic source distribution. Closed-form results are obtained for the case of impulsive motion (i.e. a step function velocity). The pressure field corresponds to systems of double rarefaction and double compression waves traversing the fluid domain intermittently. Following the passage of a rarefaction (compression) wave, the free surface becomes locally concave (convex). The resulting free surface profile consists of an elongating wavetrain in front of a jet riding up the vertical wall.On the compressible time-scale the pressure and velocity fields approach a steady long-time limit. This limit corresponds to the short-time incompressible flow prevailing after the attenuation of the pressure waves. The spatial nonuniformity of the asymptotic expansion in the neighbourhood of the waterline is briefly discussed.     

∑II∑ threshold formulas

A II formula has the form, where eachL is either a variable or a negated variable. In this paper we study the computation of threshold functions by II formulas. By combining the proof of the Fredman-Komlós bound [5, 10] and a counting argument, we show that fork andn large andkn/2, every II formula computing the threshold functionT _k ⁿ has size at least exp . Fork andn large andkn ^2/3, we show that there exist II formulas for computingT _k ⁿ with size at most exp .     

Kennzeichnungen von Minimalschraubflächen Mittels Vertikalisophoten und Horizontalschattengrenzen

In Euclidean space E³, let be a (regular C-) minimal surface without planar points having locally (without loss of generality) the spherical representation n(u,v)=(cos v/cosh u, sin v/cosh u, tanh u), (u,v)G². The corresponding (isothermal) parametrization : x(u,v), (u,v)G can be expressed using agenerating Function (u,v) which satisfies _{uu + vv} – 2_utanh u + =0; the v-curves (coordinate curves u=u₀) in , along each of which the angle between the normal n(u,v) of and the x₃-axis is constant, are thevertical- isophotes of , the u-curves (v=v₀) being their orthogonal trajectories (theorems 1, 2). Considering u-curves and/or v-curves of having additional geometric properties (curves of constant/steepest slope, curves of constant Gaussian curvature, asymptotic curves, lines of curvature or geodesies of ) we prove many newgeometric characterizations of theright helicoid, thecatenoid andScherk's second surface (theorems 3–7). All of these surfaces areminimal hélicoidal surfaces.     

Durch graduierte Lie-Algebren definierte Paar-Algebren

Pair algebras which have a non degenerate (left- and right-) invariant bilinear form and for which the inner derivation algebra is completely reducible are characterised by pairs (C,), where C is a n×n matrix satisfying certain conditions and is a sequence of n integers equal to 0 or 1. They occur as pair algebras of type (S(C,)_–1,S(C,)₁), xuy=[[x,u],y], where (S(C,)_r)_r is the gradation induced by . in the Kac-Moody algebraS(C). If C is an affin Cartan matrix (as in the case of Lie triple systems), there exists a finite dimensional simple Lie algebrag and a Aut (g), ord =m< such that the pair algebra is isomorphic to the pair algebra (g _–1,g ₁), xuy=[[x,u],y] (product ing), whereg _i. is the eigenspace of of eigenvalue ⁱ, a primitive m-th root of unity.     

A little theorem of the bigℳ in interior point algorithms

When we apply interior point algorithms to various problems including linear programs, convex quadratic programs, convex programs and complementarity problems, we often embed an original problem to be solved in an artificial problem having a known interior feasible solution from which we start the algorithm. The artificial problem involves a constant (or constants) which we need to choose large enough to ensure the equivalence between the artificial problem and the original problem. Theoretically, we can always assign a positive number of the order O(2 ^L ) to in linear cases, whereL denotes the input size of the problem. Practically, however, such a large number is impossible to implement on computers. If we choose too large, we may have numerical instability and/or computational inefficiency, while the artificial problem with not large enough will never lead to any solution of the original problem. To solve this difficulty, this paper presents a little theorem of the big, which will enable us to find whether is not large enough, and to update during the iterations of the algorithm even if we start with a smaller. Applications of the theorem are given to a polynomial-time potential reduction algorithm for positive semi-definite linear complementarity problems, and to an artificial self-dual linear program which has a close relation with the primal—dual interior point algorithm using Lustig's limiting feasible direction vector.     

On the limit superior of analytic sets

. , A ₀,A ₁,— - lim supA _j - H, . , - - . , , ; , , . - . - .     

The existence of some resolvable block designs with divisibility into groups

This paper proves the existence of resolvable block designs with divisibility into groups GD(v; k, m; ₁, ₂) without repeated blocks and with arbitrary parameters such that ₁ = k, (v–1)/(k–1) ₂ v^k–2 (and also ₁ k/2, (v–1)/(2(k–1)) ₂ v^k–2 in case k is even) k 4 andp=1 (mod k–1), k < p for each prime divisor p of number v. As a corollary, the existence of a resolvable BIB-design (v, k, ) without repeated blocks is deduced with X = k (and also with = k/2 in case of even k) k , where a is a natural number if k is a prime power and=1 if k is a composite number.Translated from Matematicheskie Zametki, Vol. 19, No. 4, pp. 623–634, April, 1976.