Related papers: Limiting Distribution of Frobenius Numbers for $n=…

Let $N_n=\{1,2,...,n\}$. Elements are drawn from the set $N_n$ with replacement, assuming that each element has probability $1/n$ of being drawn. We determine the limiting distributions for the waiting time until the given portion of pairs…

In this article we prove a general theorem which establishes the existence of limiting distributions for a wide class of error terms from prime number theory. As a corollary to our main theorem, we deduce previous results of Wintner (1935),…

We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.

In a previous article, we obtained data on the distribution of traces of Frobenius of non-hyperelliptic genus $3$ curves over small finite fields. In the present one, we give a heuristic explanation of these data, by extrapolating from…

The Frobenius number g(a) of an integer vector a with positive coprime coefficients is defined as the largest integer that does not have a representation as a non-negative integer linear combination of the coefficients of a. According to a…

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…

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,…

We consider very general "random integers" and (attempt to) prove that many multiplicative and additive functions of such integers have limiting distributions. These integers include, for instance, the curvatures of Apollonian circle…

Given a Galois extension $L/K$ of number fields, we describe fine distribution properties of Frobenius elements via invariants from representations of finite Galois groups and ramification theory. We exhibit explicit families of extensions…

We compute the Frobenius number for sequences of triangular and tetrahedral numbers. In addition, we study some properties of the numerical semigroups associated to those sequences.

In this paper we study the (classical) Frobenius problem, namely the problem of finding the largest integer that cannot be represented as a nonnegative integral combination of given relatively prime (strictly) positive integers (known as…

Let $E$ be a nonsingular elliptic curve over the rational numbers, and let $\tau^n=p^n+1-\#E(\mathbb{F}_{p^n})$. A result in the current literature claims that the normalized traces of Frobenius…

We consider a generalization of the Frobenius Problem where the object of interest is the greatest integer which has exactly $j$ representations by a collection of positive relatively prime integers. We prove an analogue of a theorem of…

Let $N \geq2$ and let $1 < a_1 < ... < a_N$ be relatively prime integers. Frobenius number of this $N$-tuple is defined to be the largest positive integer that cannot be expressed as $\sum_{i=1}^N a_i x_i$ where $x_1,...,x_N$ are…

With suitable order of limits, as p, m, and n all tend to infinity, the distribution of the normalized trace of Frobenius on H^1 of a "random" plane curve of degree n over the field with p^m elements, tends to a Gaussian distribution. 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…

The Frobenius number $F(\ba)$ of a lattice point $\ba$ in $\R^d$ with positive coprime coordinates, is the largest integer which can $not$ be expressed as a non-negative integer linear combination of the coordinates of $\ba$. Marklof in…

We produce new upper and lower bounds for the s-Frobenius number by relating it to the so called s-covering radius of a certain convex body with respect to a certain lattice; this generalizes a well-known theorem of R. Kannan for the…

Let $A$ be a finite subset of $\mathbb{Z}^n$, which generates $\mathbb{Z}^n$ additively. We provide a precise description of the $N$-fold sumsets $NA$ for $N$ sufficiently large, with some explicit bounds on "sufficiently large."

We give a gentle introduction to Frobenius splittings. Then we recall a few results that have been obtained with the method.