中文
相关论文

相关论文: Numerical semigroups with a given set of pseudo-Fr…

200 篇论文

We show that the number of numerical semigroups with multiplicity three, four or five and fixed genus is increasing as a function in the genus. To this end we use the Kunz polytope for these multiplicities. Counting numerical semigroups…

组合数学 · 数学 2018-03-20 P. A. García-Sánchez , D. Marín-Aragón , A. M. Robles-Pérez

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…

交换代数 · 数学 2017-10-25 Jesus De Loera , Christopher O'Neill , Dane Wilburne

Every numerical semigroup can be expressed as an intersection of irreducible numerical semigroups. We show that the unions of sets of lengths of factorizations of numerical semigroups into irreducible numerical semigroups are all equal to…

交换代数 · 数学 2024-10-18 Pedro A. Garcia-Sanchez

We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…

群论 · 数学 2017-03-02 James East , Attila Egri-Nagy , James D. Mitchell

A numerical semigroup is called cyclotomic if its corresponding numerical semigroup polynomial $P_S(x)=(1-x)\sum_{s\in S}x^s$ is expressable as the product of cyclotomic polynomials. Ciolan, Garc\'ia-S\'anchez, and Moree conjectured that…

组合数学 · 数学 2017-07-07 Mehtaab Sawhney , David Stoner

We study a correspondence between numerical sets and integer partitions that leads to a bijection between simultaneous core partitions and the integer points of a certain polytope. We use this correspondence to prove combinatorial results…

组合数学 · 数学 2022-01-25 Hannah Constantin , Benjamin Houston-Edwards , Nathan Kaplan

As far as we know, usual computer algebra packages can not compute denumerants for almost medium (about a hundred digits) or almost medium--large (about a thousand digits) input data in a reasonably time cost on an ordinary computer.…

组合数学 · 数学 2017-06-28 F. Aguiló-Gost , D. Llena

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers with finite complement, and the squarefree divisor complex of an element $m \in S$ is a simplicial complex $\Delta_m$ that arises in the study of multigraded…

Let $\mathcal{C}\subseteq \mathbb{N}^p$ be an integer cone. A $\mathcal{C}$-semigroup $S\subseteq \mathcal{C}$ is an affine semigroup such that the set $\mathcal{C}\setminus S$ is finite. Such $\mathcal{C}$-semigroups are central to our…

交换代数 · 数学 2024-09-11 J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

Given a numerical semigroup $S$ and a positive integer $d$, the fraction $\frac{S}{d}=\{ x \in \mathbb{N} \ | \ dx \in S\}$ is again a numerical semigroup. In this paper we determine a generating set for $\frac{S}{d}$ in terms of the…

交换代数 · 数学 2015-06-02 Alessio Moscariello

This work introduces a new kind of affine semigroups called $P$-semigroups. Within the framework of $\mathcal C$-semigroups, we define a finite-state automaton associated to them. Moreover, this automaton determines whether a $\mathcal…

交换代数 · 数学 2025-10-16 J. I. Farrán , J. C. Rosales , R. Tapia-Ramos , A. Vigneron-Tenorio

A numerical semigroup $S$ is an additive subsemigroup of the non-negative integers, containing zero, with finite complement. Its multiplicity $m$ is its smallest nonzero element. The Apery set of $S$ is the set $\text{Ap}(S) = \{n \in S :…

交换代数 · 数学 2019-08-20 Jackson Autry , Tara Gomes , Christopher O'Neill , Vadim Ponomarenko

We investigate the class of quasitrivial semigroups and provide various characterizations of the subclass of quasitrivial and commutative semigroups as well as the subclass of quasitrivial and order-preserving semigroups. We also determine…

环与代数 · 数学 2019-05-10 Miguel Couceiro , Jimmy Devillet , Jean-Luc Marichal

The most developed aspect of the theory of finite semigroups is their classification in pseudovarieties. The main motivation for investigating such entities comes from their connection with the classification of regular languages via…

群论 · 数学 2025-04-14 Jorge Almeida

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…

数论 · 数学 2025-07-03 Aureliano M. Robles-Pérez , José Carlos Rosales

Let $n_g$ be the number of numerical semigroups of genus $g$. We present an approach to compute $n_g$ by using even gaps, and the question: Is it true that $n_{g+1}>n_g$? is investigated. Let $N_\gamma(g)$ be the number of numerical…

组合数学 · 数学 2017-08-15 Matheus Bernardini , Fernando Torres

A numerical set $S$ is a cofinite subset of $\mathbb{N}$ which contains $0$. We use the natural bijection between numerical sets and Young diagrams to define a numerical set $\widetilde{S}$, such that their Young diagrams are complements.…

Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…

符号计算 · 计算机科学 2024-06-13 Cordian Riener , Robin Schabert , Thi Xuan Vu

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

数论 · 数学 2011-04-21 Andreas Philipp

A group of matrices $G$ with entries in a number field $K$ is defined to be numerical if $G$ has a finite index subgroup of matrices whose entries are algebraic integers. It is shown that an irreducible or completely reducible subgroup of…