English
Related papers

Related papers: Arithmetic varieties of numerical semigroups

200 papers

We study the Ap\'ery set of good subsemigoups of $\mathbb N^2$, a class of semigroups containing the value semigroups of curve singularities with two branches. Even if this set in infinite, we show that, for the Ap\'ery set of such…

Commutative Algebra · Mathematics 2019-02-01 Marco D'Anna , Lorenzo Guerrieri , Vincenzo Micale

The change-making problem was recently extended to sets of positive integers not containing the element $1$, and from there to numerical semigroups. A greedy numerical semigroup is defined as a numerical semigroup where the greedy…

Combinatorics · Mathematics 2026-02-24 Arnau Messegué-Buisan , Hebert Pérez-Rosés

We study a numerical semigroup ring as an algebra over another numerical semigroup ring. The complete intersection property of numerical semigroup algebras is investigated using factorizations of monomials into minimal ones. The goal is to…

Commutative Algebra · Mathematics 2018-09-03 I-Chiau Huang , Raheleh Jafari

Let $S$ be a numerical semigroup. We will say that $h\in {\mathbb{N}} \backslash S$ is an {\it isolated gap }of $S$ if $\{h-1,h+1\}\subseteq S.$ A numerical semigroup without isolated gaps is called perfect numerical semigroup. Denote by…

Commutative Algebra · Mathematics 2023-05-25 M. A. Moreno-Frías , J. C. Rosales

In this paper we compute the Frobenius number of certain {\em Fibonacci numerical semigroups}, that is, numerical semigroups generated by a set of Fibonacci numbers, in terms of Fibonacci numbers.

Combinatorics · Mathematics 2007-05-23 J. M. Marin , J. Ramirez Alfonsin , M. P. Revuelta

We compute the Frobenius number for numerical semigroups generated by the squares of three consecutive Fibonacci numbers. We achieve this by using and comparing three distinct algorithmic approaches: those developed by Ram\'irez Alfons\'in…

Number Theory · Mathematics 2025-07-03 Aureliano M. Robles-Pérez , José Carlos Rosales

Patterns on numerical semigroups are multivariate linear polynomials, and they are said to be admissible if there exists a numerical semigroup such that evaluated at any nonincreasing sequence of elements of the semigroup gives integers…

Number Theory · Mathematics 2012-11-06 Maria Bras-Amorós , Pedro A. García-Sánchez , Albert Vico-Oton

Let $A$ be an abelian variety over a finite field $k$ with $|k|=q=p^m$. Let $\pi\in \text{End}_k(A)$ denote the Frobenius and let $v=\frac{q}{\pi}$ denote Verschiebung. Suppose the Weil $q$-polynomial of $A$ is irreducible. When…

Number Theory · Mathematics 2021-09-10 Hanson Smith

We examine properties of random numerical semigroups under a probabilistic model inspired by the Erdos-Renyi model for random graphs. We provide a threshold function for cofiniteness, and bound the expected embedding dimension, genus, and…

Commutative Algebra · Mathematics 2017-10-25 Jesus De Loera , Christopher O'Neill , Dane Wilburne

We define the concentration of a numerical semigroup $S$ as $\mathsf{C}(S)=\max \left\{\text{next}_S(s)-s ~|~ s\in S \backslash \{0\}\right\}$ wherein $\text{next}_S(s)=\min\left\{x \in S ~|~ s<x\right\}$. In this paper, we study the class…

Commutative Algebra · Mathematics 2021-04-01 José C. Rosales , M. B. Branco , Márcio A. Traesel

In this short note we count the finite semirings up to isomorphism, and up to isomorphism and anti-isomorphism for some small values of $n$; for which we utilise the existing library of small semigroups in the GAP package Smallsemi.

Rings and Algebras · Mathematics 2025-12-02 J. Edwards , J. D. Mitchell , P. Ragavan

Let $f_1(n), \ldots, f_k(n)$ be polynomial functions of $n$. For fixed $n\in\mathbb{N}$, let $S_n\subseteq \mathbb{N}$ be the numerical semigroup generated by $f_1(n),\ldots,f_k(n)$. As $n$ varies, we show that many invariants of $S_n$ are…

Combinatorics · Mathematics 2019-11-22 Tristram Bogart , John Goodrick , Kevin Woods

The greatest integer that does not belong to a numerical semigroup $S$ is called the Frobenius number of $S$, and finding the Frobenius number is called the Frobenius problem. In this paper, we solve the Frobenius problem for the numerical…

Number Theory · Mathematics 2025-10-06 WonTae Hwang , Kyunghwan Song

We study varieties of semigroups related to completely 0-simple semigroup. We present here an algorithmic descriptions of these varieties in terms of "forbidden" semigroups. We also describe residually completely 0-simple varieties of…

Group Theory · Mathematics 2011-06-01 Stanislav Kublanovsky

Combinatorics on multisets is used to deduce new upper and lower bounds on the number of numerical semigroups of each given genus, significantly improving existing ones. In particular, it is proved that the number $n_g$ of numerical…

Combinatorics · Mathematics 2008-02-18 Maria Bras-Amoros

Consider a sequence of positive integers of the form $ca^n-d$, $n\geq 1$, where $a, c$ and $d$ are positive integers, $a>1$. For each $n\geq 1$, let $S_n$ be the submonoid of $\mathbb N$ generated by $\mathbf s_j=ca^{n+j}-d$, with…

Number Theory · Mathematics 2023-01-25 Fabián Arias , Jerson Borja

This paper is a continuation of the paper "Numerical Semigroups: Ap\'ery Sets and Hilbert Series". We consider the general numerical AA-semigroup, i.e., semigroups consisting of all non-negative integer linear combinations of relatively…

Commutative Algebra · Mathematics 2017-01-17 Ignacio García-Marco , Jorge L. Ramírez Alfonsín , Oystein J. Rodseth

A phylogenetic variety is an algebraic variety parameterized by a statistical model of the evolution of biological sequences along a tree. Understanding this variety is an important problem in the area of algebraic statistics with…

Populations and Evolution · Quantitative Biology 2024-05-22 Luis David Garcia Puente , Marina Garrote-López , Elima Shehu

We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…

Formal Languages and Automata Theory · Computer Science 2013-10-21 Ines Klimann , Jean Mairesse , Matthieu Picantin

For a numerical semigroup, we encode the set of primitive elements that are larger than its Frobenius number and show how to produce in a fast way the corresponding sets for its children in the semigroup tree. This allows us to present an…

Combinatorics · Mathematics 2019-11-11 Maria Bras-Amorós , Julio Fernández-González
‹ Prev 1 4 5 6 7 8 10 Next ›