Related papers: The Frobenius problem for generalized repunit nume…
Given $N$ positive integers $a_1, ..., a_N$ with $\gcd(a_1, ..., a_N)=1$, let $f_N$ denote the largest natural number which is not a positive integer combination of $a_1, ..., a_N$. This paper gives an optimal lower bound for $f_N$ in terms…
We present a unified apoach to the study of separable and Frobenius algebras. The crucial observation is thsat both cases are related to the nonlinear equation $R^{12}R^{23}=R^{23}R^{13}=R^{13}R^{12}$, called the FS-equation. Given a…
We introduce a new class of numerical semigroups, which we call the class of {\it acute} semigroups and we prove that they generalize symmetric and pseudo-symmetric numerical semigroups, Arf numerical semigroups and the semigroups generated…
In this paper, we explore affine semigroup versions of the convex geometry theorems of Helly, Tverberg, and Caratheodory. Additionally, we develop a new theory of colored affine semigroups, where the semigroup generators each receive a…
The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…
The classical Frobenius-Schur indicators for finite groups are character sums defined for any representation and any integer m greater or equal to 2. In the familiar case m=2, the Frobenius-Schur indicator partitions the irreducible…
Let $N\geq 1$ be squarefree with $(N,6)=1$. Let $c\phi_N(n)$ denote the number of $N$-colored generalized Frobenius partition of $n$ introduced by Andrews in 1984. We prove $$ c\phi_N(n)= \sum_{d \mid N} N/d \cdot P\left( \frac{ N}{d^2}n -…
This article is partly a survey and partly a research paper. It tackles the use of Groebner bases for addressing problems of numerical semigroups, which is a topic that has been around for some years, but it does it in a systematic way…
In this paper we study the regular semigroups weakly generated by a single element x, that is, with no proper regular subsemigroup containing x. We show there exists a regular semigroup $F_1$ weakly generated by x such that all other…
We consider symmetric (not complete intersection) numerical semigroups S_5, generated by five elements, and derive inequalities for degrees of syzygies of S_5 and find the lower bound F_5 for their Frobenius numbers. We study a special case…
Consider positive integral solutions $x \in \mathbb{Z}^{n+1}$ to the equation $a_0 x_0 + \ldots + a_n x_n = t$. In the so called unbounded subset sum problem, the objective is to decide whether such a solution exists, whereas in the…
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…
The famous linear diophantine problem of Frobenius is the problem to determine the largest integer (Frobenius number) whose number of representations in terms of $a_1,\dots,a_k$ is at most zero, that is not representable. In other words,…
In this work initial numbers and repunit numbers have been studied. All numbers have been considered in a decimal notation. The problem of simplicity of initial numbers has been studied. Interesting properties of numbers repunit are proved:…
A submonoid A of N^d has a natural order defined by a <= a + b for elements a and b of A. The Frobenius complex is the order complex of an open interval of A with respect to this order. In this paper, the homotopy type of the Frobenius…
Let $G$ be a group and $\alpha: G \times G \to G$ denote the commutator map. In the case of finite groups, Frobenius gave the formula to compute the cardinalities of the fibres $\alpha^{-1}(g)$ in terms of the character values $\chi(g)$ for…
The Unbounded Subset Sum (USS) problem is an NP-hard computational problem where the goal is to decide whether there exist non-negative integers $x_1, \ldots, x_n$ such that $x_1 a_1 + \ldots + x_n a_n = b$, where $a_1 < \cdots < a_n < b$…
We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…
The main aim of this work is to introduce and justify the study of semi-covarities. A {\it semi-covariety} is a non-empty family $\mathcal{F}$ of numerical semigroups such that it is closed under finite intersections, has a minimum,…
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.…