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.     

Formulas for best extrapolation

We considern-point Lagrange-Hermite extrapolation forf(x), x>1, based uponf(x _i ),i=1(1)n, –1x _i 1, including non-distinct pointsx _i in confluent formulas involving derivatives. The problem is to find the pointsx _i that minimize the factor in the remainderP _n (x)f ⁽ⁿ⁾()/n, –1<<x subject to the condition|P _n (x)|M, –1x1,2^–n+1M2 ⁿ . The solution is significant only when a single set of pointsx _i suffices for everyx>1. The problem is here completely solved forn=1(1)4. Forn>4 it may be conjectured that there is a single minimal , 0 rn, whererr(M) is a non-decreasing function ofM, P _n (–1)=(–1) ⁿ M, and for 0rn–2, thej-th extremumP _n (x _{e, j} )=(–1) ^n–j M,j=1(1)n–r–1 (except forM=M _r ,r=1(1)n–1, whenj=1(1)n–r).     

Wide posets with fixed height and cutset number

Given an element x of a partial order P, a set S P is said to be a cutset for x if S x meets every maximal chain of P and x is incomparable to every element of S. The cutset number of P is the minimum m such that every element of P has a cutset of size at most m. Let w(m, h) be the maximum width of a poset with height h and cutset number m. We determine the order of growth of w(m, h) for fixed m or fixed h: w(m, h)(h ^m/2) for fixed m and w(m, h)(m ^h) for fixed h.Research supported in part by ONR Grant N00014-85K0570 and by NSA/MSP Grant MDA904-90-H-4011.     

An Extension of the Pizzetti Formula for Polyharmonic Functions

We represent the integral over the unit ball B in R ⁿ of any poly-harmonic function u(x) of degree m as a linear combination with constant coefficients of the integrals of its Laplacians ^j u (j = 0,...,m - 1) over any fixed(n - 1)-dimensional hypersphere S() of radius (0 1). In case = 0 theformula reduces to the classical Pizzetti formula. In particular, the cubature formula derived here integrates exactly all algebraic polynomials of degree 2m - 1.     

On the Existence of <Emphasis Type="Italic">φ</Emphasis>-Moments of the Limit of a Normalized Supercritical Galton–Watson Process

Let (Z _n ) _{n 0} be a supercritical Galton–Watson process with finite re-production mean  and normalized limit W=lim _n ^–n Z _n . Let further : [0,) [0,) be a convex differentiable function with (0)=(0)=0 and such that ( ) is convex with concave derivative for some n 0. By using convex function inequalities due to Topchii and Vatutin, and Burkholder, Davis and Gundy, we prove that 0 < E (W) < if, and only if, , where

An iterative process for nonlinear lipschitzian and strongly accretive mappings in uniformly convex and uniformly smooth Banach spaces

SupposeX is ans-uniformly smooth Banach space (s > 1). LetT: X X be a Lipschitzian and strongly accretive map with constantk (0, 1) and Lipschitz constantL. DefineS: X X bySx=f–Tx+x. For arbitraryx ₀ X, the sequence {x_n} _n=1 is defined byx _n+1=(1– _n)x_n+ _nSy_n,y _n=(1– _n)x_n+ _nSx_n,n0, where {_n} _n=0 , {_n} _n=0 are two real sequences satisfying: (i) 0 _n ^p–1 2^–1s(k+k _n–L ²_n)(w+h)^–1 for eachn, (ii) 0 _n ^p–1 min{k/L², sk/(+h)} for eachn, (iii) _{n n}=, wherew=b(1+L)^s andb is the constant appearing in a characteristic inequality ofX, h=max{1, s(s-l)/2},p=min {2, s}. Then {x_n} _n=1 converges strongly to the unique solution ofTx=f. Moreover, ifp=2, _n=2^–1s(k +k–L²)(w+h)^–1, and _n= for eachn and some 0 min {k/L², sk/(w + h)}, then x_{n + 1}–q ^n/sx₁-q, whereq denotes the solution ofTx=f and=(1 – 4^–1s²(k +k – L ²)²(w + h)^–1 (0, 1). A related result deals with the iterative approximation of Lipschitz strongly pseudocontractive maps inX. SupposeX ism-uniformly convex Banach spaces (m > 1) andc is the constant appearing in a characteristic inequality ofX, two similar results are showed in the cases of L satisfying (1 – c²)(1 + L)^m < 1 + c – cm(l – k) or (1 – c²)L^m < 1 + c – cm(1 – s).     

Approximation of Distributions by Parametric Sets

Let P be a probability distribution on a separable metric space (S,d). We study the following problem of approximation of a distribution P by a set from a given class A2 ^S : W(A,P) _S (d(x,A))P(dx)min _AA , where is a nondecreasing function. A special case where A is a parametric class A={A():T} is considered in detail. Our main interest is to obtain convergence results for sequences {A ^* _n }, where A ^* _n is an optimal set for a measure P _n satisfying P _n P, as n.     

Distribution of the supremum of sums of independent variables with negative drift

Let {_n} be a sequence of identically distributed independent random variables,M₁=<0,M ₁ ² <;S ₀=0,S _n =₁+₂,+...+ _{n, n}1;¯ S=sup {S _n n=0.} The asymptotic behavior ofP(¯ St) as t is studied. If _t ^P (₁x dx=0((t)), thenP(¯ St)– 1/¦¦ _t P (₁x dx=0((t)) (t) is a positive function, having regular behavior at infinity.Translated from Matematicheskie Zametki, Vol. 22, No. 5, pp. 763–770, November, 1977.The author thanks B. A. Rogozin for the formulation of the problem and valuable remarks.     

Randomly Weighted Sums of Subexponential Random Variables with Application to Ruin Theory

Let {X _k , 1 k n} be n independent and real-valued random variables with common subexponential distribution function, and let {k, 1 k n} be other n random variables independent of {X _k , 1 k n} and satisfying a _k b for some 0 < a b < for all 1 k n. This paper proves that the asymptotic relations P (max_{1 m n k=1} ^m _k X _k > x) P (sum _k=1 ⁿ _k X _k > x) sum _k=1 ⁿ P ( _k X _k > x) hold as x . In doing so, no any assumption is made on the dependence structure of the sequence { _k , 1 k n}. An application to ruin theory is proposed.     

Canonical Equivalence Relations on ℚ n

We show that for each positive integer n there is a finite list of equivalence relations on [] ⁿ with the property that for every other equivalence relation E on [] ⁿ there is X of order type equal to the order type of , such that E[X] ⁿ is equal to one of the equivalence relations from the list.     

Staircase kernels for orthogonald-polytopes

LetS be a finite union of boxes inR ^d . Forx inS, defineA _x ={yx is clearly visible fromy via staircase paths inS}, and let KerS denote the staircase kernel ofS. Then KerS={A _x x is a point of local nonconvexity ofS}. A similar result holds with clearly visible replaced by visible and points of local nonconvexity ofS replaced by boundary points ofS.Supported in part by NSF grant DMS-9207019.     

On trajectory convergence of dissipative flows in Banach spaces

LetX be a convex compact in a real Banach spaceE. An actionU(t) (t0) of the semigroup ₊ onX is called dissipative if allU(t) are nonexpanding: U(t)x ₁–U(t)x ₂x ₁–x ₂. Let the spaceE be strongly normed. We prove that all trajectoriestU(t)x of the dissipative flowU(t) are converging fort if there are no two-dimensional Euclidean subspaces in the spaceE. In every two dimensional non-Euclidean spaceE (not necessarily strongly normed) all trajectories of the flow under consideration are converging.     

On an isomorphism problem on the closed-set lattice of a graph

Let (G) and V(G) be, respectively, the closed-set lattice and the vertex set of a graph G. Any lattice isomorphism : V(G)(G) induces a bijection : V(G)V(G) such that for each x in V(G), (x)=x' in V(G') iff ({x})={x'}. A graph G is strongly sensitive if for any graph G' and any lattice isomorphism : (G)(G), the bijection induced by is a graph isomorphism of G onto G'. In this paper we present some sufficient conditions for graphs to be strongly sensitive and prove in particular that all C ₄-free graphs and all covering graphs of finite lattices are strongly sensitive.     

Simplices by point-sliding and the Yamnitsky-Levin algorithm

Yamnitsky and Levin proposed a variant of Khachiyan's ellopsoid method for testing feasibility of systems of linear inequalities that also runs in polynomial time but uses simplices instead of ellipsoids. Starting with then-simplexS and the half-space {x¦a ^Tx }, the algorithm finds a simplexS _YL of small volume that enclosesS {x¦a ^Tx }. We interpretS _YL as a simplex obtainable by point-sliding and show that the smallest such simplex can be determined by minimizing a simple strictly convex function. We furthermore discuss some numerical results. The results suggest that the number of iterations used by our method may be considerably less than that of the standard ellipsoid method.     

Asymptote of the eigenvalues of a completely continuous operator

It is proved that if(x) is the majorant of the s-numbers of a completely continuous operator A (i.e.,'(x)- 0, S_n(A) (n)) and if there are found numbers [0, 1] and r₀ > 0 such that r⁰ (r)/(r) will be monotonic in (r₀,), then for some > 0,((x) will be a majorant of the eigenvalues of A.Translated from Matematicheskie Zametki, Vol. 14, No. 4, pp. 487–492, October, 1973.     

Measure properties of the set of initial data yielding non uniqueness for a class of differential inclusions

We study uniqueness property for the Cauchy problemxV(x), x(0)=, whereVR ⁿR is a locally Lipschitz continuous, quasiconvex function (i.e. the sublevel sets {Vc} are convex) and V(x) is the generalized gradient ofV atx. We prove that if 0V(x) forV(x)b, then the set of initial data {V=b} yielding non uniqueness of solution in a geometric sense has (n–1)-dimensional Hausdorff measure zero in {V=b}.     

Syzygies of Veronese Embeddings

We prove that the Veronese embedding _O ⁿ (d): ^{n N} with n2, d3 does not satisfy property N _p (according to Green and Lazarsfeld) if p3d–2. We make the conjecture that also the converse holds. This is true for n=2 and for n=d=3.     

A result concerning the existence of certain finite Minkowski - 2 - Structures

Under a special assumption, a theorem concerning the order of Minkowski - 2 - Structures is proved. In particular it is shown that if is a sharply 4 - transitive set of permutations onn elements (n7, integer), such that contains the identical permutation and implies ^–1, then isn=11.     

Weighted Least Square Convergence of Lagrange Interpolation on the Unit Circle

In the paper, a result of Walsh and Sharma on least square convergence of Lagrange interpolation polynomials based on the n-th roots of unity is extended to Lagrange interpolation on the sets obtained by projecting vertically the zeros of (1-x)²=P ^(a,) _n(x),a>0,>0,(1-x)P^(a,) _n(x),a>0,>-1,(1+x)P P^(a,) _n(x),a>-1,0 and P^(a,) _n(x),a>-1,>-1, respectively, onto the unit circle, where P^(a,) _n(x),a>-1,>-1, stands for the n-th Jacobi polynomial. Moreover, a result of Saff and Walsh is also extended.     

Notes on Coalition Lattices

Given a finite partially ordered set P, for subsets or, in other words coalitions X, Y of P let X Y mean that there exists an injection : X Y such that x (x) for all x X. The set L(P) of all subsets of P equipped with this relation is a partially ordered set. When L(P) is a lattice, it is called the coalition lattice of P. It is shown that P is determined by the coalition lattice L(P). Further, any coalition lattice satisfies the Jordan–Hölder chain condition. The so-called winning coalitions, i.e. coalitions X such that P\X X in L(P), are shown to form a dual ideal in L(P). Finally, an inductive formula on P is given to describe the lattice operations in L(P), and this result also works for certain quasiordered sets P.