2017
DOI: 10.1016/j.jsc.2016.08.002
|View full text |Cite
|
Sign up to set email alerts
|

Bases of subalgebras of Kx and K[x]

Abstract: Let f1, . . . , fs be formal power series (respectively polynomials) in the variable x. We study the semigroup of orders of the formal series in the algebra K f1, . . . , fs ⊆ K x (respectively the semigroup of degrees of polynomials in K[f1, . . . , fs] ⊆ K[x]). We give procedures to compute these semigroups and several applications. We prove in particular that the space curve parametrized by f1, . . . , fs has a flat deformation into a monomial curve.Proof. This follows easily from the definition of order. P… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
9
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(9 citation statements)
references
References 13 publications
0
9
0
Order By: Relevance
“…If (a, b) is one of this minimal generators, then ϕ(a) = ϕ(b) ∈ S is called a primitive element of S. These elements play an important role in factorization properties of S, and consequently we provide a function to compute them. gap> s:=NumericalSemigroup (5,7,9); <Numerical semigroup with 3 generators> gap> MinimalPresentationOfNumericalSemigroup(s);…”
Section: 4mentioning
confidence: 99%
See 3 more Smart Citations
“…If (a, b) is one of this minimal generators, then ϕ(a) = ϕ(b) ∈ S is called a primitive element of S. These elements play an important role in factorization properties of S, and consequently we provide a function to compute them. gap> s:=NumericalSemigroup (5,7,9); <Numerical semigroup with 3 generators> gap> MinimalPresentationOfNumericalSemigroup(s);…”
Section: 4mentioning
confidence: 99%
“…Also there is a procedure to compute all numerical semigroups with given Frobenius number (this is done using the concept of fundamental gap as explained in [43]) and another function to compute the set of all numerical semigroups with given genus g (by constructing the tree of all numerical semigroups up to the level g). gap> s:=NumericalSemigroup (5,7,9); <Numerical semigroup with 3 generators> gap> Length(OverSemigroupsNumericalSemigroup(s)); 15 gap> Length(NumericalSemigroupsWithFrobeniusNumber (21)); 1828…”
Section: 4mentioning
confidence: 99%
See 2 more Smart Citations
“…, F r (t) ∈ K[t]). This algorithm uses the one given in [5] in order to compute the semigroup consisting of degrees in t of elements of A. Then we consider the case where A = K[X(t), Y (t)] is the ring of coordinates of the algebraic plane curve parametrized by X(t), Y (t), and K is an algebraically closed field of characteristic zero.…”
Section: Introductionmentioning
confidence: 99%