4 papers
Computing Implicitizations of Multi-Graded Polynomial Maps
Joseph Cummings, Benjamin Hollering
In this paper, we focus on computing the kernel of a map of polynomial rings . This core problem in symbolic computation is known as implicitization. While there are extremely e…
Identifiability of Homoscedastic Linear Structural Equation Models using Algebraic Matroids
Mathias Drton, Benjamin Hollering, Jun Wu
We consider structural equation models (SEMs), in which every variable is a function of a subset of the other variables and a stochastic error. Each such SEM is naturally associate…
Identifiability of the Rooted Tree Parameter under the Cavender-Farris-Neyman Model with a Molecular Clock
Jane Ivy Coons, Benjamin Hollering
Identifiability of the discrete tree parameter is a key property for phylogenetic models since it is necessary for statistically consistent estimation of the tree from sequence dat…
Toric Fiber Products in Geometric Modeling
Eliana Duarte, Benjamin Hollering, Maximilian Wiesmann
An important challenge in Geometric Modeling is to classify polytopes with rational linear precision. Equivalently, in Algebraic Statistics one is interested in classifying scaled…