Two classes of conformally flat contact metric 3-manifolds

We give a classification of 3—dimensional conformally flat contact metric manifolds satisfying: =0(=L g) orR(Y, Z)=k[(Z)Y–(Y)Z]+[(Z)hY]–(Y)hZ] wherek and are functions. It is proved that they are flat (the non-Sasakian case) or of constant curvature 1 (the Sasakian case).     

Partially ordered permutation groups

In this note we discuss permutation groups (G, ) in which the set admits aG-invariant order. By aG-invariant partial order (G-partial order) we mean a partial order < of such that < implies g<g, for all and in andg inG. If the set admits aG-partial order which is a total order, then (G, ) is an O-permutation group (orderable permutation group).The main concern of this paper is the development of a foundation for partially ordered permutation groups analogous to the existing one for partially ordered groups, as found in Fuchs [2].     

The length,the width and the cutset-number of finite ordered sets

The partially ordered set P is an (, , ) ordered set if the width of P, the length of any chain of P and the cut-set number . We will prove that if P is an (, , ) ordered set then P contains a simple (, , ) ordered set and use this result to prove that if P has the 3 cutset property, then width of P length of P+3.     

The core of a chain complete poset with no one-way infinite fence and no tower

Like dismantling for finite posets, a perfect sequence = P : of a chain complete posetP represents a canonical procedure to produce a coreP . It has been proved that if the posetP contains no infinite antichain then this coreP is a retract ofP andP has the fixed point property iffP has this property. In this paper the condition of having no infinite antichain is replaced by a weaker one. We show that the same conclusion holds under the assumption thatP does not contain a one-way infinite fence or a tower.Supported by a grant from The National Natural Science Foundation of China.     

Semimodular lattices with isomorphic graphs

Two discrete modular lattice and have isomorphic graphs if and only if is of the form A × and is of the form A × for some lattices A and and . We prove that for discrete semimodular lattices and this latter condition holds if and only if and have isomorphic graphs and the isomorphism preserves the order on all cover-preserving sublattices of which are isomorphic to the seven-element, semimodular, nonmodular lattice (see Figure 1). This answers in the affirmative a question posed by J. Jakubik.     

Nonparametric Inference for a Class of Stochastic Partial Differential Equations II

Consider the stochastic partial differential equationdu (t,x) = (t)u (t, x)dt + dW _Q(t,x), 0 t T where = ₂/x ₂, and is a class of positive valued functions. We obtain an estimator for the linear multiplier (t) and establish the consistency, rate of convergence and asymptotic normality of this estimator as 0.     

On the eigenvalues of the matrix pencilA+μB

Summary The number of independent invariants ofn×n matricesA, B and their products on which the eigenvalues () of the matrix pencilA+B depend is determined by means of the theory of algebraic invariants and combinatorial analysis. Formulas are displayed for coefficients for the calculation of () forn5.

---

Zusammenfassung Wir bestimmen die Anzahl der unabhängigen Invarianten dern×n MatrizenA, B und ihrer Produkte, von denen die Eigenwerte () der MatrixbüschelA+B abhängen, mittels der Theorie der algebraischen Invarianten und mittels kombinatorischer Analyse. Formeln für Koeffizienten zur Berechnung von () werden angegeben fürn5.

     

Positivity and Negativity of Solutions to a Schrödinger Equation in ℝ N

Weak L ² -solutions u of the Schrödinger equation, –u + q(x) u – u = f(x) in L ² , are represented by a Fourier series using spherical harmonics in order to prove the following strong maximum and anti-maximum principles in (N 2): Let ₁ denote the positive eigenfunction associated with the principal eigenvalue ₁ of the Schrödinger operator . Assume that the potential q(x) is radially symmetric and grows fast enough near infinity, and f is a `sufficiently smooth' perturbation of a radially symmetric function, f 0 and 0 f / C const a.e. in . Then u is ₁-positive for - < < ₁ (i.e., u c ₁ with c const > 0) and ₁-negative for ₁ < < ₁ + (i.e., u –c₁ with c const > 0), where > 0 is a number depending on f. The constant c > 0 depends on both and f.     

Local Recognition Of Non-Incident Point-Hyperplane Graphs

Let be a projective space. By H() we denote the graph whose vertices are the non-incident point-hyperplane pairs of , two vertices (p,H) and (q,I) being adjacent if and only if p I and q H. In this paper we give a characterization of the graph H() (as well as of some related graphs) by its local structure. We apply this result by two characterizations of groups G with PSL _n ( )GPGL _n ( ), by properties of centralizers of some (generalized) reflections. Here is the (skew) field of coordinates of .     

On the linear isoperimetric inequality

This paper contains a sharp version of the well-known linear isoperimetric inequality for minimal surfacesX area(X)1/2oscillation(X)length(X).Supported by Sonderforschungsbereich 72 der Deutschen Forschungsgemeinschaft at Bonn University.     

Finite cutsets and finite antichains

An ordered set (P,) has the m cutset property if for each x there is a set Fx with cardinality less than m, such that each element of Fx is incomparable to x and {x} Fx meets every maximal chain of (P,). Let n be least, such that each element x of any P having the m cutset property belongs to some maximal antichain of cardinality less than n. We specify n for m < w. Indeed, n-1=m= width P for m=1,2,n=5 if m=3 and n₁ if m 4. With the added hypothesis that every bounded chain has a supremum and infimum in P, it is shown that for 4m₀, n=₀. That is, if each element x has a finite cutset Fx, each element belongs to a finite maximal antichain.This work was supported by the NSERC of Canada.     

Packing random items of three colors

Consider three colors 1,2,3, and forj3, considern items (X _i,j)in of colorj. We want to pack these items inn bins of equal capacity (the bin size is not fixed, and is to be determined once all the objects are known), subject to the condition that each bin must contain exactly one item of each color, and that the total item sizes attributed to any given bin does not exceed the bin capacity. Consider the stochastic model where the random variables (X _i,jj)in,j3 are independent uniformly distributed over [0,1]. We show that there is a polynomial-time algorithm that produces a packing which has a wasted spaceK logn with overwhelming probability.Work partially supported by an N.S.F. grant.     

On trees and tree dimension of ordered sets

We call an ordered set (X, ) a tree if no pair of incomparable elements ofX has an upper bound. It is shown that there is a natural way to associate a tree (T, ) with any ordered set (X, ), and (T, ) can be characterized by a universal property. We define the tree dimensiontd(X, ) of an ordered set as the minimal number of extensions of (X, ) which are trees such that the given order is the intersection of those tree orders. We give characterizations of the tree dimension, relations between dimension and tree dimension, and removal theorems.     

Finite digraphs with given regular automorphism groups

With five exceptions, every finite regular permutation group occurs as the automorphism group of a digraph.One of the corollaries: given a finite groupG of ordern, there is a commutative semigroupS of order 2n+2 such that AutSG. The problem whether a latticeL of order Cn with AutLG exists (for some constantC), remains open.     

Intégalités isopérimétriques pour les graphes

In this article we prove the equivalence between the strong isoperimetric inequality #A #A, for any subset A of countable graph cG, and the inequality for any function with finite variation on cG and null at infinity, with optimal constant. More generally, we prove the equivalence between the isoperimetric inequality # A cP ^-1(1/# A) # A and the inequality || ||_cM | |_var, where cM is a Young function and cP its conjugate, and we also obtain an isoperimetric inequality in as an application.     

Aufeinanderfolgende Elemente in multiplikativen Zahlenmengen

LetM be a multiplicative set with 1M andmnM if and only ifmM,nM for (m,n)=1. It is shown by elementary means that there exists the asymptotic density of the setM(M–1) for every multiplicative setM. The density is positive if and only ifM possesses a positive density and 2M for some . This result is slightly generalized to sums over multiplicative functionsf with |f|1.     

Some functionals over a compact Minkovskii space

In this paper we obtain estimates which are order-exact for the projection and Macphail constants of an arbitrary n-dimensional Banach space: 1(X)n, 1/n₁(X)1/n.Translated from Matematicheskii Zametki, Vol. 10, No. 4, pp. 453–457, 1971.     

A horn sentence for involution lattices of quasiorders

The quasiorders of a setA form a lattice Quord(A) with an involution ^–1={x, y: y, x}. Some results in [1] and Chajda and Pinus [2] lead to the problem whether every lattice with involution can be embedded in Quord(A) for some setA. Using the author's approach to the word problem of lattices (cf. [3]), which also applies for involution lattices, it is shown that the answer is negative.Research supported by the Hungarian National Foundation for Scientific Research (OTKA), under grant no. T 7442.     

Eigenvalues for generalized Hausdorff matrices

We introduce a new class of generalized Hausdorff matrices and show that their eigenvalues and corresponding eigenspaces can be obtained very easily. We also consider these matrices as operators on ^p (1p).     

The normal subgroup lattice of 2-transitive automorphism groups of linearly ordered sets

Using combinatorial and model-theoretic means, we examine the structure of normal subgroup lattices N(A()) of 2-transitive automorphism groups A() of infinite linearly ordered sets (, ). Certain natural sublattices of N(A()) are shown to be Stone algebras, and several first order properties of their dense and dually dense elements are characterized within the Dedekind-completion of (, ). As a consequence, A() has either precisely 5 or at least 2²¹ (even maximal) normal subgroups, and various other group- and lattice-theoretic results follow.