Peak Reduction Technique in Commutative Algebra
Vladimir Shpilrain () and
Jie-Tai Yu ()
Additional contact information
Vladimir Shpilrain: The City College of New York, Department of Mathematics
Jie-Tai Yu: The City College of New York, Department of Mathematics
A chapter in Formal Power Series and Algebraic Combinatorics, 2000, pp 593-599 from Springer
Abstract:
Abstract The “peak reduction” method is a powerful combinatorial technique with applications in many different areas of mathematics as well as theoretical computer science. It was originally created by Whitehead, a famous topologist and group theorist, who used it to solve an important algorithmic problem concerning automorphisms of a free group. Since then, this method was used to solve numerous problems in group theory, topology, combinatorics, and probably in some other areas as well. In this paper, we present what seems to be the first applications of this technique in commutative algebra and affine algebraic geometry. We contribute toward a classification of two-variable polynomials by classifying, up to an automorphism, polynomials of the form $$a{\chi ^n} + b{y^m} + \sum\nolimits_{im + jn \leqslant mn} {cij{\chi ^i}} {y^j}$$ (i.e., polynomials whose Newton polygon is either a triangle or a line segment). This has several applications to the study of embeddings of algebraic curves in the plane. In particular, upon combining our method with a well-known theorem of Zaidenberg and Lin, we show that one can decide “almost” just by inspection whether or not a polynomial fiber {p(x, y) = 0} is an irreducible simply connected curve. Another application that we present here, yields a new decomposition of the group Aut(K(x, y)) in a free product with amalgamation.
Date: 2000
References: Add references at CitEc
Citations:
There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-04166-6_57
Ordering information: This item can be ordered from
http://www.springer.com/9783662041666
DOI: 10.1007/978-3-662-04166-6_57
Access Statistics for this chapter
More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().