Linear, non-homogeneous, symmetric patterns and prime power generators in numerical semigroups associated to combinatorial configurations

We prove that the numerical semigroups associated to the combinatorial configurations satisfy a family of linear, non-homogeneous, symmetric patterns. We use these patterns to prove an upper bound of the conductor and we also give an upper bound of the multiplicity. Also, we compare bounds of the conductor of numerical semigroups associated to balanced configurations, and to configurations with coprime parameters. The proof of the latter involves a bound of the conductor of prime power generated numerical semigroups.