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

Related Items (38)

Computing all nonsingular solutions of cyclic-\(n\) polynomial using polyhedral homotopy continuation methods ⋮ Extension of the set of complex Hadamard matrices of size 8 ⋮ BCCB complex Hadamard matrices of order 9, and MUBs ⋮ On Monomial Reduction and Polynomial Expressions with Respect to Binomial Ideals ⋮ Solving a system of algebraic equations with symmetries ⋮ Permutation equivalence classes of Kronecker products of unitary Fourier matrices ⋮ PHoMpara-parallel implementation of the polyhedral homotopy continuation method for polynomial systems ⋮ Mixed-volume computation by dynamic lifting applied to polynomial system solving ⋮ Gröbner bases of symmetric ideals ⋮ Analytic aspects of the circulant Hadamard conjecture ⋮ Block-circulant complex Hadamard matrices ⋮ Parallelization of modular algorithms ⋮ The defect of generalized Fourier matrices ⋮ Multiplication matrices and ideals of projective dimension zero ⋮ Mutually unbiased bases and Hadamard matrices of order six ⋮ The norm of the Fourier transform on finite abelian groups ⋮ Almost Hadamard matrices: the case of arbitrary exponents ⋮ Defect of a unitary matrix ⋮ CAZAC Sequences and Haagerup’s Characterization of Cyclic N-roots ⋮ Noetherian quotients of the algebra of partial difference polynomials and Gröbner bases of symmetric ideals ⋮ On biunimodular vectors for unitary matrices ⋮ A new method to construct families of complex Hadamard matrices in even dimensions ⋮ On the construction of discrete orthonormal Gabor bases on finite dimensional spaces ⋮ Mixed cell computation in HOM4ps ⋮ Numerical Decomposition of the Rank-Deficiency Set of a Matrix of Multivariate Polynomials ⋮ Computing Gröbner fans ⋮ Newton's method with deflation for isolated singularities of polynomial systems ⋮ Representations of quantum permutation algebras ⋮ 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 ⋮ Unnamed Item ⋮ Symbolic homotopy construction ⋮ Verified error bounds for singular solutions of nonlinear systems ⋮ Examples of using dynamic constructible closure. ⋮ A Concise Guide to Complex Hadamard Matrices ⋮ Hadamard matrices from mutually unbiased bases ⋮ Numerical homotopies to compute generic points on positive dimensional algebraic sets ⋮ Isolated Hadamard matrices from mutually unbiased product bases

Cites Work

This page was built for publication: A faster way to count the solutions of inhomogeneous systems of algebraic equations, with applications to cyclic \(n\)-roots