Related papers: On the Frobenius number for three variables
The matrix representation of the set $\Delta({\bf d}^3)$, ${\bf d}^3=(d_1,d_2, d_3)$, of the integers which are unrepresentable by $d_1,d_2,d_3$ is found. The diagrammatic procedure of calculation of the generating function $\Phi({\bf…
In this paper we present the notion of arithmetic variety for numerical semigroups. We study various aspects related to these varieties such as the smallest arithmetic that contains a set of numerical semigroups and we exhibit the root…
We introduce a weighted sum of irreducible character ratios as an estimator for commutator probabilities. The estimator yields Frobenius formula when applied to a regular representation
Given a number field $K$ that is a subfield of the real numbers, we generalize the notion of the classical Frobenius problem to the ring of integers $\mathfrak{O}_K$ of $K$ by describing certain Frobenius semigroups,…
Heath-Brown proved that for a positive proportion of integers $n$, $n^3+2$ has a prime factor larger than $n^{1+c}$ with $c=10^{-303}$. We generalize this result to arbitrary monic irreducible cubic polynomial of $\mathbb{Z}[x]$ with $c$…
Frobenius' Theorem states that the algebra of quaternions $\mathbb H$ is, besides the fields of real and complex numbers, the only finite-dimensional real division algebra. We first give a short elementary proof of this theorem, then…
It is known that the greatest common divisor of two Fibonacci numbers is again a Fibonacci number. It is called the strong divisibility property. However, this property does not hold for every second order sequence. In this paper we study…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…
The pseudo-Frobenius numbers of a numerical semigroup are those gaps of the numerical semigroup that are maximal for the partial order induced by the semigroup. We present a procedure to detect if a given set of integers is the set of…
Two classical rings of invariants are shown to be Frobenius split: for the special linear group acting on the direct sum of several copies of the defining representation and several copies of the dual of the defining representation; and for…
We investigate here the representability of integers as sums of triangular numbers, where the $n$-th triangular number is given by $T_n = n(n + 1)/2$. In particular, we show that $f(x_1,x_2,..., x_k) = b_1 T_{x_1} +...+ b_k T_{x_k}$, for…
The index of codivisibility of a set of integers is the size of its largest subset with a common prime divisor. For large random samples of integers, the index of codivisibility is approximately normal.
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 $a,b$ be positive, relatively prime, integers. We prove, using induction, that for every $d > ab-a-b$ there exist $x,y\in\mathbb{Z}_{\geq 0}$, such that $d=ax+by$. As a byproduct, we obtain a constructive recursive algorithm for…
The main result of the paper shows that the asymptotic growth of the Frobenius number in average is significantly slower than the growth of the maximum Frobenius number.
For a variety $X$ of positive characteristic and a non-negative integer $e$, we define its $e$-th F-blowup to be the universal flattening of the $e$-iterated Frobenius of $X$. Thus we have the sequence (a set labeled by non-negative…
The Markov numbers are the positive integer solutions of the Diophantine equation $x^2 + y^2 + z^2 = 3xyz$. Already in 1880, Markov showed that all these solutions could be generated along a binary tree. So it became quite usual (and…
We describe a method for bounding the set of exceptional integers not represented by a given additive form in terms of the exceptional set corresponding to a subform. Illustrating our ideas with examples stemming from Waring's problem for…
While studying a characteristic number of manifolds we noticed that the calculation was simply computing a multiple of a multinomial coefficient. We were, at the time, interested in computing the greatest common divisor of these…
Let $R$ be a ring of prime characteristic $p$, and let $F^e_* R$ denote $R$ viewed as an $R$-module via the $e$th iterated Frobenius map. Given a surjective map $\phi : F^e_* R \to R$ (for example a Frobenius splitting), we exhibit an…