Related papers: Division and Slope Factorization of p-Adic Polynom…
In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single…
It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…
We present new results on Boolean matrix factorization and a new algorithm based on these results. The results emphasize the significance of factorizations that provide from-below approximations of the input matrix. While the previously…
Interval-valued computing is a relatively new computing paradigm. It uses finitely many interval segments over the unit interval in a computation as data structure. The satisfiability of Quantified Boolean formulae and other hard problems,…
We construct new algorithms from scratch, which use the fourth order cumulant of stochastic variables for the cost function. The multiplicative updating rule here constructed is natural from the homogeneous nature of the Lie group and has…
The aim of this note is to give some factorization formulas for different versions of the Macdonald polynomials when the parameter t is specialized at roots of unity, generalizing those existing for Hall-Littlewood functions.
Polynomial factoring has famous practical algorithms over fields-- finite, rational \& $p$-adic. However, modulo prime powers it gets hard as there is non-unique factorization and a combinatorial blowup ensues. For example, $x^2+p \bmod…
This paper derives numerical bounds for and implements the splitting circle method for finding roots of a univariate polynomial in the presence of fixed precision.
Newton's method is used to approximate roots of complex valued functions f by creating a sequence of points that converges to a root of f in the usual topology. For any field K equipped with a set of pairwise inequivalent absolute values…
We present and analyze two algorithms for computing the Hilbert class polynomial $H_D$ . The first is a p-adic lifting algorithm for inert primes p in the order of discriminant D < 0. The second is an improved Chinese remainder algorithm…
We consider the problem of discretizing one-dimensional, real-valued functions as graphs. The goal is to find a small set of points, from which we can approximate the remaining function values. The method for approximating the unknown…
An algorithm for computing eigenvalues and eigenfunctions of the angular spheroidal wave equation, based on a known but scarcely used method, is developed. By requiring the regularity of the wave function, represented by its series…
In this paper, the Newton-Anderson method, which results from applying an extrapolation technique known as Anderson acceleration to Newton's method, is shown both analytically and numerically to provide superlinear convergence to non-simple…
In this article, we investigate the $p$-adic valuation $\nu_p$ of quantities such as the factorial $n!$, the hyperfactorial $H(n)$ or the superfactorial $\mathrm{sf}(n)$. In particular, we obtain simple bounds (both upper and lower) for…
In this paper we study a new approach in optimization that aims to search a large domain D where a given function takes large, small or specific values via an iterative optimization algorithm based on the gradient. We show that the…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
Factorial clustering methods have been developed in recent years thanks to the improving of computational power. These methods perform a linear transformation of data and a clustering on transformed data optimizing a common criterion.…
The problem is to evaluate a polynomial in several variables and its gradient at a power series truncated to some finite degree with multiple double precision arithmetic. To compensate for the cost overhead of multiple double precision and…
In this paper, an explanation of the Newton-Peiseux algorithm is given. This explanation is supplemented with well-worked and explained examples of how to use the algorithm to find fractional power series expansions for all branches of a…
Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…