2 papers
math.ST2019
Convergence rates for ordinal embedding
Jordan S. Ellenberg, Lalit Jain
We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimal…
math.NT2015
Explicit computations of Hida families via overconvergent modular symbols
Evan P. Dummit, Márton Hablicsek, Robert Harron +3
In [Pollack-Stevens 2011], efficient algorithms are given to compute with overconvergent modular symbols. These algorithms then allow for the fast computation of -adic -funct…