8 papers
The minimum degree question for the Maker Breaker Domination Game
Jakob Führer, Georg Grasegger, Paul Hametner +1
The Maker Breaker Domination Game is a two player game played on a graph in which the players take turns to claim a vertex from the graph. The aim of the Dominator is to claim…
Angular constraints on planar frameworks
Sean Dewar, Georg Grasegger, Anthony Nixon +4
Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of directi…
Single-cell 3D genome reconstruction in the haploid setting using rigidity theory
Sean Dewar, Georg Grasegger, Kaie Kubjas +2
This article considers the problem of 3-dimensional genome reconstruction for single-cell data, and the uniqueness of such reconstructions in the setting of haploid organisms. We c…
Counting fibres of the Hadamard product using Bergman fans
Oliver Clarke, Sean Dewar, Matteo Gallet +3
We study the generic fibre of the Hadamard product of linear spaces via matroid theory and tropical geometry. To do so, we introduce the flip product, a numerical invariant associa…
Computing the number of realisations of a rigid graph
Sean Dewar, Georg Grasegger, Josef Schicho +2
A graph is said to be rigid if, given a generic realisation of the graph as a bar-and-joint framework in the plane, there exist only finitely many other realisations of the graph w…
PyRigi -- a general-purpose Python package for the rigidity and flexibility of bar-and-joint frameworks
Matteo Gallet, Georg Grasegger, Matthias Himmelmann +1
We present PyRigi, a novel Python package designed to study the rigidity properties of graphs and frameworks. Among many other capabilities, PyRigi can determine whether a graph ad…