Sparse trace tests
From MaRDI portal
Publication:6133451
DOI10.1090/mcom/3849arXiv2201.04268OpenAlexW4361200815MaRDI QIDQ6133451
Taylor Brysiewicz, Michael A. Burr
Publication date: 18 August 2023
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.04268
Symbolic computation and algebraic computation (68W30) Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Geometric aspects of numerical algebraic geometry (14Q65) Numerical algebraic geometry (65H14)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational formulas for traces in zero-dimensional algebras
- Galois groups of enumerative problems
- On the Newton polytope of the resultant
- A convex geometric approach to counting the roots of a polynomial system
- Real enumerative geometry and effective algebraic equivalence
- Sparse resultant under vanishing coefficients
- Trace test
- Computing mixed volume and all mixed cells in quermassintegral time
- Solving decomposable sparse systems
- Sparse polynomial equations and other enumerative problems whose Galois groups are wreath products
- A package for computations with sparse resultants
- Multiprojective witness sets and a trace test
- A theorem on the Poincaré group of an algebraic hypersurface
- Symmetric Functions Applied to Decomposing Solution Sets of Polynomial Systems
- General witness sets for numerical algebraic geometry
- Galois theory for general systems of polynomial equations
- A Poisson formula for the sparse resultant
This page was built for publication: Sparse trace tests
