𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal Resultant Systems

✍ Scribed by G. Lyubeznik


Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
217 KB
Volume
177
Category
Article
ISSN
0021-8693

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Minimal Resultant Systems
✍ Zhao Yan πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 149 KB
Minimal systems
✍ Teodor StΔ™pieΕ„ πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 373 KB
Systems of minimal surfaces
✍ Alan Solomon πŸ“‚ Article πŸ“… 1967 πŸ› John Wiley and Sons 🌐 English βš– 911 KB
A minimal 3-connectedness result for mat
✍ Safwan Akkari πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 837 KB

In this paper we prove the following theorem: Let M be a 3-connected matroid other than the cycle matroid of a wheel of rank greater than three. Let C be a circuit of M. If every deletion of a pair of elements of C disconnects M, then every pair of elements of C is in a triad. A result of Oxley and

MultiPolynomial Resultant Algorithms
✍ Dinesh Manocha; John F. Canny πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 801 KB

Computational methods for manipulating sets of polynomial equations are becoming of greater importance due to the use of polynomial equations in various applications. In some cases we need to eliminate variables from a given system of polynomial equations to obtain a "symbolically smaller" system, w