𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Decision Problem for Certain Nilpotent Closed Varieties

✍ Scribed by Stephen D. Comer

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
280 KB
Volume
27
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

THE DECISION PROBLEM FOR CERTAIN NILPOTENT CLOSED VARIETIES by STEPHEN D. COMER in Charleston, South Carolina (U.S.A.

πŸ“œ SIMILAR VOLUMES

The Paley–Wiener theorem for certain nil
The Paley–Wiener theorem for certain nilpotent Lie groupsJean
✍ Jean Ludwig; Carine Molitor–Braun πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 243 KB

## Abstract We generalize the classical Paley–Wiener theorem to special types of connected, simply connected, nilpotent Lie groups: First we consider nilpotent Lie groups whose Lie algebra admits an ideal which is a polarization for a dense subset of generic linear forms on the Lie algebra. Then we

CLOSED FORMULAE FOR THE GENERALIZED β„‹βˆž S
CLOSED FORMULAE FOR THE GENERALIZED β„‹βˆž SENSITIVITY MINIMIZATION PROBLEM
✍ Keith G. Woodgate πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 258 KB

The paper presents a complete solution for the multivariable, continuous-time Generalized H (GH ) sensitivity minimization problem. In contrast with existing solutions, derived via polynomial methods, the state-space solution given here is essentially non-iterative. Closed formulae for the minimum a

The conjugate gradient technique for cer
The conjugate gradient technique for certain quadratic network problems
✍ Larry J. Leblanc πŸ“‚ Article πŸ“… 1976 πŸ› John Wiley and Sons 🌐 English βš– 326 KB

## Abstract We consider a class of network flow problems with pure quadratic costs and demonstrate that the conjugate gradient technique is highly effective for large‐scale versions. It is shown that finding a saddle point for the Lagrangian of an __m__ constraint, __n__ variable network problem re