exp-pairs

Linear programming over exponent pairs

https://github.com/Bodigrim/exp-pairs

Version on this page:0.2.1.0
LTS Haskell 24.24:0.2.1.1@rev:1
Stackage Nightly 2025-12-16:0.2.1.1@rev:1
Latest on Hackage:0.2.1.1@rev:1

See all snapshots exp-pairs appears in

GPL-3.0-only licensed by Andrew Lelechenko
Maintained by [email protected]
This version can be pinned in stack with:exp-pairs-0.2.1.0@sha256:44c14212e4938b83644498e030108cdabf9ea6c89eb4dd94ed1975cd6d96a7bc,3029

Module documentation for 0.2.1.0

  • Math
    • Math.ExpPairs
      • Math.ExpPairs.Ivic
      • Math.ExpPairs.Kratzel
      • Math.ExpPairs.LinearForm
      • Math.ExpPairs.Matrix3
      • Math.ExpPairs.MenzerNowak
      • Math.ExpPairs.Pair
      • Math.ExpPairs.PrettyProcess
      • Math.ExpPairs.Process
      • Math.ExpPairs.ProcessMatrix
      • Math.ExpPairs.RatioInf

Package implements an algorithm to minimize rational objective function over the set of exponent pairs

Changes

Changes

Version 0.2.1.0

Improvements for 4D asymmetric divisor problems. Refine matrix manipulations.

Version 0.2.0.0

Switch from Huxley’s exponent pair (2005) to Bourgain’s one (2017).

Version 0.1.5.0

Convenient combinators for linear forms and constraints. New experimental functions in Math.ExpPairs.Kratzel: tauabcd and tauA for general multidimensional divisor problems.

Version 0.1.4.0

Improve overall performance. Use Stern-Brocot tree for binary searches in Math.ExpPairs.Ivic.

Version 0.1.3.0

New functions in Math.ExpPairs.Ivic: reverseMOnS, checkAbscissa, findMinAbscissa, mBigOnHalf, reverseMBigOnHalf. Fast matrix multiplication via Makarov and Laderman algorithms. Rewrite from the scratch pretty printer of processes.