We can similarly define kmin . It is easily seen that the problem of finding kmin
is equivalent to finding a shortest cycle in a digraph and is therefore polynomially
solvable [19]. In Example 1, we have kmin = 2 and kmax = 3.
As usual a real sequence g0, g1 , . . . is called convex [concave] if
gr-1 + gr+1 ≥ 2gr
[gr-1 + gr+1 ≤ 2gr]
for all r = 1, 2, ....
One class of solvable cases of the JRP is related to the fact that δk (A) for
k = 1, 2, . . . , n are the coefficients of the characteristic polynomial of A in max-
More intriguing information
1. Rent Dissipation in Chartered Recreational Fishing: Inside the Black Box2. Evidence on the Determinants of Foreign Direct Investment: The Case of Three European Regions
3. Economies of Size for Conventional Tillage and No-till Wheat Production
4. Examining the Regional Aspect of Foreign Direct Investment to Developing Countries
5. The name is absent
6. THE UNCERTAIN FUTURE OF THE MEXICAN MARKET FOR U.S. COTTON: IMPACT OF THE ELIMINATION OF TEXTILE AND CLOTHING QUOTAS
7. The name is absent
8. The name is absent
9. WP RR 17 - Industrial relations in the transport sector in the Netherlands
10. The name is absent