Computing implicitizations of multi-graded polynomial maps
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 2206382 (Why is no real title available?)
- A proof of the set-theoretic version of the salmon conjecture
- Algebraic statistics
- Computing tropical varieties
- Distinguishing phylogenetic networks
- Geometry of phylogenetic group-based models
- Ideals, Varieties, and Algorithms
- Identifiability in phylogenetics using algebraic matroids
- Identifiability of 3-class Jukes-Cantor mixtures
- Invariants of some probability models used in phylogenetic inference
- Koszul-type determinantal formulas for families of mixed multilinear systems
- Multi-graded Macaulay dual spaces
- On the complexity of computing Gröbner bases for weighted homogeneous systems
- On the ideals of equivariant tree models
- Phylogenetic ideals and varieties for the general Markov model
- Phylogenetic invariants for the general Markov model of sequence mutation
- Phylogeny. Discrete and random processes in evolution
- Testing many constraints in possibly irregular models using incomplete \(U\)-statistics
- The implicit equation of a multigraded hypersurface
- The implicitization problem for \(\phi : \mathbb P^n \longrightarrow (\mathbb P^1)^{n+1}\)
- Toric Ideals of Phylogenetic Invariants
- Toward a salmon conjecture
- Tree Construction using Singular Value Decomposition
- Tropical geometry of statistical models
- msolve. A library for solving polynomial systems
Cited in
(3)
This page was built for publication: Computing implicitizations of multi-graded polynomial maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6890949)