We prove that the existence of generic polynomials and generic extensions are equivalent over an infinite field.
Generic equivalents
โ Scribed by L A. Healey
- Publisher
- John Wiley and Sons
- Year
- 1973
- Tongue
- English
- Weight
- 72 KB
- Volume
- 16
- Category
- Article
- ISSN
- 0004-3591
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we obtain a complete classification under unitary equivalence for Hardy submodules on the polydisk which are generated by ideals of polynomials. Let I be an ideal of polynomials in n variables. Since I is generated by finitely many polynomials, I has a greatest common divisor p. So, I
It is suggested that in stochastic control problems where there is uncertainty about the current state the correct estimate of the state to be used for generating certainty equivalent controls is not always the mean value of the probability distribution for the state.
A new characterization of generalized line graphs, analogous to that of line graphs found by Van Rooij and Wilf [Acta Math Acad Sci Hungar 16 (1965), 263-269] is obtained. By a cycle of implications, we settle the equivalence of the definition of generalized line graph given by Hoffman [Combinatoria
The certainty-equivalence property, known to hold that under certain assumptions for the linear-quadratic stochastic control problem, is extended to more complex situations, when the system noise variables are related to a complicated (nonlinear) system, whose state can be partially observed, where