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. A Bayesian approach to analyze regional elasticities2. The name is absent
3. The Triangular Relationship between the Commission, NRAs and National Courts Revisited
4. Nonparametric cointegration analysis
5. The name is absent
6. STIMULATING COOPERATION AMONG FARMERS IN A POST-SOCIALIST ECONOMY: LESSONS FROM A PUBLIC-PRIVATE MARKETING PARTNERSHIP IN POLAND
7. Investment in Next Generation Networks and the Role of Regulation: A Real Option Approach
8. ISSUES AND PROBLEMS OF IMMEDIATE CONCERN
9. Fiscal Rules, Fiscal Institutions, and Fiscal Performance
10. The name is absent