Parity numerical semigroups

Abstract

A numerical semigroup is parity (P-semigroup) if the sum of two consecutive elements of $S$ is odd. In this paper we will order the P-semigroups creating a tree with root. This ordering allows us to give some algorithms to build all the P-semigroups with a fixed genus and Frobenius number. Also, we will study the maximal P-semigroups with a given Frobenius number as well as the P-semigroups with maximum embedding dimension.