Results 11 to 20 of about 70,439 (268)
Polynomial Entropy and Polynomial Torsion for Fibered Systems
Abstract Given a continuous fibered dynamical system, we first introduce the notion of polynomial torsion of a fiber, which measures the “infinitesimal variation” of the dynamics between the fiber and the neighboring ones.
Grycan-Gérard, Flavien +1 more
openaire +1 more source
Subsystems of the polynomial system [PDF]
This paper deals with the classification of subsystems of a polynomial system. A system is defined as a pair of complex vector spaces (V,W) for which there exists a \({\mathbb{C}}\)-bilinear map from \({\mathbb{C}}^ 2\times V\) to W, where \({\mathbb{C}}\) is the field of complex numbers.
Okoh, Frank, Zorzitto, Frank A.
openaire +3 more sources
MultiRegeneration for polynomial system solving [PDF]
We demonstrate our implementation of a continuation method as described in [7] for solving polynomials systems. Given a sequence of (multi)homogeneous polynomials, the software multiregeneration outputs the respective (multi)degree in a wide range of cases and partial multidegree in all others.
Colin Crowley +3 more
openaire +3 more sources
On Solving Parametric Polynomial Systems [PDF]
This work intends to cover similar ground and extend the paper [\textit{D. Lazard} and \textit{F. Rouillier}, J. Symb. Comput. 42, No. 6, 636--667 (2007; Zbl 1156.14044)]. Unfortunately the present paper is of questionable quality. The English is at times hard to follow and the paper lacks mathematical substance.
Marc Moreno Maza +2 more
openaire +1 more source
RESOLUTION OF POLYNOMIAL SYSTEMS [PDF]
In this talk, the state of the art of solving polynomial system by algebraic methods is sketched, and the main directions where future work is needed are indicated.
openaire +2 more sources
On the first fall degree of summation polynomials
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gröbner basis algorithms.
Kousidis Stavros, Wiemers Andreas
doaj +1 more source
Solving parametric polynomial systems
The authors present a new algorithm for solving constructible or semi-algebraic systems in the indeterminates \([U,X]\) where \(U=[U_1,\dots ,U_d]\) is the set of parameters and \(X=[X_{d+1},\dots,X_n]\) the set of unknowns. To this end, they study the characterization of open subsets in the parameter space over which the number of solutions is ...
Lazard, Daniel, Rouillier, Fabrice
openaire +6 more sources
Decomposable sparse polynomial systems [PDF]
7 pages, software available at https://www.math.tamu.edu/~thomasjyahl/research/DSS/DSSsite ...
Brysiewicz, T. +3 more
openaire +4 more sources
Approximate zero polynomials of polynomial matrices and linear systems [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Karcanias, N., Halikias, G.
openaire +5 more sources
Limit Cycles of Polynomially Integrable Piecewise Differential Systems
In this paper, we study how many algebraic limit cycles have the discontinuous piecewise linear differential systems separated by a straight line, with polynomial first integrals on both sides.
Belén García +3 more
doaj +1 more source

