activity
20122026
most citedDenominator Bounds for Systems of Recurrence Equations using -Extensions

4 citations · 6 across the 9 of their papers we have counts for

collaborators

9 papers

cs.SC2026

When Algebraic Symmetry Breaking Meets Solvers: An Experimental Study

Madalina Erascu, Johannes Middeke

We present an experimental evaluation of automatically generated polynomial symmetry breaking constraints for integer linear programs. Starting from the method that we introduced a…

cs.SC2026

Automatic Generation of Polynomial Symmetry Breaking Constraints

Madalina Erascu, Johannes Middeke

Symmetry in integer programming causes redundant search and is often handled with symmetry breaking constraints that remove as many equivalent solutions as possible. We propose an…

cs.SC2024

Hypergeometric Solutions of Linear Difference Systems

Moulay Barkatou, Mark van Hoeij, Johannes Middeke +1

We extend Petkovšek's algorithm for computing hypergeometric solutions of scalar difference equations to the case of difference systems , with ,…

cs.SC2020★ 1 cited

A Family of Denominator Bounds for First Order Linear Recurrence Systems

Mark van Hoeij, Moulay Barkatou, Johannes Middeke

For linear recurrence systems, the problem of finding rational solutions is reduced to the problem of computing polynomial solutions by computing a content bound or a denominator b…

math.CO2020

Common Factors in Fraction-Free Matrix Decompositions

Johannes Middeke, David J. Jeffrey, Christoph Koutschan

We consider LU and QR matrix decompositions using exact computations. We show that fraction-free Gauss--Bareiss reduction leads to triangular matrices having a non-trivial number o…

math.CO2017

Denominator Bounds and Polynomial Solutions for Systems of q-Recurrences over K(t) for Constant K

Johannes Middeke

We consider systems A_\ell(t) y(q^\ell t) + ... + A_0(t) y(t) = b(t) of higher order q-recurrence equations with rational coefficients. We extend a method for finding a bound on th…