Gerry Toft
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Gerry Toft has a total of 3 co-authors. Here are the top co-authors by number of shared publications:
- Charles Semple
School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
2 shared publications - Nick Brettell
School of Mathematics and Statistics, Victoria University of Wellington, Wellington, New Zealand
2 shared publications Charles Semple
School of Mathematics and Statistics, University of Canterbury, Christchurch, New Zealand
1 shared publication
Latest Publications
- 21 June 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 37 (2) , 1212-1236
Cyclic Matroids
For integers [Formula: see text] and [Formula: see text] exceeding one, a matroid [Formula: see text] on [Formula: see text] elements is nearly [Formula: see text]- cyclic if there is a cyclic ordering [Formula: see text] of its ground set such that every [Formula: see text] consecutive elements of [Formula: see text] are contained in an [Formula: see text]-element circuit and every [Formula: see text] consecutive elements of [Formula: see text] are contained in a [Formula: see text]-element cocircuit. In the case [Formula: see text], nearly [Formula: see text]-cyclic matroids have been studied previously. In this paper, we show that if [Formula: see text] is nearly [Formula: see text]-cyclic and [Formula: see text] is sufficiently large, then these [Formula: see text]-element circuits and [Formula: see text]-element cocircuits are consecutive in [Formula: see text] in a prescribed way, that is, [Formula: see text] is “[Formula: see text]-cyclic.” Furthermore, we show that, given [Formula: see text] and [Formula: see text] where [Formula: see text], every [Formula: see text]-cyclic matroid on [Formula: see text] elements is a weak-map image of the [Formula: see text]th truncation of a certain [Formula: see text]-cyclic matroid. If [Formula: see text], this certain matroid is the rank-[Formula: see text] whirl, and if [Formula: see text], this certain matroid is the rank-[Formula: see text] free swirl.
- 21 June 2023
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 37 (2) , 1212-1236
Cyclic Matroids
For integers [Formula: see text] and [Formula: see text] exceeding one, a matroid [Formula: see text] on [Formula: see text] elements is nearly [Formula: see text]- cyclic if there is a cyclic ordering [Formula: see text] of its ground set such that every [Formula: see text] consecutive elements of [Formula: see text] are contained in an [Formula: see text]-element circuit and every [Formula: see text] consecutive elements of [Formula: see text] are contained in a [Formula: see text]-element cocircuit. In the case [Formula: see text], nearly [Formula: see text]-cyclic matroids have been studied previously. In this paper, we show that if [Formula: see text] is nearly [Formula: see text]-cyclic and [Formula: see text] is sufficiently large, then these [Formula: see text]-element circuits and [Formula: see text]-element cocircuits are consecutive in [Formula: see text] in a prescribed way, that is, [Formula: see text] is “[Formula: see text]-cyclic.” Furthermore, we show that, given [Formula: see text] and [Formula: see text] where [Formula: see text], every [Formula: see text]-cyclic matroid on [Formula: see text] elements is a weak-map image of the [Formula: see text]th truncation of a certain [Formula: see text]-cyclic matroid. If [Formula: see text], this certain matroid is the rank-[Formula: see text] whirl, and if [Formula: see text], this certain matroid is the rank-[Formula: see text] free swirl.
- Open Access
Cyclic matroids
For all positive integers $s$ and $t$ exceeding one, a matroid $M$ on $n$ elements is {\em nearly $(s, t)$-cyclic} if there is a cyclic ordering $\sigma$ of its ground set such that every $s-1$ consecutive elements of $\sigma$ are contained in an $s$-element circuit and every $t-1$ consecutive elements of $\sigma$ are contained in a $t$-element cocircuit. In the case $s=t$, nearly $(s, s)$-cyclic matroids have been studied previously. In this paper, we show that if $M$ is nearly $(s, t)$-cyclic and $n$ is sufficiently large, then these $s$-element circuits and $t$-element cocircuits are consecutive in $\sigma$ in a prescribed way, that is, $M$ is "$(s, t)$-cyclic". Furthermore, we show that, given $s$ and $t$ where $t\ge s$, every $(s, t)$-cyclic matroid on $n > s+t-2$ elements is a weak-map image of the $\left(\frac{t-s}{2}\right)$-th truncation of a certain $(s, s)$-cyclic matroid. If $s=3$, this certain matroid is the rank-$\frac{n}{2}$ whirl, and if $s=4$, this certain matroid is the rank-$\frac{n}{2}$ free swirl.Open AccessCyclic matroids
For all positive integers $s$ and $t$ exceeding one, a matroid $M$ on $n$ elements is {\em nearly $(s, t)$-cyclic} if there is a cyclic ordering $\sigma$ of its ground set such that every $s-1$ consecutive elements of $\sigma$ are contained in an $s$-element circuit and every $t-1$ consecutive elements of $\sigma$ are contained in a $t$-element cocircuit. In the case $s=t$, nearly $(s, s)$-cyclic matroids have been studied previously. In this paper, we show that if $M$ is nearly $(s, t)$-cyclic and $n$ is sufficiently large, then these $s$-element circuits and $t$-element cocircuits are consecutive in $\sigma$ in a prescribed way, that is, $M$ is "$(s, t)$-cyclic". Furthermore, we show that, given $s$ and $t$ where $t\ge s$, every $(s, t)$-cyclic matroid on $n > s+t-2$ elements is a weak-map image of the $\left(\frac{t-s}{2}\right)$-th truncation of a certain $(s, s)$-cyclic matroid. If $s=3$, this certain matroid is the rank-$\frac{n}{2}$ whirl, and if $s=4$, this certain matroid is the rank-$\frac{n}{2}$ free swirl. - 21 August 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 83 (3) , 1-20
Trinets encode orchard phylogenetic networks
Rooted triples, rooted binary phylogenetic trees on three leaves, are sufficient to encode rooted binary phylogenetic trees. That is, if \({{\mathcal {T}}}\) and \({{\mathcal {T}}}'\) are rooted binary phylogenetic X-trees that infer the same set of rooted triples, then \({{\mathcal {T}}}\) and \({{\mathcal {T}}}'\) are isomorphic. However, in general, this sufficiency does not extend to rooted binary phylogenetic networks. In this paper, we show that trinets, phylogenetic network analogues of rooted triples, are sufficient to encode rooted binary orchard networks. Rooted binary orchard networks naturally generalise rooted binary tree-child networks. Moreover, we present a polynomial-time algorithm for building a rooted binary orchard network from its set of trinets. As a consequence, this algorithm affirmatively answers a previously-posed question of whether there is a polynomial-time algorithm for building a rooted binary tree-child network from the set of trinets it infers.- 21 August 2021
- Published by Springer Nature in Journal of Mathematical Biology
- Vol. 83 (3) , 1-20
Trinets encode orchard phylogenetic networks
Rooted triples, rooted binary phylogenetic trees on three leaves, are sufficient to encode rooted binary phylogenetic trees. That is, if \({{\mathcal {T}}}\) and \({{\mathcal {T}}}'\) are rooted binary phylogenetic X-trees that infer the same set of rooted triples, then \({{\mathcal {T}}}\) and \({{\mathcal {T}}}'\) are isomorphic. However, in general, this sufficiency does not extend to rooted binary phylogenetic networks. In this paper, we show that trinets, phylogenetic network analogues of rooted triples, are sufficient to encode rooted binary orchard networks. Rooted binary orchard networks naturally generalise rooted binary tree-child networks. Moreover, we present a polynomial-time algorithm for building a rooted binary orchard network from its set of trinets. As a consequence, this algorithm affirmatively answers a previously-posed question of whether there is a polynomial-time algorithm for building a rooted binary tree-child network from the set of trinets it infers.