Focused specifically on the development of the numerical semigroup theory, this monograph provides a concise, self-contained overview for graduate students and researchers. Effective calculations are presented through algorithms and examples.

Let N be the set of nonnegative integers. A numerical semigroup is a nonempty subset S of N that is closed under addition, contains the zero element, and whose complement in N is ?nite. If n ,...,n are positive integers with gcd{n ,...,n } = 1, then the set hn ,..., 1 e 1 e 1 n i = {? n +··· + ? n | ? ,...,? ? N} is a numerical semigroup. Every numer e 1 1 e e 1 e ical semigroup is of this form. The simplicity of this concept makes it possible to state problems that are easy to understand but whose resolution is far from being trivial. This fact attracted several mathematicians like Frobenius and Sylvester at the end of the 19th century. This is how for instance the Frobenius problem arose, concerned with ?nding a formula depending on n ,...,n for the largest integer not belonging to hn ,...,n i (see [52] 1 e 1 e for a nice state of the art on this problem).

First monograph devoted exclusively to the study of numerical semigroups Presents various applications of numerical semigroups including number theory, coding theory, algebraic geometry, and others The text is self contained Presents content ranging from the basics to open research problems Accessible to any first year graduate student Includes exercises that invite the reader to prove results published in recent mathematical journals Includes supplementary material: sn.pub/extras

Klappentext

This monograph is the first devoted exclusively to the development of the theory of numerical semigroups. In this concise, self-contained text, graduate students and researchers will benefit from this broad exposition of the topic.

Key features of "Numerical Semigroups" include:

• Content ranging from the basics to open research problems and the latest advances in the field;

• Exercises at the end of each chapter that expand upon and support the material;

• Emphasis on the computational aspects of the theory; algorithms are presented to provide effective calculations;

• Many examples that illustrate the concepts and algorithms;

• Presentation of various connections between numerical semigroups and number theory, coding theory, algebraic geometry, linear programming, and commutative algebra would be of significant interest to researchers.

"Numerical Semigroups" is accessible to first year graduate students, with only a basic knowledge of algebra required, giving the full background needed for readers not familiar with the topic. Researchers will find the tools presented useful in producing examples and counterexamples in other fields such as algebraic geometry, number theory, and linear programming.

Inhalt
Notable elements.- Numerical semigroups with maximal embedding dimension.- Irreducible numerical semigroups.- Proportionally modular numerical semigroups.- The quotient of a numerical semigroup by a positive integer.- Families of numerical semigroups closed under finite intersections and adjoin of the Frobenius number.- Presentations of a numerical semigroup.- The gluing of numerical semigroups.- Numerical semigroups with embedding dimension three.- The structure of a numerical semigroup.