Related papers: Computing greatest common divisor of several param…

We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…

For the computation of the generalized singular value decomposition (GSVD) of a large matrix pair $(A,B)$ of full column rank, the GSVD is commonly formulated as two mathematically equivalent generalized eigenvalue problems, so that a…

We show a generalization of Mason's ABC-theorem, with the only conditions that the greatest common divisor has been divided out and no proper subsum of the (possibly multivariate) polynomial sum f_1 + f_2 + ... + f_n = 0 vanishes. As a…

We prove a version of Gauss's Lemma. It recursively constructs polynomials {c_k} for k=0,1,...,m+n, in Z[a_i,A_i,b_j,B_j] for i=0,...,m, and j=0,1,...,n, having degree at most (m+n choose m) in each of the four variable sets, such that…

We give a formula for computing the characteristic polynomial for certain hyperplane arrangements in terms of the number of bipartite graphs of given rank and cardinality.

Computational Galois theory, in particular the problem of computing the Galois group of a given polynomial is a very old problem. Currently, the best algorithmic solution is Stauduhar's method. Computationally, one of the key challenges in…

This paper studies high-dimensional regression with two-way structured data. To estimate the high-dimensional coefficient vector, we propose the generalized matrix decomposition regression (GMDR) to efficiently leverage any auxiliary…

We show the polynomial property of $F$-polynomials for generalized quantum cluster algebras and obtain the associated separation formulas under a mild condition. Along the way, we obtain Gupta's formulas of $F$-polynomials for generalized…

The general position problem in graphs seeks the largest set of vertices such that no three vertices lie on a common geodesic. Its counting refinement, the general position polynomial $\psi(G)$, asks for all such possible sets. In this…

An algorithm is developed to compute the complete CS decomposition (CSD) of a partitioned unitary matrix. Although the existence of the CSD has been recognized since 1977, prior algorithms compute only a reduced version (the 2-by-1 CSD)…

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…

We present a combination of two algorithms that accurately calculate multiple roots of general polynomials. Algorithm I transforms the singular root-finding into a regular nonlinear least squares problem on a pejorative manifold, and…

Universal geometric calculus simplifies and unifies the structure and notation of mathematics for all of science and engineering, and for technological applications. This paper treats the fundamentals of the multivector differential…

Given n polynomials in n variables of respective degrees d_1,...,d_n, and a set of monomials of cardinality d_1...d_n, we give an explicit subresultant-based polynomial expression in the coefficients of the input polynomials whose…

Let $G$ be a topological commutative semigroup with unit. We prove that a continuous function $f\colon G\to \cc$ is a generalized exponential polynomial if and only if there is an $n\ge 2$ such that $f(x_1 +\ldots +x_n )$ is decomposable;…

We consider the problem of finding for a given $N$-tuple of polynomials (real or complex) the closest $N$-tuple that has a common divisor of degree at least $d$. Extended weighted Euclidean seminorm of the coefficients is used as a measure…

A simple algorithm to compute all the zeros of a generic polynomial is proposed.

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

The Generalized Poisson Distribution (GPD) was introduced by Consul and Jain (1973). However, as remarked by Consul (1989), "It is very difficult to prove by direct summation that the sum of all the probabilities is unity". We give a…