𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Algorithm for the Determination of the Variance of a Partially Ordered Set

✍ Scribed by K. Engel

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
273 KB
Volume
19
Category
Article
ISSN
0196-6774

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Robinson–Schensted Algorithm for a Cla
A Robinson–Schensted Algorithm for a Class of Partial Orders
✍ Thomas S. Sundquist; David G. Wagner; Julian West πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 378 KB

Let P be a finite partial order which does not contain an induced subposet isomorphic with 3+1, and let G be the incomparability graph of P. Gasharov has shown that the chromatic symmetric function X G has nonnegative coefficients when expanded in terms of Schur functions; his proof uses the dual Ja

Coding in the Partial Order of Enumerabl
Coding in the Partial Order of Enumerable Sets
✍ Leo Harrington; AndrΓ© Nies πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 489 KB

We develop methods for coding with first-order formulas into the partial order E of enumerable sets under inclusion. First we use them to reprove and generalize the (unpublished) result of the first author that the elementary theory of E has the same computational complexity as the theory of the nat

An algorithm for the solution of a third
An algorithm for the solution of a third-order eigenvalue problem
✍ G. S. Schajer; C. D. Mote Jr. πŸ“‚ Article πŸ“… 1980 πŸ› John Wiley and Sons 🌐 English βš– 302 KB

## Abstract A simple, rapidly convergent procedure is described for solving a third‐order symmetric eigenvalue problem Au = Ξ» Bu typically arising in vibration analysis. The eigenvalue problem is represented in terms of its variational dual, the Rayleigh quotient, and the eigenosolution is obtained

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
✍ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the