Computing implicitizations of multi-graded polynomial maps
Authors:
- Joseph CummingsJCJoseph Cummings
- Benjamin HolleringBHBenjamin Hollering
Open Access
- 20 May 2025
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 132
Abstract
No abstract availableAll Related Versions
Funding Information
- Alexander von Humboldt-Stiftung
- National Science Foundation (DMS-1929348)
- National Science Foundation (CCF-1812746)
This publication has 21 references indexed in Scilit:
- Identifiability in phylogenetics using algebraic matroidsJournal of Symbolic Computation, 2021
- On the complexity of computing Gröbner bases for weighted homogeneous systemsJournal of Symbolic Computation, 2016
- Identifiability of 3-class Jukes–Cantor mixturesAdvances in Applied Mathematics, 2015
- A proof of the set-theoretic version of the salmon conjectureJournal of Algebra, 2012
- The implicit equation of a multigraded hypersurfaceJournal of Algebra, 2011
- Geometry of phylogenetic group-based modelsJournal of Algebra, 2011
- The implicitization problem forJournal of Algebra, 2009
- On the ideals of equivariant tree modelsMathematische Annalen, 2008
- Phylogenetic ideals and varieties for the general Markov modelAdvances in Applied Mathematics, 2008
- Computing tropical varietiesJournal of Symbolic Computation, 2007