Optimal pricing for a heterogeneous portfolio for a given risk factor and convex distance measure

Consider a portfolio containing heterogeneous risks. The premiums of the policyholders might not cover the amount of the payments which an insurance company pays the policyholders. When setting the premium, this risk has to be taken into consideration. On the other hand the premium that the insured pays has to be fair. This fairness is measured by a function of the difference between the risk and the premium paid—we call this function a distance function. For a given small probability of insolvency, we find the premium for each class, such that the distance function is minimized. Next we formulate and solve the dual problem, which is minimizing the insolvency probability under the constraint that the distance function does not exceed a given level. This paper generalizes a previous paper [Zaks, Y., Frostig, E., Levikson, B., 2006. Optimal pricing of a heterogeneous portfolio for a given risk level. Astin Bull. 36 (1), 161–185] where only a square distance function was considered.     

On the products of cross-ratios on diagonals of polygons

The purpose of this paper is to establish a conjecture of B. Grünbaum, which states that in every n-polygon P in the plane, n 5, some diagonals intersect in a pattern that defines a new n-polygon (P), such that the product of the cross-rations on the diagonals of P is equal to the product of the corresponding cross-ratios on the diagonals of (P).     

A new algorithm for generation of permutations

A new algorithm for generating permutations is presented, that generates the next permutation by reversing a certain suffix of its predecessor. The average size of this suffix is less thane 2.8. It is shown how to find the position of a given permutation and how to construct the permutation of a given position, where the position refers to the order in which the permutations are generated, and is also new.On leave from the Department of Computer Science, Technion, Haifa, Israel. This work was supported by NSF grant MCS-8302391.     

Dedekind subrings ofk[x 1,…,x n ] are rings of polynomials

The purpose of this note is to prove that a Dedekind domain R which contains a field k, and which is a subring ofk[x ₁,…,x _n ] is a ring of polynomials. This generalizes similar results of A. Evyatar and A. Zaks on principal ideal domains, and of P. M. Cohn for the casen=1. Our methods and proofs differ from those introduced previously. This research was partially supported by the National Science Foundation, Grant GP-23861.     

Some rings are hereditary rings

LetR be a bounded Noetherian Prime ring. The Asano-Michler theorem shows thatR is a bounded Dedekind ring if every prime ideal ofR is invertible. We provide a simple proof of the Asano-Michler theorem, and we suggest some possible generalizations. We also prove that if the proper residue rings ofR areQF-rings thenR is a bounded Dedekind ring, and generalize this result toLD-rings.     

Deficient generalized Fibonacci maximum path graphs

The structure of an acyclic directed graph with n vertices and m edges, maximizing the number of distinct paths between two given vertices, is studied. In previous work it was shown that there exists such a graph containing a Hamiltonian path joining the two given vertices, thus uniquely ordering the vertices. It was further shown that such a graph contains k ? 1 full levels (an edge (i, j) belongs to level t = j ?i) and some edges of level k—a deficient k-generalized Fibonacci graph. We investigate the distribution of the edges in level 3 in a deficient 3-generalized Fibonacci graph, and develop tools that might be useful in extending the results to higher levels.     

Electrochemical and chemical reduction of β,γ-unsaturated δ-cyclosulfonates

Conclusions The electroreduction of sultones in DMF results in the predominant cleavage of the C-O bond with the formation of the salt of the unsaturated sulfonic acid; catalytic hydrogenation also proceeds by the same scheme.Deceased.Translated from Izvestiya Akademii Nauk SSSR, Seriya Khimicheskaya, No. 11, pp. 2618–2620, November, 1978.