Related papers: Computing Hilbert class polynomials with the Chine…

We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…

Let $H_D(T)$ denote the Hilbert class polynomial of the imaginary quadratic order of discriminant $D$. We study the rate of growth of the greatest common divisor of $H_D(a)$ and $H_D(b)$ as $|D| \to \infty$ for $a$ and $b$ belonging to…

We utilize effective algorithms for computing in the cohomology of a Shimura curve together with the Jacquet-Langlands correspondence to compute systems of Hecke eigenvalues associated to Hilbert modular forms over a totally real field.

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

Let $f \colon \mathcal{M} \to \mathbb{R}$ be a Lipschitz and geodesically convex function defined on a $d$-dimensional Riemannian manifold $\mathcal{M}$. Does there exist a first-order deterministic algorithm which (a) uses at most…

We develop a meta-algorithm that, given a polynomial (in one or more variables), and a prime p, produces a fast (logarithmic time) algorithm that takes a positive integer n and outputs the number of times each residue class modulo p appears…

We design a fast algorithm that computes, for a given linear differential operator with coefficients in $Z[x ]$, all the characteristic polynomials of its p-curvatures, for all primes $p < N$ , in asymptotically quasi-linear bit complexity…

Chinese Remainder Theorem (CRT) has been widely studied with its applications in frequency estimation, phase unwrapping, coding theory and distributed data storage. Since traditional CRT is greatly sensitive to the errors in residues due to…

In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…

Zeilberger's algorithm provides a method to compute recurrence and differential equations from given hypergeometric series representations, and an adaption of Almquist and Zeilberger computes recurrence and differential equations for…

Recently, Ko\c{c} proposed a neat and efficient algorithm for computing \[ x = a^{-1} \pmod {p^k} \] for a prime $p$ based on the exact solution of linear equations using $p$-adic expansions. The algorithm requires only addition and right…

This paper presents reproducing kernel Hilbert spaces method to obtain the numerical solution for partial differential equation constrained optimization problem.

Let R=F[D;sigma,delta] be the ring of Ore polynomials over a field (or skew field) F, where sigma is a automorphism of F and delta is a sigma-derivation. Given a an m by n matrix A over R, we show how to compute the Hermite form H of A and…

We initiate a study of Hilbert modules over the polynomial algebra A=C[z_1,...,z_d] that are obtained by completing A with respect to an inner product having certain natural properties. A standard Hilbert module is a finite multiplicity…

Classifying points in high dimensional spaces is a fundamental geometric problem in machine learning. In this paper, we address classifying points in the $d$-dimensional Hilbert polygonal metric. The Hilbert metric is a generalization of…

We study monic polynomials $Q_n(x)$ generated by a high order three-term recursion $xQ_n(x)=Q_{n+1}(x)+a_{n-p} Q_{n-p}(x)$ with arbitrary $p\geq 1$ and $a_n>0$ for all $n$. The recursion is encoded by a two-diagonal Hessenberg operator $H$.…

Polynomial remainder sequences contain the intermediate results of the Euclidean algorithm when applied to (non-)commutative polynomials. The running time of the algorithm is dependent on the size of the coefficients of the remainders.…

We discuss ordinary differential equations with delay and memory terms in Hilbert spaces. By introducing a time derivative as a normal operator in an appropriate Hilbert space, we develop a new approach to a solution theory covering…

We investigate the analogues, in $\mathbb{F}_q[t]$, of highly composite numbers and the maximum order of the divisor function, as studied by Ramanujan. In particular, we determine a family of highly composite polynomials which is not too…

We show that sampling or interpolation formulas in reproducing kernel Hilbert spaces can be obtained by reproducing kernels whose dual systems form molecules, ensuring that the size profile of a function is fully reflected by the size…