Related papers: Factoring bivariate polynomials using adjoints
First-order optimization algorithms, often preferred for large problems, require the gradient of the differentiable terms in the objective function. These gradients often involve linear operators and their adjoints, which must be applied…
Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…
Let $f(x)$ be a separable polynomial over a local field. Montes algorithm computes certain approximations to the different irreducible factors of $f(x)$, with strong arithmetic properties. In this paper we develop an algorithm to improve…
The Appell-type polynomial family corresponding to the simplest non-commutative derivative operator turns out to be connected with the Boolean probability theory, the simplest of the three universal non-commutative probability theories (the…
For any additive functor from modules (or, more generally, from an abelian category with enough projectives or injectives), we construct long sequences tying up together the derived functors, the satellites, and the stabilizations of the…
Using factorization homology techniques, we give a simple proof of the action of Kontsevich and Soibelman operad on the pair consisting of Hochschild cohomology and Hochschild homology. The proof obviously extends to higher Hochschild…
We introduce a multivariate generalization of normalized Chebyshev polynomials of the second kind. We prove that these polynomials arise in the context of cluster characters associated to Dynkin quivers of type $\mathbb A$ and…
A formula expressing free cumulants in terms of the Jacobi parameters of the corresponding orthogonal polynomials is derived. It combines Flajolet's theory of continued fractions and Lagrange inversion. For the converse we discuss…
Factorization of polynomials arises in numerous areas in symbolic computation. It is an important capability in many symbolic and algebraic computation. There are two type of factorization of polynomials. One is convention polynomial…
We prove a conjecture of Kontsevich regarding the solutions of rank two recursion relations for non-commutative variables which, in the commutative case, reduce to rank two cluster algebras of affine type. The conjecture states that…
In this paper, we prove that any two birational projective varieties with finite quotient singularities can be realized as two geometric GIT quotients of a non-singular projective variety by a reductive algebraic group. Then, by applying…
We present a geometric proof of Bernstein's second adjointness for a reductive $p$-adic group. Our approach is based on geometry of the wonderful compactification and related varieties. Considering asymptotic behavior of a function on the…
We study the operad of associative algebras equipped with a derivation. We show that it is determined by polynomials in several variables and substitution. Replacing polynomials by rational functions gives an operad which is isomorphic to…
We present an algorithm to compute all factorizations into linear factors of univariate polynomials over the split quaternions, provided such a factorization exists. Failure of the algorithm is equivalent to non-factorizability for which we…
Let $\mu_{q+1}$ denote the set of $(q+1)$-th roots of unity in $\mathbb{F}_{q^2 }$. We construct permutation polynomials over $\mathbb{F}_{q^2}$ by using rational functions of any degree that induce bijections either on $\mu_{q+1}$ or…
We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…
We discuss a fast approximate solution to the associated classical -- classical orthogonal polynomial connection problem. We first show that associated classical orthogonal polynomials are solutions to a fourth-order quadratic eigenvalue…
Consider a sparse polynomial in several variables given explicitly as a sum of non-zero terms with coefficients in an effective field. In this paper, we present several algorithms for factoring such polynomials and related tasks (such as…
The explicit double sum for the associated Laguerre polynomials is derived combinatorially. The moments are described using certain statistics on permutations and permutation tableaux. Another derivation of the double sum is provided using…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…