Related papers: A quasi-linear time algorithm for computing modula…
Quasi-Newton methods refer to a class of algorithms at the interface between first and second order methods. They aim to progress as substantially as second order methods per iteration, while maintaining the computational complexity of…
We consider resultant-based methods for elimination of indeterminates of Ore polynomial systems in Ore algebra. We start with defining the concept of resultant for bivariate Ore polynomials then compute it by the Dieudonne determinant of…
In this paper, we introduce an algorithm that provides approximate solutions to semi-linear ordinary differential equations with highly oscillatory solutions, which, after an appropriate change of variables, can be rewritten as…
The Postnikov character formula is used to express large portions of a Dirichlet character sum in terms of quadratic exponential sums. The quadratic sums are then computed using an analytic algorithm previously derived by the author. This…
We consider the classical problems of interpolating a polynomial given a black box for evaluation, and of multiplying two polynomials, in the setting where the bit-lengths of the coefficients may vary widely, so-called unbalanced…
Let $f$ be a fixed (holomorphic or Maass) modular cusp form. Let $\cq$ be a Dirichlet character mod $q$. We describe a fast algorithm that computes the value $L(1/2,f\times\chi_q)$ up to any specified precision. In the case when $q$ is…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
An algorithm to obtain equations between theta functions with integral characteristics evaluated at $\tau$ and $p\tau$ for $g>1$ is presented.
We introduce two efficient algorithms for computing the partial Fourier transforms in one and two dimensions. Our study is motivated by the wave extrapolation procedure in reflection seismology. In both algorithms, the main idea is to…
In the recent breakthrough paper by Barbulescu, Gaudry, Joux and Thom{\'e}, a quasi-polynomial time algorithm (QPA) is proposed for the discrete logarithm problem over finite fields of small characteristic. The time complexity analysis of…
The Tutte polynomial is a classical invariant, important in combinatorics and statistical mechanics. An essential feature of the Tutte polynomial is the duality for planar graphs G, $T_G(X,Y)\; =\; {T}_{G^*}(Y,X)$ where $G^*$ denotes the…
We study the moments of $L$-functions associated with primitive cusp forms, in the weight aspect. In particular, we obtain an asymptotic formula for the twisted moments of a \textit{long} Dirichlet polynomial with modular coefficients. This…
We present an algorithm for efficient computation of the constant term of a power of a multivariate Laurent polynomial. The algorithm is based on univariate interpolation, does not require the storage of intermediate data and can be easily…
In this paper we suggest a moment matching method for quadratic-bilinear dynamical systems. Most system-theoretic reduction methods for nonlinear systems rely on multivariate frequency representations. Our approach instead uses univariate…
We construct new invariant polynomial for long virtual knots. It is a generalization of Alexander polynomial. We designate it by $\zeta$ meaning an analogy with $\zeta$-polynomial for virtual links. A degree of $\zeta$-polynomial estimates…
This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where…
Evaluating a polynomial on a set of points is a fundamental task in computer algebra. In this work, we revisit a particular variant called trimmed multipoint evaluation: given an $n$-variate polynomial with bounded individual degree $d$ and…
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the…
We propose new linear combinations of compositions of a basic second-order scheme with appropriately chosen coefficients to construct higher order numerical integrators for differential equations. They can be considered as a generalization…
We consider a second order linear evolution equation with a dissipative term multiplied by a time-dependent coefficient. Our aim is to design the coefficient in such a way that all solutions decay in time as fast as possible. We discover…