Criteria for analytic sets to be algebraic
โ Scribed by A. Sadullaev
- Publisher
- Springer US
- Year
- 1972
- Tongue
- English
- Weight
- 125 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0016-2663
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A purely algebraic algorithm is developed for testing positive real character of real rational functions and matrices relative to the unit circle in the complex plane. Since the algorithm is entirely recursive and is performed in a$nite number of steps, it is suitable for machine computations.
A purely algebraic algorithm is developed for testing positive real character of real rational functions and matrices relative to the unit circle in the complex plane. Since the algorithm is entirely recursive and is performed in finite xumber of steps, it is suitable for machine computations.
A group G is a PT -group if, for subgroups H and K with H permutable in K and K permutable in G, it is always the case that H is permutable in G. It is shown that a finite group is a soluble PT -group if and only if each subgroup of a Sylow subgroup is permutable in the Sylow normalizer.