Related papers: The Square Frobenius Number

In this article, we study the quotients of numerical semigroups, generated by two coprime positive numbers, named (a,b) over d. We give formulae for the usual invariants of these semigroups, expressed in terms of continued fraction…

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…

For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $\rho_{2k}(n) \asymp n^{k-1}$. Deligne's bound on the…

We prove that when $q$ is a power of $2$, every complex irreducible representation of $\mathrm{Sp}(2n, \mathbb{F}_q)$ may be defined over the real numbers, that is, all Frobenius-Schur indicators are 1. We also obtain a generating function…

Let $S,T$ be two numerical semigroups. We study when $S$ is one half of $T$, with $T$ almost symmetric. If we assume that the type of $T$, $t(T)$, is odd, then for any $S$ there exist infinitely many such $T$ and we prove that $1 \leq t(T)…

Given a numerical semigroup S = <a_0, a_1, a_2,..., a_t> and n in S, we consider the factorization n = c_0 a_0 + c_1 a_1 + ... + c_t a_t where c_i >= 0. Such a factorization is maximal if c_0 + c_1 + ... + c_t is a maximum over all such…

A power is a word of the form $\underbrace{uu...u}_{k \; \text{times}}$, where $u$ is a word and $k$ is a positive integer and a square is a word of the form $uu$. Fraenkel and Simpson conjectured in 1998 that the number of distinct squares…

Let $A$ be a finite set of relatively prime positive integers, and let $S(A)$ be the set of all nonnegative integral linear combinations of elements of $A$. The set $S(A)$ is a semigroup that contains all sufficiently large integers. The…

We generalize and prove a hypothesis by V. Arnold on the parity of Frobenius number. For the case of symmetric semigroups with three generators of Frobenius numbers we found an exact formula, which in a sense is the sum of two Sylvester's…

We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.

This note is an attempt to attack a conjecture of Fraenkel and Simpson stated in 1998 concerning the number of distinct squares in a finite word. By counting the number of (right-)special factors, we give an upper bound of the number of…

Let consider $n$ natural numbers $a\_1 ,\ldots , a\_{n} $. Let $S$ be the numerical semigroup generated by $a\_1 ,\ldots , a\_{n} $. Set $A=K[t^{a\_1}, \ldots , t^{a\_n}]=K[{x\_1}, \ldots , {x\_n}]/I$. The aim of this paper is:…

For an integer $k\geq 2$, let $(F_{n}^{(k)})_{n}$ be the $k-$Fibonacci sequence which starts with $0,\ldots,0,1$ ($k$ terms) and each term afterwards is the sum of the $k$ preceding terms. In this paper, we search for powers of 2 which are…

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.

Suppose that m is a positive integer, not a perfect square. We present a formula solution to the 2-variable Frobenius problem in Z[\sqrt m] of the "first kind" ([3]).

Erdos conjectured that every odd number greater than one can be expressed as the sum of a squarefree number and a power of two. Subsequently, Odlyzko and McCranie provided numerical verification of this conjecture up to $10^7$ and $1.4\cdot…

Let g_j denote the largest integer that is represented exactly j times as a non-negative integer linear combination of { x_1, ... , x_n. We show that for any k > 0, and n = 5, the quantity g_0 - g_k is unbounded. Furthermore, we provide…

In this paper we investigate $K$-multimagic squares of order $N$, these are $N \times N$ magic squares which remain magic after raising each element to the $k$ th power for all $2 \leqslant$ $k \leqslant K$. Given $K \geqslant 2$, we…

Given coprime positive integers $a_1 < ...< a_d$, the Frobenius number $F$ is the largest integer which is not representable as a non-negative integer combination of the $a_i$. Let $g$ denote the number of all non-representable positive…

Let $q$ be a prime with $q \equiv 7 \mod 8$, and let $K=\mathbb{Q}(\sqrt{-q})$. Then $2$ splits in $K$, and we write $\mathfrak{p}$ for either of the primes $K$ above $2$. Let $K_\infty$ be the unique $\mathbb{Z}_2$-extension of $K$…