Related papers: Frobenius Problem for Semigroups ${\sl S}(d_1,d_2,…
This expository article presents a unified ring theoretic approach, based on the theory of Frobenius algebras, to a variety of results on Hopf algebras. These include a theorem of S. Zhu on the degrees of irreducible representations, the…
We introduce a module-theoretic approach and a linear-programming method to compute the matricial dimension of numerical semigroups. We use these to compute the matricial dimension of every numerical semigroup with Frobenius number at most…
In this work we give an explicit solution to the problem of differentiation of hyperelliptic functions in genus $3$ case. It is a genus $3$ analogue of the result of F. G. Frobenius and L. Stickelberger. Our method is based on the series of…
For a subgroup $H$ of a finite group $G$, the Frobenius graph $\Gamma(G, H)$ records the constituents of the restrictions to $H$ of the irreducible characters of $G$. We investigate when this graph has diameter 3.
A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…
In this work we present a new class of numerical semigroups called GSI-semigroups. We see the relations between them and others families of semigroups and we give explicitly their set of gaps. Moreover, an algorithm to obtain all the…
In this paper we investigate the following general problem. Let $G$ be a group and let $i(G)$ be a property of $G$. Is there an integer $d$ such that $G$ contains a $d$-generated subgroup $H$ with $i(H)=i(G)$? Here we consider the case…
Let $G$ be a finite group, $\pi$ be a set of primes, and define $H_{\pi}(G)$ to be the subgroup generated by all elements of $G$ which do not have prime order for every prime in $\pi$. In this paper, we investigate some basic properties of…
For $p>0$ a small parameter, let $\mathcal A \subseteq \mathbb{Z}_{>0}$ be a random subset where each positive integer is included independently with probability $p$. We show that, with high probability (as $p \to 0$), the numerical…
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.
Using parafermionic field theoretical methods, the fundamentals of 2d fractional supersymmetry ${\bf Q}^{K} =P$ are set up. Known difficulties induced by methods based on the $U_{q}(sl(2))$ quantum group representations and non commutative…
We examine the subgroup $D(G)$ of a transitive permutation group $G$ which is generated by the derangements in $G$. Our main results bound the index of this subgroup: we conjecture that, if $G$ has degree $n$ and is not a Frobenius group,…
Let $\F_q[x]$ be the ring of polynomials over the finite field $\F_q$, and let $f$ be a polynomial of $\F_q[x]$. Let $R=\frac{\F_q[x]}{(f)}$ be a quotient ring of $\F_q[x]$ with $0\neq R\neq \F_q[x]$. Let $\mathcal{S}_R$ be the…
The algebraic form of Hilbert's 13th Problem asks for the resolvent degree $\text{rd}(n)$ of the general polynomial $f(x) = x^n + a_1 x^{n-1} + \ldots + a_n$ of degree $n$, where $a_1, \ldots, a_n$ are independent variables. The resolvent…
A linearized function field $F$ can be viewed as a Galois extension of a rational function field $K(x)$. For a totally ramified place $Q$ of degree one in $F/K(x)$, we give a unified description of the set $G(Q)$ of gaps at $Q$. As a…
Delorme suggested that the set of all complete intersection numerical semigroups can be computed recursively. We have implemented this algorithm, and particularized it to several subfamilies of this class of numerical semigroups: free and…
The Frobenius number F(a) of an integer vector a with positive coprime coefficients is defined as the largest number that does not have a representation as a positive integer linear combination of the coefficients of a. We show that if a is…
In this paper we study the Hilbert function HR of one-dimensional semigroup rings R = k[[S]]. For some classes of semigroups, by means of the notion of support of the elements in S, we give conditions on the generators of S in order to have…
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…
We construct groups in which FV^3(n) != \delta^2(n). This construction also leads to groups G_k, k >= 3 for which \delta^{k}(n) is not subrecursive.