Related papers: Adleman-Manders-Miller Root Extraction Method Revi…
A novel permutation decoding method for Reed-Muller codes is presented. The complexity and the error correction performance of the suggested permutation decoding approach are similar to that of the recursive lists decoder. It is…
The root finding step of the Guruswami-Rudra list decoding algorithm for folded Reed-Solomon codes is considered. It is shown that a multivariate generalization of the Roth-Ruckenstein algorithm can be used to implement it. This leads to an…
A large class of MDS linear codes is constructed. These codes are endowed with an efficient decoding algorithm. Both the definition of the codes and the design of their decoding algorithm only require from Linear Algebra methods, making…
We introduce a new version of arithmetic in all finite types which extends the usual versions with primitive notions of extensionality and extensional equality. This new hybrid version allows us to formulate a strong form of extensionality,…
In recursive state estimation, numerical error can play a major role in an algorithm's overall performance and reliability. Roundoff errors due to finite precision arithmetic can violate theoretical guarantees, leading to asymmetric and…
Initiated by a result of Gorin and Marcus [Int. Math. Res. Not., (3):883--913, 2020] and an observation of Steinerberger [Proc. Amer. Math. Soc., 147(11):4733--4744, 2019], there has been a recent growing body of literature connecting…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
Solving of regular equations via Arden's Lemma is folklore knowledge. We first give a concise algorithmic specification of all elementary solving steps. We then discuss a computational interpretation of solving in terms of coercions that…
This paper describes a geometrical method for finding the roots $r_1$, $r_2$ of a quadratic equation in one complex variable of the form $x^2+c_1 x+c_2=0$, by means of a Line $L$ and a Circumference $C$ in the complex plane, constructed…
This article provides a simple trigonometric method for determining how many roots of a quartic equation are real and how many are complex, without solving the equation. The approach replaces the quartic's classical discriminant -- a…
We give an algorithm for computing all roots of polynomials over a univariate power series ring over an exact field $\mathbb{K}$. More precisely, given a precision $d$, and a polynomial $Q$ whose coefficients are power series in $x$, the…
Discovering "good" algorithms for an operation is often considered an art best left to experts. What if there is a simple methodology, an algorithm, for systematically deriving a family of algorithms as well as their cost analyses, so that…
In the paper, we introduce $q$-deformations of the Riemann zeta function, extend them to the whole complex plane, and establish certain estimates of the number of roots. The construction is based on the recent difference generalization of…
In [E. S. Gawlik, Zolotarev iterations for the matrix square root, arXiv preprint 1804.11000, (2018)], a family of iterations for computing the matrix square root was constructed by exploiting a recursion obeyed by Zolotarev's rational…
Multivariate multiplicity codes (Kopparty, Saraf, and Yekhanin, J. ACM 2014) are linear codes where the codewords are described by evaluations of multivariate polynomials (with a degree bound) and their derivatives up to a fixed order, on a…
To obtain the Dirichlet series for complex powers of the Riemann zeta function, we define and study the basic properties of a sequence of polynomials that, used as coefficients of the respective terms of the Dirichlet series of the Riemann…
Let $K$ be a complete non-archimedean field with a discrete valuation, $f\in K[X]$ a polynomial with non-vanishing discriminant, $A$ the valuation ring of $K$, and $\M$ the maximal ideal of $A$. The first main result of this paper is a…
Determination of polymer molecular weight distribution (MWD) from rheological measurements is desirable due to the ease and low cost of rheometry compared to other methods such as gel permeation chromatography. However, relating MWD to…
This paper presents new six solutions for sixth degree polynomial equation in general forms basing on new theorems, where the possibility to calculate the six roots of any sixth degree equation nearly simultaneously. The proposed roots for…
Simple unsmoothed formulas to compute the Riemann zeta function, and Dirichlet $L$-functions to a power-full modulus, are derived by elementary means (Taylor expansions and the geometric series). The formulas enable square-root of the…