## Abstract A set __S__ of vertices is a determining set for a graph __G__ if every automorphism of __G__ is uniquely determined by its action on __S__. The determining number of __G__, denoted Det(__G__), is the size of a smallest determining set. This paper begins by proving that if __G__=__G__β‘β
Determining the Number and Structure of Phylogenetic Invariants
β Scribed by Thomas R. Hagedorn
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 155 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0196-8858
No coin nor oath required. For personal study only.
β¦ Synopsis
The method of invariants is an important approach in biology for determining phylogenetic information which avoids the problems involving long branch lengths that plague other methods. In this paper, we verify the conjecture on the number of algebraic generators for the ideal of polynomial invariants. We also study rational and analytic invariants and prove several criteria concerning when it suffices to work with polynomial invariants.
π SIMILAR VOLUMES
Let p be an odd regular prime number. We prove that there exist infinitely many totally real number fields k of degree p&1 whose class numbers are not divisible by p. Moreover, for certain regular prime number p, we prove that there exist infinitely many totally real number fields k of degree p&1 wh
This note presents a method that determines all power integral bases of a quartic number field by solving Thue equations of degrees 3 and 4. To this end, projective representations of the ring of integers by graded complete intersections are studied and a criterion for monogeneity in terms of projec
By the theory of Vassiliev invariants, the knowledge of a certain algebra B, defined as generated by graphs, is essentially as good as the knowledge of the space of Vassiliev invariants. We will prove that the subspace B c 2, u of B generated by all connected diagrams with 4+2u vertices, including u
An explicit criterion for the determination of the numbers and multiplicities of the real/imaginary roots for polynomials with symbolic coefficients is based on a Complete Discrimination System (CDS). A CDS is a set of explicit expressions in terms of the coefficients that are sufficient for determi