Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-15T06:06:43.321Z Has data issue: false hasContentIssue false

Prolongations and Computational Algebra

Published online by Cambridge University Press:  20 November 2018

Jessica Sidman
Affiliation:
Department of Mathematics and Statistics, Mount Holyoke College, South Hadley, MA 01075, U.S.A., e-mail: jsidman@mtholyoke.edu
Seth Sullivant
Affiliation:
Department of Mathematics, North Carolina State University, Raleigh, NC, USA, e-mail: smsulli2@ncsu.edu
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We explore the geometric notion of prolongations in the setting of computational algebra, extending results of Landsberg and Manivel which relate prolongations to equations for secant varieties. We also develop methods for computing prolongations that are combinatorial in nature. As an application, we use prolongations to derive a new family of secant equations for the binary symmetric model in phylogenetics.

Keywords

Information

Type
Research Article
Copyright
Copyright © Canadian Mathematical Society 2012