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.     

Representations of distributive lattice-ordered semigroups with binary relations

LetR(, , ¦) denote the class of all algebras isomorphic to ones whose elements are binary relations and whose operations are union, intersection, and relation composition (or relative product) of relations. We prove thatR(, , ¦) is not a variety and is not finitely axiomatizable. LetDLOS denote the class of all structures (A, , , ) where (A, , ) is a distributive lattice, (A, ) is a semigroup and is additive w.r.t. . We prove thatDLOS is the variety generated byR(, , ¦), and moreover, if (A, , , ) DLOS then it is representable whenever we disregard one of its operations.Presented by Boris M. Schein.Research supported by Hungarian National Foundation for Scientific Research grant No. 1810.     

Lévy–Khintchine Formula and Dual Convolution Semigroups Associated with Laguerre and Bessel Functions

In this work we consider a system of partial differential operators D ₁,D ₂ on K=[0,+[×R, whose eigenfunctions are the functions (x,t), (x,t)K, =((R0)×N)(0×[0,+[), which are related to the Laguerre functions for ((R 0)×N)(0,0) and which are the Bessel functions for (0×[0,+[). We provide K and with a convolution structure. We prove a Lévy–Khintchine formula on K, which permits us to characterize dual convolution semigroups on .     

Scattered spaces not having scattered compactifications

Some examples of scattered spaces not having scattered compactifications are given, which solves a problem of Semadeni. Thus, let S be any extremally disconnected dense-in-itself subspace of N/N. Then for every point S the subspacen {} does not have any scattered compactification.Translated from Matematicheskie Zametki, Vol. 23, No. 1, pp. 127–136, January, 1978.     

An m-convexity property for complementary pairs in the plane

Let A and B be closed nonempty sets in the plane with A B=R², A B=bdry A=bdry B=C. Assume that for every m 2 points in C, at least one of the corresponding segments is in A, at least one in B. Then each of A and B is locally expressible as a union of m–1 or fewer convex sets.     

New lower semicontinuity results for polyconvex integrals

Summary We study integral functionals of the formF(u, )= f(u)dx, defined foru C¹(;R ^k), R ⁿ . The functionf is assumed to be polyconvex and to satisfy the inequalityf(A) c₀¦(A)¦ for a suitable constant c₀ > 0, where (A) is then-vector whose components are the determinants of all minors of thek×n matrixA. We prove thatF is lower semicontinuous onC ¹(;R ^k) with respect to the strong topology ofL ¹(;R ^k). Then we consider the relaxed functional , defined as the greatest lower semicontinuous functional onL ¹(;R ^k ) which is less than or equal toF on C¹(;R ^k). For everyu BV(;R ^k) we prove that (u,) f(u)dx+c₀¦D^su¦(), whereDu=u dx+D^su is the Lebesgue decomposition of the Radon measureDu. Moreover, under suitable growth conditions onf, we show that (u,)= f(u)dx for everyu W^1,p(;R ^k), withp min{n,k}. We prove also that the functional (u, ) can not be represented by an inte- gral for an arbitrary functionu BV_loc(R ⁿ;R ^k). In fact, two examples show that, in general, the set function (u, ) is not subadditive whenu BV_loc(R ⁿ;R ^k), even ifu W _loc ^1,p (R ⁿ;R ^k) for everyp < min{n,k}. Finally, we examine in detail the properties of the functionsu BV(;R ^k) such that (u, )= f(u)dx, particularly in the model casef(A)=¦(A)¦.     

Thermodynamics and Hydrodynamics (Statistical Foundations): 3. Hydrodynamic Equations

We show that all the hydrodynamic equations can be obtained from the BBGKY hierarchy. The theory is constructed by expanding the distribution functions in series in a small parameter = R/L 10^–8, where R 10^–7cm is the radius of the correlation sphere and L is the characteristic macroscopic dimension. We also show that in the zeroth-order approximation with respect to this parameter, the BBGKY hierarchy implies the local equilibrium and the transport equations for the ideal Euler fluid; in the first-order approximation with respect to , the BBGKY hierarchy implies the hydrodynamic equations for viscous fluids. Moreover, we prove that the intrinsic energy flux must include both the kinetic energy flux proportional to the temperature gradient and the potential energy flux proportional to the density gradient. We show that the hydrodynamic equations hold for t 10^–12s and L R 10^–7cm.     

Die Verbände mit nichteinfacher Funktionenalgebra

Let V; , be a lattice, thenF(V), the set of all functions fromV toV, becomes a lattice by defining the operations and pointwise. If we also consider the composition of functions as an operation onF(V), we get the function algebra F(V); , ,·. In this paper we give a characterization of the lattices with nonsimple function algebras. Moreover, the congruence lattice of these function algebras turns out to be a three-element chain.     

Further results on the covering radii of the Reed-Muller codes

LetR(r, m) by therth order Reed-Muller code of length2 ^m , and let (r, m) be its covering radius. We obtain the following new results on the covering radius ofR(r, m): 1. (r+1,m+2) 2(r, m)+2 if 0rm–2. This improves the successive use of the known inequalities (r+1,m+2)2(r+1,m+1) and (r+1,m+1) (r, m).2.(2, 7)44. Previously best known upper bound for (2, 7) was 46. 3. The covering radius ofR(1,m) inR(m–1,m) is the same as the covering radius ofR(1,m) inR(m–2,m) form4.     

Boolean Term Orders and the Root System Bn

A Boolean term order is a total order on subsets of [n] ={1,..., n} such that for all [n], , and for all with ( ) = . Boolean term orders arise in several different areas of mathematics, including Gröbner basis theory for the exterior algebra, and comparative probability.The main result of this paper is that Boolean term orders correspond to one-element extensions of the oriented matroid M(B_n), where B_n is the root system {e_i : 1 i n} {e_i ± e_j : 1 i < j n}. This establishes Boolean term orders in the framework of the Baues problem, in the sense of (Reiner, 1998). We also define a notion of coherence for a Boolean term order, and a flip relation between different term orders. Other results include examples of noncoherent term orders, including an example exhibiting flip deficiency, and enumeration of Boolean term orders for small values of n.     

Minimization of the Conformal Radius under Circular Cutting of a Domain

Let D be a simply connected domain on the complex plane such that 0 D. For r > 0 , let D _r be the connected component of D {z : |z| < r} containing the origin. For fixed r, we solve the problem on minimization of the conformal radius R(D _r, 0) among all domains D with given conformal radius R(D, 0). This also leads to the solution of the problem on maximization of the logarithmic capacity of the local -extension E (a) of E among all continua E with given logarithmic capacity. Here, E (a) = E {z : |z – a| }, a E, > 0. Bibliography: 12 titles.     

Joint convergence of conditional expectations

Let P_n, nIN{0}, be probability measures on a-fieldA; f_n, nIN{0}, be a family of uniformly boundedA-measurable functions andA _n, nIN, be a sequence of sub--fields ofA, increasing or decreasing to the-fieldA _o. It is shown in this paper that the conditional expectations converge in P_o-measure to with k, n, m , if P_n|A, nIN, converges uniformly to P_n|A and f_n, nIN, converges in P_o-measure to f_o.     

The degree of maps between certain 6-manifolds

For manifolds M,M of the form S² e⁴ e⁶ we compute the homomorphisms H_*M H_*M between homology groups which are realizable by a map F: M M.     

Powers of matrices over an extremal algebra with applications to periodic graphs

Consider the extremal algebra=({},min,+), using + and min instead of addition and multiplication. This extremal algebra has been successfully applied to a lot of scheduling problems. In this paper the behavior of the powers of a matrix over is studied. The main result is a representation of the complete sequence (A ^m ) _m which can be computed within polynomial time complexity. In the second part we apply this result to compute a minimum cost path in a 1-dimensional periodic graph.     

Asymptotic stability at infinity of planar vector fields

Let >0 andX be aC ¹ vector field on the plane such that: (i) for allq², Det(DX(q))>0; and (ii) for allp², with p, Trace(D(X(p))<0. IfX has a singularity and ² Trace(DX)dxdy is less than 0 (resp. greater or equal than 0), then the point at infinity of the Riemann sphere ²{} is a repellor (resp. an attractor) ofX.     

k-regular factors and semi-k-regular factors in bipartite graphs

LetG be a graph, andk1 an integer. LetU be a subset ofV(G), and letF be a spanning subgraph ofG such that deg _F (x)=k for allx V(G)–U. If deg _F (x)k for allxU, thenF is called an upper semi-k-regular factor with defect setU, and if deg _F (x)k for allxU, thenF is called a lower semi-k-regular factor with defect setU. Now letG=(X, Y;E(G)) be a bipartite graph with bipartition (X,Y) such that X=Yk+2. We prove the following two results.(1) Suppose that for each subsetU ₁X such that U ₁=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=max{k+1, X+1/2},G has an upper semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.(2) Suppose that for each subsetU ₁X such that U ₁=X–1/k+1,G has a lower semi-k-regular factor with defect setU ₁Y, and for each subsetU ₂Y such that U ₂=X–1/k+1,G has a lower semi-k-regular factor with defect setXU ₂. ThenG has ak-factor.     

A Hubert space characterization among function spaces

— [0,1] ,E — - e=1 [0,1]. I — _E =1, E=L ₂ x _e =xL ₂ x E.

---

---

This work was prepared when the second author was a visiting professor of the CNR at the University of Firenze. He was supported by the Soros International Fund.     

The Ramsey property for collections of sequences not containing all arithmetic progressions

A family of sequences has the Ramsey property if for every positive integerk, there exists a least positive integerf (k) such that for every 2-coloring of {1,2, ...,f (k)} there is a monochromatick-term member of . For fixed integersm > 1 and 0 q < m, let _q(m) be the collection of those increasing sequences of positive integers {x ₁,..., x_k} such thatx _i+1 – x_i q(modm) for 1 i k – 1. Fort a fixed positive integer, denote byA _t the collection of those arithmetic progressions having constant differencet. Landman and Long showed that for allm 2 and 1 q < m, _q(m) does not have the Ramsey property, while _q(m) A _m does. We extend these results to various finite unions of _q(m) 's andA _t 's. We show that for allm 2, _q=1 ^m–1 _q(m) does not have the Ramsey property. We give necessary and sufficient conditions for collections of the form _q(m) ( _{t T} A _t) to have the Ramsey property. We determine when collections of the form _a(m₁) _b(m₂) have the Ramsey property. We extend this to the study of arbitrary finite unions of _q(m)'s. In all cases considered for which has the Ramsey property, upper bounds are given forf .     

m-Systems and Partial m-Systemsof Polar Spaces

LetP be a finite classical polar space of rankr, withr 2. A partialm-systemM ofP, with 0 m r - 1, is any set (₁), ₂,..., _k ofk ( 0) totally singularm-spaces ofP such that no maximal totally singular space containing _i has a point in common with (_{1 2} ... _k) — _i,i = 1, 2,...,k. In a previous paper an upper bound for ¦M¦ was obtained (Theorem 1). If ¦M¦ = , thenM is called anm-system ofP. Form = 0 them-systems are the ovoids ofP; form =r - 1 them-systems are the spreads ofP. In this paper we improve in many cases the upper bound for the number of elements of a partialm-system, thus proving the nonexistence of several classes ofm-systems.Dedicated to Hanfried Lenz on the occasion of his 80th birthday