In this paper we consider test polynomials in the polynomial algebra and the free associative algebra. A test polynomial is defined by the following property: every endomorphism which fixes the polynomial is an automorphism. We construct families of test polynomials for the polynomial algebra and th
Degree bounds of minimal polynomials and polynomial automorphisms
β Scribed by Jie-Tai Yu
- Publisher
- Elsevier Science
- Year
- 1994
- Tongue
- English
- Weight
- 155 KB
- Volume
- 92
- Category
- Article
- ISSN
- 0022-4049
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract It is shown that the feasibly constructive arithmetic theory IPV does not prove (double negation of) LMIN(NP), unless the polynomial hierarchy CPVβprovably collapses. It is proved that PV plus (double negation of) LMIN(NP) intuitionistically proves PIND(coNP). It is observed that PV + P
In this paper we give explicit factorizations which demonstrate the stable tameness of all polynomial automorphisms arising from a recent construction of Hubbers and van den Essen. This is accomplished by two different factorizations of such an automorphism by triangular automorphisms, one which is