A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots

DOI10.1016/S0747-7171(08)80153-8zbMath0751.12001MaRDI QIDQ1186712

Ralf Fröberg, Göran Björck

Publication date: 28 June 1992

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

algorithms; cyclic \(n\)-roots; system of inhomogeneous polynomial equations

Mathematics Subject Classification ID

68W30: Symbolic computation and algebraic computation

12E12: Equations in general fields

Related Items

Representations of quantum permutation algebras, Permutation equivalence classes of Kronecker products of unitary Fourier matrices, Defect of a unitary matrix, HOM4PS-2.0: a software package for solving polynomial systems by the polyhedral homotopy continuation method, Certifying properties of an efficient functional program for computing Gröbner bases, Symbolic homotopy construction, Solving a system of algebraic equations with symmetries, Examples of using dynamic constructible closure., Numerical homotopies to compute generic points on positive dimensional algebraic sets, Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods, Mixed-volume computation by dynamic lifting applied to polynomial system solving, Newton's method with deflation for isolated singularities of polynomial systems, PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems, A Concise Guide to Complex Hadamard Matrices, Mutually unbiased bases and Hadamard matrices of order six, Computing Gröbner fans

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item