← All problems

Ismail–Kelker problem and Ferreira–Simon conjectures on complete monotonicity and decomposability

This entry tracks Ismail–Kelker problem and Ferreira–Simon conjectures on complete monotonicity and decomposability.

The method replaces some special-function and Lévy-measure checks with elementary density conditions.

Latest development

The paper gives density-level criteria and applies them to beta-prime, generalized inverse Gaussian, and related laws.

Editorial caveat

The results are explicitly partial affirmative solutions.

References

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.