Related papers: A Symbolic Homotopy Algorithm for Solving Composab…
A new symbolic algorithmic implementation of the functional-discrete (FD-) method is developed and justified for the solution of fourth order Sturm--Liouville problem on a finite interval in the Hilbert space. The eigenvalue problem for the…
Let $\mathbf{K}$ be a field and $\phi$, $\mathbf{f} = (f_1, \ldots, f_s)$ in $\mathbf{K}[x_1, \dots, x_n]$ be multivariate polynomials (with $s < n$) invariant under the action of $\mathcal{S}_n$, the group of permutations of $\{1, \dots,…
In this Letter we identify special systems of (an arbitrary number) N of first-order Ordinary Differential Equations with homogeneous polynomials of arbitrary degree M on their right-hand sides, which feature very simple explicit solutions;…
A new algorithm for real root isolation of polynomial equations based on hybrid computation is presented in this paper. Firstly, the approximate (complex) zeros of the given polynomial equations are obtained via homotopy continuation…
We identify many new solvable subcases of the general dynamical system characterized by two autonomous first-order ordinary differential equations with purely quadratic right-hand sides; the solvable character of these dynamical systems…
Given a system of n homogeneous polynomials in n variables which is equivariant with respect to the canonical actions of the symmetric group of n symbols on the variables and on the polynomials, it is proved that its resultant can be…
An algorithm is presented here, for discovering Hopf-Bifurcation varieties of polynomial dynamical systems. It is based on the expression of specific polynomials, as sums of products of first degree polynomials, with parametrical…
We give formulas for the multiplicity of any affine isolated zero of a generic polynomial system of n equations in n unknowns with prescribed sets of monomials. First, we consider sets of supports such that the origin is an isolated root of…
Univariate polynomial root-finding is both classical and 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 polynomial…
Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…
The security of multivariate cryptosystems and digital signature schemes relies on the hardness of solving a system of polynomial equations over a finite field. Polynomial system solving is also currently a bottleneck of index-calculus…
In this paper we introduce and develop the theory of FI-modules. We apply this theory to obtain new theorems about: - the cohomology of the configuration space of n distinct ordered points on an arbitrary (connected, oriented) manifold -…
We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…
We propose new algorithms for computing triangular decompositions of polynomial systems incrementally. With respect to previous works, our improvements are based on a {\em weakened} notion of a polynomial GCD modulo a regular chain, which…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
Recently, the functional equation \[ \sum_{i=0}^mf_i(b_ix+c_iy)= \sum_{i=1}^na_i(y)v_i(x) \] with $x,y\in\mathbb{R}^d$ and $b_i,c_i\in\mathbf{GL}_d(\mathbb{C})$, was studied by Almira and Shulman, both in the classical context of continuous…
The recurrence for the $k$-Fibonacci polynomials is usually iterated upwards to positive values of $n$ only. When the recurrence is iterated downwards to $n<0$, there are indices where the polynomials vanish identically. This fact does not…
Let $\mathbf{f} = (f_1, \ldots, f_R)$ be a system of polynomials with integer coefficients in which the degrees need not all be the same. We provide sufficient conditions for which the system of equations $f_j (x_1, \ldots, x_n) = 0 \ (1…
We consider the problem of ``algebraic reconstruction'' of linear combinations of shifts of several signals $f_1,\ldots,f_k$ from the Fourier samples. For each $r=1,\ldots,k$ we choose sampling set $S_r$ to be a subset of the common set of…
In the convergence analysis of numerical methods for solving partial differential equations (such as finite element methods) one arrives at certain generalized eigenvalue problems, whose maximal eigenvalues need to be estimated as…