Related papers: Expected Frobenius numbers

For a non-negative integer $p$, one of the generalized Frobenius numbers, that is called the $p$-Frobenius number, is the largest integer that is represented at most in $p$ ways as a linear combination with nonnegative integer coefficients…

This paper investigates and bounds the expected solution quality of combinatorial optimization problems when feasible solutions are chosen at random. Loose general bounds are discovered, as well as families of combinatorial optimization…

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

In this note we classify two-dimensional continued fractions for cubic irrationalities constructed by matrices with not large norm ($|*| \le 6$). The classification is based on the following new result: the class of matrices with an…

The possibility of variations of the values of fundamental constants is a phenomenon predicted by a number of scenarios beyond General Relativity. This can happen if ``our'' fundamental constants are not the actual constants of the…

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…

The paper deals with a class of periods, Frobenius constants, which describe monodromy of Frobenius solutions of differential equations arising in algebraic geometry. We represent Frobenius constants related to families of elliptic curves…

Let $K$ be a number field and $r$ an integer. Given an elliptic curve $E$, defined over $K$, we consider the problem of counting the number of degree two prime ideals of $K$ with trace of Frobenius equal to $r$. Under certain restrictions…

A Grobner basis-based algorithm for solving the Frobenius Instance Problem is presented, and this leads to an algorithm for solving the Frobenius Problem that can handle numbers with thousands of digits. Connections to irreducible…

We give upper and lower bounds on the Chevalley-Bass number of a field of characteristic zero, whenever this quantity is well-defined. We also describe an algorithm which computes the Chevalley-Bass number of a field, provided its maximal…

We show that the conditions imposed on a second order linear differential equation with rational coefficients on the complex line by requiring it to have regular singularities with fixed exponents at the points of a finite set $P$ and…

We consider two type of upper Hessenberg matrices which determinants are Fibonacci numbers. Calculating sums of principal minors of the fixed order of the first type leads us to convolved Fibonacci numbers. Some identities for these and for…

Using an idea of Doug Lind, we give a lower bound for the Perron-Frobenius degree of a Perron number that is not totally-real. As an application, we prove that there are cubic Perron numbers whose Perron-Frobenius degrees are arbitrary…

For the fractional Brownian motion $B^H$ with the Hurst parameter value $H$ in (0,1/2), we derive new upper and lower bounds for the difference between the expectations of the maximum of $B^H$ over [0,1] and the maximum of $B^H$ over the…

A Frobenius manifold is a manifold with a flat metric and a Frobenius algebra structure on tangent spaces at points of the manifold such that the structure constants of multiplication are given by third derivatives of a potential function…

We study the structure of the family of numerical semigroups with fixed multiplicity and Frobenius number. We give an algorithmic method to compute all the semigroups in this family. As an application we compute the set of all numerical…

We consider the uniqueness of solutions of ordinary differential equations where the coefficients may have singularities. We derive upper bounds on the the order of singularities of the coefficients and provide examples to illustrate the…

This article extends to the vector setting the results of our previous work Kruger et al. (2015) which refined and slightly strengthened the metric space version of the Borwein-Preiss variational principle due to Li and Shi, J. Math. Anal.…

Given $N$ positive integers $a_1, ..., a_N$ with $\gcd(a_1, ..., a_N)=1$, let $f_N$ denote the largest natural number which is not a positive integer combination of $a_1, ..., a_N$. This paper gives an optimal lower bound for $f_N$ in terms…

The poset of permutations of [n] under Bruhat ordering is studied. We give nontrivial upper and lower bounds for the number of comparable pairs of permutations in both the weak and strong versions of this order. In light of numerical…