File tree Expand file tree Collapse file tree 1 file changed +2
-15
lines changed Expand file tree Collapse file tree 1 file changed +2
-15
lines changed Original file line number Diff line number Diff line change @@ -59,19 +59,6 @@ the constructor as follows.
59
59
R[:x ]
60
60
```
61
61
62
- It is also possible to create a polynomial ring with default symbol as follows.
63
- This is a lightweight constructor and should be used in generic algorithms
64
- wherever possible when creating polynomial rings where the symbol does not
65
- matter.
66
-
67
- ``` julia
68
- PolyRing (R:: Ring )
69
- ```
70
-
71
- Given a base ring ` R ` return the polynomial ring $S = R[ x] $. Note that unlike
72
- the constructors above, the return type is not a tuple. Only the ring is
73
- returned and not the generator. The polynomial ring is not cached.
74
-
75
62
Here are some examples of creating polynomial rings and their associated
76
63
generators.
77
64
@@ -81,8 +68,8 @@ generators.
81
68
julia> T, z = QQ["z"]
82
69
(Univariate polynomial ring in z over rationals, z)
83
70
84
- julia> U = PolyRing (ZZ)
85
- Univariate polynomial ring in x over integers
71
+ julia> U, x = polynomial_ring (ZZ)
72
+ ( Univariate polynomial ring in x over integers, x)
86
73
```
87
74
88
75
All of the examples here are generic polynomial rings, but specialised implementations
You can’t perform that action at this time.
0 commit comments