Related papers: Class polynomials for nonholomorphic modular funct…

We describe the support of $F$-finite $F$-modules over polynomial rings $R$ of prime characteristic. Our description yields an algorithm to compute the support of such modules; the complexity of our algorithm is also analyzed. To the best…

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…

We present a new class of polynomial-time algorithms for submodular function minimization (SFM), as well as a unified framework to obtain strongly polynomial SFM algorithms. Our algorithms are based on simple iterative methods for the…

Let g >= 1 and let Q be a monic, squarefree polynomial of degree 2g + 1 in Z[x]. For an odd prime p not dividing the discriminant of Q, let Z_p(T) denote the zeta function of the hyperelliptic curve of genus g over the finite field F_p…

The holonomic gradient method gives an algorithm to efficiently and accurately evaluate normalizing constants and their derivatives. We apply the holonomic gradient method in the case of the conditional Poisson or multinomial distribution…

Meromorphic solutions of non-linear differential equations of the form $f^n+P(z,f)=h$ are investigated, where $n\geq 2$ is an integer, $h$ is a meromorphic function, and $P(z,f)$ is differential polynomial in $f$ and its derivatives with…

This introductory paper studies a class of real analytic functions on the upper half plane satisfying a certain modular transformation property. They are not eigenfunctions of the Laplacian and are quite distinct from Maass forms. These…

Let $f, f_1, \ldots, f_\nV$ be polynomials with rational coefficients in the indeterminates $\bfX=X_1, \ldots, X_n$ of maximum degree $D$ and $V$ be the set of common complex solutions of $\F=(f_1,\ldots, f_\nV)$. We give an algorithm…

The polymer model framework is a classical tool from statistical mechanics that has recently been used to obtain approximation algorithms for spin systems on classes of bounded-degree graphs; examples include the ferromagnetic Potts model…

Solving and visualizing the potential roots of complex functions is essential in both theoretical and applied domains, yet often computationally intensive. We present a hardware-accelerated algorithm for complex function roots density graph…

We classify the three-dimensional representations of the modular group that are reducible but indecomposable, and their associated spaces of holomorphic vector-valued modular forms. We then demonstrate how such representations may be…

We present a new algorithm for the computation of the irreducible factors of degree at most $d$, with multiplicity, of multivariate lacunary polynomials over fields of characteristic zero. The algorithm reduces this computation to the…

In continuation to our recent work on noncommutative polynomial factorization, we consider the factorization problem for matrices of polynomials and show the following results. (1) Given as input a full rank $d\times d$ matrix $M$ whose…

We survey our recently proposed method for constructing biholomorphic invariants of quasihomogeneous isolated hypersurface singularities and, more generally, invariants of graded Artinian Gorenstein algebras. The method utilizes certain…

Path integral-based simulation methodologies play a crucial role for the investigation of nuclear quantum effects by means of computer simulations. However, these techniques are significantly more demanding than corresponding classical…

Let $\mathbb{K}$ be a field of characteristic zero and $\mathbb{K}[x_1, \dots, x_n]$ the corresponding multivariate polynomial ring. Given a sequence of $s$ polynomials $\mathbf{f} = (f_1, \dots, f_s)$ and a polynomial $\phi$, all in…

In this paper we study a class of dynamical systems generated by iterations of multivariate polynomials and estimate the degreegrowth of these iterations. We use these estimates to bound exponential sums along the orbits of these dynamical…

The classical persistence algorithm computes the unique decomposition of a persistence module implicitly given by an input simplicial filtration. Based on matrix reduction, this algorithm is a cornerstone of the emergent area of topological…

Discrete Hahn polynomials (DHPs) and their moments are considered to be one of the efficient orthogonal moments and they are applied in various scientific areas such as image processing and feature extraction. Commonly, DHPs are used as…

Common time-explicit numerical methods for kinetic simulations of plasmas in the low-collisions limit fall into two classes of algorithms: momentum conserving and energy conserving. Each has certain drawbacks. The PIC algorithm does not…