2014
DOI: 10.1007/s13348-014-0120-0
|View full text |Cite
|
Sign up to set email alerts
|

Low degree equations for phylogenetic group-based models

Abstract: Abstract. Motivated by phylogenetics, our aim is to obtain a system of low degree equations that define a phylogenetic variety on an open set containing the biologically meaningful points. In this paper we consider phylogenetic varieties defined via group-based models. For any finite abelian group G, we provide an explicit construction of codim X polynomial equations (phylogenetic invariants) of degree at most |G| that define the variety X on a Zariski open set U . The set U contains all biologically meaningfu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
37
0

Year Published

2016
2016
2021
2021

Publication Types

Select...
5

Relationship

2
3

Authors

Journals

citations
Cited by 12 publications
(38 citation statements)
references
References 28 publications
0
37
0
Order By: Relevance
“…For the class of G-models that includes all the models introduced in this article, on the level of projective schemes the bounds were obtained in [Mic13]. Finally, for group-based models, but only on Zariski open set, the bound of the degrees by |G| was proved in [CFSM14]. Our second main theorem is as follows.…”
Section: Introductionmentioning
confidence: 92%
See 1 more Smart Citation
“…For the class of G-models that includes all the models introduced in this article, on the level of projective schemes the bounds were obtained in [Mic13]. Finally, for group-based models, but only on Zariski open set, the bound of the degrees by |G| was proved in [CFSM14]. Our second main theorem is as follows.…”
Section: Introductionmentioning
confidence: 92%
“…Group-based Models polynomials defining: degree ≤ |G| [CFSM14] As one can see the higher the row, the finer algebraic properties are required. On the other hand columns to the right provide bigger and more general groups.…”
Section: Introductionmentioning
confidence: 99%
“…In the next two sections we assume that L or R contains at least two different pairs, e.g. (1,2) and (a, b). There are a few possibilities.…”
Section: 5mentioning
confidence: 99%
“…If u / ∈ {x, y} or v / ∈ {s, t} then we could use a quadric relation, e.g. (1, x, y) g1 + (u, 2) = (u, x, y) g1 + (1, 2), to get (1,2) or (a, b) in R and delete a pair. Hence, without loss of generality, we consider only the situation where u = x and v = s, that is, R contains (x, 2) and (s, b).…”
Section: 1mentioning
confidence: 99%
See 1 more Smart Citation