Related papers: Computing Hilbert class polynomials with the Chine…

We propose a splitting algorithm for solving a system of composite monotone inclusions formulated in the form of the extended set of solutions in real Hilbert spaces. The resluting algorithm is a an extension of the algorithm in [4]. The…

In 1984, H. W. Lenstra described an algorithm finding divisors of $N$ congruent to $r \mod S$. When $S^3 > N$, this algorithm runs in polynomial time and hence factors $N$ in time $N^{1/3+o(1)}$. Lenstra's algorithm relies on a sign change…

Given a fat point scheme $\mathbb{W}=m_1P_1+\cdots+m_sP_s$ in the projective $n$-space $\mathbb{P}^n$ over a field $K$ of characteristic zero, the modules of K\"ahler differential $k$-forms of its homogeneous coordinate ring contain useful…

Given a reduced effective divisor D on a smooth variety X, we describe the generating function for the classes of the Hodge ideals of D in the Grothendieck group of coherent sheaves on X in terms of the motivic Chern class of the complement…

We prove, without recourse to the Extended Riemann Hypothesis, that the projection modulo $p$ of any prefixed polynomial with integer coefficients can be completely factored in deterministic polynomial time if $p-1$ has a $(\ln…

In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…

Let $s,t$ be natural numbers, and fix an $s$-core partition $\sigma$ and a $t$-core partition $\tau$. Put $d=\gcd(s,t)$ and $m= lcm(s,t)$, and write $N_{\sigma, \tau}(k)$ for the number of $m$-core partitions of length no greater than $k$…

In this paper, some issues concerning the Chinese remaindering representation are discussed. Some new converting methods, including an efficient probabilistic algorithm based on a recent result of von zur Gathen and Shparlinski…

In this paper we describe various applications of the Riemann-Hilbert method to the theory of orthogonal polynomials on the line and on the circle.

For the bi-orthogonal polynomials with the third degree polynomial potential functions, the 3 x 3 matrix Riemann-Hilbert problem is explicitly constructed. The developed approach admits an extension to the bi-orthogonal polynomials with…

We continue the study of counting complexity begun in [Buergisser, Cucker 04] and [Buergisser, Cucker, Lotz 05] by proving upper and lower bounds on the complexity of computing the Hilbert polynomial of a homogeneous ideal. We show that the…

Polynome codes and code evaluation; arithmetical theory frames; $\mu$-recursive race for decision; decision correctness; decision termination; correct termination in theory $T = PR$ of Primitive Recursion; comparison with the negative…

In this paper, we present an improvement for the problem of deterministically finding an element of large multiplicative order modulo some integer $N$. This problem arises as a key subroutine in current deterministic factoring algorithms,…

We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…

Let X be a complex manifold. The classical Riemann-Hilbert correspondence associates to a regular holonomic system M the C-constructible complex of its holomorphic solutions. Denote by t the affine coordinate in the complex projective line.…

If $R=k[x_1,\ldots,x_n]/I$ is a graded artinian algebra, then the length of $k[x_1,\ldots,x_n]/I^s$ becomes a polynomial in $s$ of degree $n$ for large $s$. If we write this polynomial as $\sum_{i=0}^n(-1)^ie_i{s+n-i-1\choose n-i}$, then…

We exhibit a probabilistic algorithm which solves a polynomial system over the rationals defined by a reduced regular sequence. Its bit complexity is roughly quadratic in the B\'ezout number of the system and linear in its bit size. Our…

We compute the minimal polynomials of the Ramanujan values $t_n$, where $n\equiv 11 \mod 24$, using Shimura reciprocity law. These polynomials can be used for defining the Hilbert class field of the imaginary quadratic field…

The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…

Polynomial multiplication is a fundamental problem in symbolic computation. There are efficient methods for the multiplication of two univariate polynomials. However, there is rarely efficiently nontrivial method for the multiplication of…