12 citations · 31 across the 6 of their papers we have counts for
8 papers
The Parametric Frobenius Problem
Bjarke Hammersholt Roune, Kevin Woods
Given relatively prime positive integers a_1,...,a_n, the Frobenius number is the largest integer that cannot be written as a nonnegative integer combination of the a_i. We examine…
Connect Four and Graph Decomposition
Laurent Evain, Mathias Lederer, Bjarke Hammersholt Roune
We introduce the standard decomposition, a way of decomposing a labeled graph into a sum of certain labeled subgraphs. We motivate this graph-theoretic concept by relating it to Co…
Practical Groebner Basis Computation
Bjarke Hammersholt Roune, Michael Stillman
We report on our experiences exploring state of the art Groebner basis computation. We investigate signature based algorithms in detail. We also introduce new practical data struct…
Complexity and Algorithms for Euler Characteristic of Simplicial Complexes
Bjarke Hammersholt Roune, Eduardo Sáenz de Cabezón
We consider the problem of computing the Euler characteristic of an abstract simplicial complex given by its vertices and facets. We show that this problem is #P-complete and prese…
The Slice Algorithm For Irreducible Decomposition of Monomial Ideals
Bjarke Hammersholt Roune
Irreducible decomposition of monomial ideals has an increasing number of applications from biology to pure math. This paper presents the Slice Algorithm for computing irreducible d…
Maximal lattice free bodies, test sets and the Frobenius problem
Anders Jensen, Niels Lauritzen, Bjarke Roune
Maximal lattice free bodies are maximal polytopes without interior integral points. Scarf initiated the study of maximal lattice free bodies relative to the facet normals in a fixe…