Related papers: Computing Hilbert class polynomials with the Chine…

As is well-known, the advantage of the high-order compact difference scheme (H-OCD) is unconditionally stable and convergent with the order $O(\tau^2+h^4)$ under the maximum norm. In this article, a new numerical gradient scheme based on…

The Hilbert function of a module over a positively graded algebra is of quasi-polynomial type (Hilbert--Serre). We derive an upper bound for its grade, i.e. the index from which on its coefficients are constant. As an application, we give a…

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

In this work we show how to get advantage from the Riemann--Hilbert analysis in order to obtain information about the matrix orthogonal polynomials and functions of second kind associated with a weight matrix. We deduce properties for the…

We give a deterministic algorithm that, given a composite number $N$ and a target order $D \ge N^{1/6}$, runs in time $D^{1/2+o(1)}$ and finds either an element $a \in \mathbb{Z}_N^*$ of multiplicative order at least $D$, or a nontrivial…

Presented here is a matrix inversion method utilizing quantum searching algorithm. In this method, huge Hilbert space as a whole spanned by myriad of eigen states is searched and evaluated efficiently by sequential reduction in dimension…

This paper explores the ability of the Chinese Remainder Theorem formalism to model Montgomery-type algorithms. A derivation of CRT based on Qin's Identity gives Montgomery reduction algorithm immediately. This establishes a unified…

We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit $C$ acting on $n$ qubits, and any bit string $x\in\{0,1\}^n$, can compute the quantity $|< x |C|0^{\otimes n}>|^2$ to within any…

Let $C$ be a smooth plane quartic curve over $\mathbb{Q}$. Costa, Harvey and Sutherland provide an algorithm with an implementation, improving Harvey's average polynomial-time algorithm, to compute the $\bmod \ p$ reduction of the numerator…

We discuss theoretical and algorithmic questions related to the $p$-curvature of differential operators in characteristic $p$. Given such an operator $L$, and denoting by $\Chi(L)$ the characteristic polynomial of its $p$-curvature, we…

We present a new algorithm for computing a $\mu$-basis of the syzygy module of $n$ polynomials in one variable over an arbitrary field $\mathbb{K}$. The algorithm is conceptually different from the previously-developed algorithms by Cox,…

Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…

We investigate H\"ormander spectral multiplier theorems as they hold on $X = L^p(\Omega),\: 1 < p < \infty,$ for many self-adjoint elliptic differential operators $A$ including the standard Laplacian on $\R^d.$ A strengthened matricial…

In the classical setting, the modular equation of level $N$ for the modular curve $X_0(1)$ is the polynomial relation satisfied by $j(\tau)$ and $j(N\tau)$, where $j(\tau)$ is the standard elliptic $j$-function. In this paper, we will…

Effective Hamiltonians are usually constructed by using canonical transformations or projection techniques. In contrast to this, we present a method for systems with arbitrary Hilbert space based on the introduction of cumulants. Cumulants…

We study the polynomial representation of the rational Cherednik algebra of type $A_{n-1}$ with generic parameter in characteristic $p$ for $p \mid n$. We give explicit formulas for generators for the maximal proper graded submodule, show…

This note presents absolute bounds on the size of the coefficients of the characteristic and minimal polynomials depending on the size of the coefficients of the associated matrix. Moreover, we present algorithms to compute more precise…

As society becomes more reliant on computers, cryptographic security becomes increasingly important. Current encryption schemes include the ElGamal signature scheme, which depends on the complexity of the discrete logarithm problem. It is…

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 degree and nontrivial class group. Using the algorithm over…

We provide an algorithm for computing the Euler characteristic of the curves $S_p$ in the space of cubic polynomials, consisting of all polynomials with a periodic critical point of period $p$. The curves were introduced in [Milnor,…