相关论文: Frobenius Problem for Semigroups ${\sl S}(d_1,d_2,…
It turns out that all instances of the diophantine Frobenius problem for three coprime a_i have a common geometric structure which is independent of arithmetic coincidences among the a_i. By exploiting this structure we easily obtain…
We study almost symmetric semigroups generated by odd integers. If the embedding dimension is four, we characterize when a symmetric semigroup that is not complete intersection or a pseudo-symmetric semigroup is generated by odd integers.…
We consider commutativity equations $F_i F_j =F_j F_i$ for a function $F(x^1, \dots, x^N),$ where $F_i$ is a matrix of the third order derivatives $F_{ikl}$. We show that under certain non-degeneracy conditions a solution $F$ satisfies the…
Our goal is to convince the readers that the theory of complex normal surface singularities can be a powerful tool in the study of numerical semigroups, and, in the same time, a very rich source of interesting affine and numerical…
We generalize the geometric sequence $\{a^p, a^{p-1}b, a^{p-2}b^2,...,b^p\}$ to allow the $p$ copies of $a$ (resp. $b$) to all be different. We call the sequence $\{a_1a_2a_3\cdots a_p, b_1a_2a_3\cdots a_p, b_1b_2a_3\cdots a_p,\ldots,…
Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…
In this work, we introduce the subgroups $D_m(G)$ and $D_{m,n}(G)$, defined in terms of the orders of products of coprime elements in a finite group $G$. We show that both subgroups are characteristic, that $D_{m,n}(G)$ is always nilpotent,…
In this work we will show that if $F$ is a positive integer, then ${\mathrm{Sat}}(F)=\{S\mid S \mbox{ is a saturated numerical semigroup with Frobenius number } F\}$ is a covariety. As a consequence, we present two algorithms: one that…
Let $p_1=2, p_2=3, p_3=5, \ldots$ be the consecutive prime numbers, $S_n$ the numerical semigroup generated by the primes not less than $p_n$ and $u_n$ the largest irredundant generator of $S_n$. We will show, that $\bullet$ $u_n\sim3p_n$.…
If $m \in \mathbb{N}$ and $A$ is a finite subset of $\bigcup_{k \in \mathbb{N} \setminus \{0,1\}} \{1,\ldots,m-1\}^k$, then we denote by \begin{align*} \mathscr{C}(m,A) = \left\{S\in \mathscr{S}_m \mid s_1+\cdots+s_k-m \in S \mbox{ if }…
We establish relations between representation dimensions of two algebras connected by a Frobenius bimodule or extension. Consequently, upper bounds and equality formulas for representation dimensions of group algebras, symmetric separably…
We obtain sharp upper and lower bounds on a certain four-dimensional Frobenius number determined by a prime pair $(p,q)$, $2<p<q$, including exact formulae for two infinite subclasses of such pairs. Our work is motivated by the study of…
In this paper we present a new approach to construct the set of numerical semigroups with a fixed genus. Our methodology is based on the construction of the set of numerical semigroups with fixed Frobenius number and genus. An equivalence…
We show the existence of many infinite classes of permutations over finite fields and bent functions by extending the notion of linear translators, introduced by Kyureghyan [12]. We call these translators Frobenius translators since the…
We give upper and lower bounds for the largest integer not representable as positive linear combination of three given integers, disproving an upper bound conjectured by Beck, Einstein and Zacks.
A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…
We study the Frobenius problem for certain k-tuplets, which include prime k-tuplets, in particular prime triplets and prime quadruplets. Moreover, we analyze some properties of the numerical semigroups associated with these tuplets.
The common behaviour of many families of numerical semigroups led up to defining, firstly, the Frobenius varieties and, secondly, the (Frobenius) pseudo-varieties. However, some interesting families are still out of these definitions. To…
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…
We generalize the notion of symmetric semigroups, pseudo symmetric semigroups, and row factorization matrices for pseudo Frobenius elements of numerical semigroups to the case of semigroups with maximal projective dimension (MPD…