#### Faculty Mentor

Dr. Florian Enescu

#### Proposal Type

Oral Presentation

#### Start Date

2-11-2019 8:00 AM

#### End Date

2-11-2019 9:00 AM

#### Location

Nesbitt 2203

#### Abstract

Let $K$ be a field, and let n_{1}, ..., n_{r} be positive integers. The Ideal of relations of the semigroup ring K[x_{1}, ..., x_{r}] generated by n_{1},..., n_{r} is P(n_{1},..., n_{r}) = {f(x_{1},...,x_{r}): f(x_{1},...,x_{r}) \in K[x_{1},...,x_{r}], f(t^{n_{1}}, ... ,t^{n_{r}}) = 0} with t is transcendental over K.

In 1970, Herzog showed that the least upper bound on the number of generators of $P(n_{1},..., n_{r}) for r=3 is 3. In 1975, Bresinsky showed that the lowest upper bound on the number of generators of P(n_{1},..., n_{r})$, can be arbitrarily large if r >=4. More recently, Herzog and Stamate provided a closed form for the number of generators for the semigroup ring in Bresinsky’s example, and showed that in this case, the number of generators for the semigroup ring is arbitrarily large but even. Progress have been made in finding a closed form for the number of generators of ideal of relations for various semigroup rings with four or more generators. All established work on this subject produced examples where this number is always an even number. However, in 2017, Stamate considered a semigroup suggested by Backelin, which has the following structure

< r(3n+2)+3, r(3n+2)+6, r(3n+2)+3n+4, r(3n+2)+3n+5 > where n >= 2 and r >= 3n+2. Stamate reports that, computations using Singular and GAP (Groups, Algorithms, Programming - a System for Computational Discrete Algebra) indicate that the number of generators for this semigroup is 3n+4, which can be an odd number. In 2018 we showed that the conjecture holds for the special case where n=2. In this work, we prove that the result holds for any n.

#### Included in

The minimal generating set of the presentation ideal of Backelin semigroup ring

Nesbitt 2203

Let $K$ be a field, and let n_{1}, ..., n_{r} be positive integers. The Ideal of relations of the semigroup ring K[x_{1}, ..., x_{r}] generated by n_{1},..., n_{r} is P(n_{1},..., n_{r}) = {f(x_{1},...,x_{r}): f(x_{1},...,x_{r}) \in K[x_{1},...,x_{r}], f(t^{n_{1}}, ... ,t^{n_{r}}) = 0} with t is transcendental over K.

In 1970, Herzog showed that the least upper bound on the number of generators of $P(n_{1},..., n_{r}) for r=3 is 3. In 1975, Bresinsky showed that the lowest upper bound on the number of generators of P(n_{1},..., n_{r})$, can be arbitrarily large if r >=4. More recently, Herzog and Stamate provided a closed form for the number of generators for the semigroup ring in Bresinsky’s example, and showed that in this case, the number of generators for the semigroup ring is arbitrarily large but even. Progress have been made in finding a closed form for the number of generators of ideal of relations for various semigroup rings with four or more generators. All established work on this subject produced examples where this number is always an even number. However, in 2017, Stamate considered a semigroup suggested by Backelin, which has the following structure

< r(3n+2)+3, r(3n+2)+6, r(3n+2)+3n+4, r(3n+2)+3n+5 > where n >= 2 and r >= 3n+2. Stamate reports that, computations using Singular and GAP (Groups, Algorithms, Programming - a System for Computational Discrete Algebra) indicate that the number of generators for this semigroup is 3n+4, which can be an odd number. In 2018 we showed that the conjecture holds for the special case where n=2. In this work, we prove that the result holds for any n.