We present and analyze two algorithms for computing the Hilbert class polynomial HD. The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < ...
In previous work, the first author developed an algorithm for the computation of Hilbert modular forms. In this paper, we extend this to all totally real number fields of even degr...
The Problem Frames approach defines identifiable problem classes based on, among other things, their context and the characteristics of their domains, interfaces and requirements,...
Ellen Souza, Maria Lencastre, Renata Cristina Fara...
We extend methods of Greenberg and the author to compute in the cohomology of a Shimura curve defined over a totally real field with arbitrary class number. Via the Jacquet-Langlan...
The task of eliciting all probabilities required for a Bayesian network can be supported by first acquiring qualitative constraints on the numerical quantities to be obtained. Buil...