Searcharxiv⌕ Search

arXiv subjects

Pedro A. García-Sánchez

Publications and source records attributed to Pedro A. García-Sánchez.

At least 19 recordsLinked to original sources
arXiv2024

Elements with unique length factorization of a numerical semigroup generated by three consecutive numbers

Let $S$ be the numerical semigroup generated by three consecutive numbers $a,a+1,a+2$, where $a\in\mathbb{N}$, $a\geq 3$. We describe the elements of $S$ whose factorizations have all the same length, as well as the set of factorizations of each of these elements. We give natural partitions of this subset of $S$ in terms of the length and the denumerant. By using Apéry sets and Betti elements we are able to extend some results, first obtained by elementary means.

math.CO↗
arXiv2023

Universally free numerical semigroups

A numerical semigroup is said to be universally free if it is free for any possible arrangement of its minimal generating set. In this work, we establish that toric ideals associated with universally free numerical semigroups can be generated by their set of circuits. Additionally, we provide a characterization of universally free numerical semigroups in terms of Gröbner bases. Specifically, a numerical semigroup is universally free if and only if all initial ideals of its corresponding toric ideal are complete intersections. Furthermore, we establish several equalities among the toric bases of a universally free numerical semigroup. We provide a complete characterization of $3$-generated universally free numerical semigroups in terms of their minimal generating sets, and by proving the equality of certain toric bases. We compute exactly all the toric bases of a toric ideal defined by a 3-generated universally free numerical semigroup. Notably, we answer some questions posed by Tatakis and Thoma by demonstrating that toric ideals defined by $3$-generated universally free numerical semigroups have a set of circuits and a universal Gröbner basis of size 3, while the universal Markov basis and the Graver basis can be arbitrarily large. We present partial results and propose several conjectures regarding universally free numerical semigroups with more than three generators.

math.AC↗
arXiv2023

Apéry sets and the ideal class monoid of a numerical semigroup

The aim of this article is to study the ideal class monoid $\mathcal{C}\ell(S)$ of a numerical semigroup $S$ introduced by V. Barucci and F. Khouja. We prove new bounds on the cardinality of $\mathcal{C}\ell(S)$. We observe that $\mathcal{C}\ell(S)$ is isomorphic to the monoid of ideals of $S$ whose smallest element is 0, which helps to relate $\mathcal{C}\ell(S)$ to the Apéry sets and the Kunz coordinates of $S$. We study some combinatorial and algebraic properties of $\mathcal{C}\ell(S)$, including the reduction number of ideals, and the Hasse diagrams of $\mathcal{C}\ell(S)$ with respect to inclusion and addition. From these diagrams we can recover some notable invariants of the semigroup. Lastly, we prove some results about irreducible elements, atoms, quarks and primes of $(\mathcal{C}\ell(S),+)$. Idempotent ideals coincide with over-semigroups and idempotent quarks correspond to unitary extensions of the semigroup. We show that a numerical semigroup is irreducible if and only if $\mathcal{C}\ell(S)$ has at most two quarks.

math.AC↗
arXiv2022

Isolated factorizations and their applications in simplicial affine semigroups

We introduce the concept of isolated factorizations of an element of a commutative monoid and study its properties. We give several bounds for the number of isolated factorizations of simplicial affine semigroups and numerical semigroups. We also generalize $α$-rectangular numerical semigroups to the context of simplicial affine semigroups and study their isolated factorizations. As a consequence of our results, we characterize those complete intersection simplicial affine semigroups with only one Betti minimal element in several ways. Moreover, we define Betti sorted and Betti divisible simplicial affine semigroups and characterize them in terms of gluings and their minimal presentations. Finally, we determine all the Betti divisible numerical semigroups, which turn out to be those numerical semigroups that are free for any arrangement of their minimal generators.

math.AC↗
arXiv2021

Factorization in monoids by stratification of atoms and the Elliott Problem

In an additive factorial monoid each element can be represented as a linear combination of irreducible elements (atoms) with uniquely determined coefficients running over all natural numbers. In this paper we develop for a wide class of non-factorial monoids a concept of stratification for atoms which allows to represent each element as a linear combination of atoms where the coefficients are uniquely determined when restricted in a particular way. This wide class includes inside factorial monoids and in particular simplicial affine semigroups. In the latter case the question of uniqueness is related to a problem studied by E. B. Elliott in a paper from 1903. For the monoid of all nonnegative solutions of a certain linear Diophantine equation in three variables, Elliott considers "simple sets of solutions" (atoms of the monoid) and looks for a method that gives "every set once only". We show that for simplicial affine semigroups in two dimensions a stratification is always possible, which answers to Elliott's problem also for the cases he left open. The results in this paper on the stratification of atoms for monoids in general may be seen also as an answer to a "generalized Elliott problem".

math.NT↗
arXiv2021

The monoid of monotone functions on a poset and quasi-arithmetic multiplicities for uniform matroids

We describe the structure of the monoid of natural-valued monotone functions on an arbitrary poset. For this monoid we provide a presentation, a characterization of prime elements, and a description of its convex hull. We also study the associated monoid ring, proving that it is normal, and thus Cohen-Macaulay. We determine its Cohen-Macaulay type, characterize the Gorenstein property, and provide a Gröbner basis of the defining ideal. Then we apply these results to the monoid of quasi-arithmetic multiplicities on a uniform matroid. Finally we state some conjectures on the number of irreducibles for the monoid of multiplicities on an arbitrary matroid.

math.CO↗
arXiv2021

Cyclotomic exponent sequences of numerical semigroups

We study the cyclotomic exponent sequence of a numerical semigroup $S,$ and we compute its values at the gaps of $S,$ the elements of $S$ with unique representations in terms of minimal generators, and the Betti elements $b\in S$ for which the set $\{a \in \operatorname{Betti}(S) : a \le_{S}b\}$ is totally ordered with respect to $\le_S$ (we write $a \le_S b$ whenever $a - b \in S,$ with $a,b\in S$). This allows us to characterize certain semigroup families, such as Betti-sorted or Betti-divisible numerical semigroups, as well as numerical semigroups with a unique Betti element, in terms of their cyclotomic exponent sequences. Our results also apply to cyclotomic numerical semigroups, which are numerical semigroups with a finitely supported cyclotomic exponent sequence. We show that cyclotomic numerical semigroups with certain cyclotomic exponent sequences are complete intersections, thereby making progress towards proving the conjecture of Ciolan, García-Sánchez and Moree (2016) stating that $S$ is cyclotomic if and only if it is a complete intersection.

math.AC↗
arXiv2019

Algorithms for Generalized Numerical Semigroups

We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies that they are finitely generated. For a given finite set of elements in $\mathbb{N}^d$ we show how to deduce if the monoid spanned by this set is a generalized numerical semigroup and, if so, we calculate its set of gaps. Also, given a finite set of elements in $\mathbb{N}^d$ we can determine if it is the set of gaps of a generalized numerical semigroup and, if so, compute the minimal generators of this monoid. We provide a new algorithm to compute the set of all generalized numerical semigroups with a prescribed genus (the cardinality of their sets of gaps). It was used to compute the number of such semigroups, and its implementation allowed us to compute (for various dimensions) the number of numerical semigroups for genus that had not been attained before.

math.CO↗
arXiv2018

Inside factorial monoids and the cale monoid of a single Diophantine equation

We give a structure theorem for inside factorial domains. As an example we study the monoid of nonnegative integer solutions of equations of the form $a_1x_1+\cdots +a_{r-1}x_{r-1}=a_rx_r$, with $a_1,\ldots,a_r$ positive integers. This set is isomorphic to a simplicial full affine semigroup, and thus it can be described in terms of its extremal rays and the Apéry sets with respect to the extremal rays.

math.AC↗
arXiv2017

Good subsemigroups of $\mathbb N^n$

Value semigroups of non irreducible singular algebraic curves and their fractional ideals are submonoids of $\mathbb Z^n$ that are closed under infimums, have a conductor and fulfill a special compatibility property on their elements. Monoids of $\mathbb N^n$ fulfilling these three conditions are known in the literature as good semigroups and there are examples of good semigroups that are not realizable as the value semigroup of an algebraic curve. In this paper we consider good semigroups independently from their algebraic counterpart, in a purely combinatoric setting. We define the concept of good system of generators, and we show that minimal good systems of generators are unique. Moreover, we give a constructive way to compute the canonical ideal and the Arf closure of a good subsemigroup when $n=2$.

math.AC↗
arXiv2017

On the computation of factorization invariants for affine semigroups

We present several new algorithms for computing factorization invariant values over affine semigroups. In particular, we give (i) the first known algorithm to compute the delta set of any affine semigroup, (ii) an improved method of computing the tame degree of an affine semigroup, and (iii) a dynamic algorithm to compute catenary degrees of affine semigroup elements. Our algorithms rely on theoretical results from combinatorial commutative algebra involving Gröbner bases, Hilbert bases, and other standard techniques. Implementation in the computer algebra system GAP is discussed.

math.NT↗
arXiv2016

Bases of subalgebras of K[[x]] and K[x]

Let $f\_1,\ldots, f\_s$ be formal power series (respectively polynomials) in thevariable $x$. We study the semigroup of orders of the formal series inthe algebra $K[[ f1,\ldots, f\_s]] \subseteq K[[ x ]]$ (respectively the semigroup of degrees of polynomials in$K[f\_1,\ldots,f\_s]\subseteq K[x]$). We give procedures to compute thesesemigroups and several applications.

math.AG↗
arXiv2016

Cyclotomic numerical semigroups

Given a numerical semigroup $S$, we let $\mathrm P_S(x)=(1-x)\sum_{s\in S}x^s$ be its semigroup polynomial. We study cyclotomic numerical semigroups; these are numerical semigroups $S$ such that $\mathrm P_S(x)$ has all its roots in the unit disc. We conjecture that $S$ is a cyclotomic numerical semigroup if and only if $S$ is a complete intersection numerical semigroup and present some evidence for it. Aside from the notion of cyclotomic numerical semigroup we introduce the notion of cyclotomic exponents and polynomially related numerical semigroups. We derive some properties and give some applications of these new concepts.

math.NT↗
arXiv2014

Numerical semigroups and applications

The aim of this manuscript is to give some basic notions related to numerical semigroups, and from these on the one hand describe a classical application to the study of singularities of plane algebraic curves, and on the other, show how numerical semigroups can be used to obtain handy examples of nonunique factorization invariants.

math.AG↗
arXiv2014

On curves with one place at infinity

Let $f$ be a plane curve. We give a procedure based on Abhyankar's approximate roots to detect if it has a single place at infinity, and if so construct its associated $δ$-sequence, and consequently its value semigroup. Also for fixed genus (equivalently Frobenius number) we construct all $δ$-sequences generating numerical semigroups with this given genus. For a $δ$-sequence we present a procedure to construct all curves having this associated sequence. We also study the embeddings of such curves in the plane. In particular, we prove that polynomial curves might not have a unique embedding.

math.AG↗
arXiv2013

Frobenius vectors, Hilbert series and gluings

Let $S_1$ and $S_2$ be two affine semigroups and let $S$ be the gluing of $S_1$ and $S_2$. Several invariants of $S$ are then related to those of $S_1$ and $S_2$; we review some of the most important properties preserved under gluings. The aim of this paper is to prove that this is the case for the Frobenius vector and the Hilbert series. Applications to complete intersection affine semigroups are also given.

math.AC↗