Related papers: Expected Frobenius numbers

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…

We prove an asymptotic formula for the mean value of Frobenius numbers with three arguments. To prove this we use a new method invented by A. Ustinov, Rodseth's algorithm an bounds for exponential sums.

The notion of Frobenius Betti numbers generalizes the Hilbert-Kunz multiplicity theory and serves as an invariant that measures singularity. However, the explicit computation of the Frobenius Betti numbers of rings has been limited to very…

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

Expanding on recent results of another an algorithm is presented that provides solution to the Frobenius Coin Problem in worst case O(n^2) in the magnitude of the largest denomination.

This paper proposes to establish the distance between partial preference orderings based on two very different approaches. The first approach corresponds to the brute force method based on combinatorics. It generates all possible complete…

For a matrix $A \in Z^{k \times n}$ of rank $k$, the diagonal Frobenius number $F_{\text{diag}}(A)$ is defined as the minimum $t \in Z_{\geq 1}$, such that, for any $b \in \text{span}_{Z}(A)$, the condition \begin{equation*} \exists x \in…

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.

In science, as in life, `surprises' can be adequately appreciated only in the presence of a null model, what we expect a priori. In physics, theories sometimes express the values of dimensionless physical constants as combinations of…

Consider a meromorphic connection on P^1 over a p-adic field. In many cases, such as those arising from Picard-Fuchs equations or Gauss-Manin connections, this connection admits a Frobenius structure defined over a suitable rigid analytic…

We propose an algorithm to numerically determined whether a second-order linear PDE problem satisfying a Garding inequality is well-posed. This algorithm further provides a lower bound to the inf-sup constant of the weak formulation, which…

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…

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

The infinite random size-biased order with arbitrary positive size parameters is introduced in terms of independent exponential random variables. We collect basic properties and constructions of the order, some of which belong to the…

We define a dimension for a triangulated category. We prove a representabilityTheorem for a certain class of functors on finite dimensional triangulatedcategories. We study the dimension of the boundedderived category of an algebra or a…

We apply Frobenius integrability theorem in the search of invariants for one-dimensional Hamiltonian systems with a time-dependent potential. We obtain several classes of potential functions for which Frobenius theorem assures the existence…

In this paper, we give closed form expressions of the Frobenius number for the triple of the $2$-step star numbers $an(n-2) + 1$ for an integer $a \geq 4$. These numbers have been studied from different aspects for some $a$'s. These numbers…

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

This short note provides a new and simple proof of the convergence rate for Peng's law of large numbers under sublinear expectations, which improves the corresponding results in Song [15] and Fang et al. [3].

We consider upper exponential bounds for the probability of the event that an absolute deviation of sample mean from mathematical expectation p is bigger comparing with some ordered level epsilon. These bounds include 2 coefficients {alpha,…