Repository navigation
Conversation
`MatrixCovers.symcover_exponents(A)` (public, not exported) returns integer exponents `α` with `2^(α[i] + α[j]) >= |A[i,j]|`, and `symcover(A; pow2=true)` returns the factors `2 .^ α`. Scaling by these factors is free of rounding, and the exponents are exactly covariant under power-of-two diagonal rescaling whenever every support component has a nonzero diagonal entry. The exponents `ceil(log2|A[i,j]|)` are read exactly from the floating-point representation. Integer reference exponents, which shift exactly under rescaling, reduce `A` to a residual matrix that does not change; the existing symcover heuristic runs on that residual, its factors are rounded up to powers of two, and integer boost and Gauss-Seidel tightening passes finish the cover so that every row is tight on some entry. Version bumped to 2.1.0. Assisted-by: Claude Opus 5.5 <noreply@anthropic.com>
`MatrixCovers.cover_exponents(A)` (public, not exported) returns integer exponents `α`, `β` with `2^(α[i] + β[j]) >= |A[i,j]|`, and `cover(A; pow2=true)` returns the factors. The cover products are exactly covariant under power-of-two diagonal rescaling on any support; the factors follow the `cover_min` balance convention rounded to integers. With the transversal start, a maximum-weight transversal of the exponent matrix and integer optimal duals come from the existing assignment solver run on integer-valued exponents, where its arithmetic is exact. The duals are made canonical (a floored layer-average start on the group graph, raised to the least feasible point above it), so the slacks fed to the floating-point stages do not change under rescaling; the result is rounded and repaired in integers and stays tight on every maximum-weight transversal. The unconstrained start uses integer reference exponents and runs the existing heuristic on the residual matrix, as in the symmetric case. `start=:geomean` is rejected. The layer-average starts take floored means for integer values, and `_max_product_transversal` accepts values that are already logarithms. Assisted-by: Claude Opus 5.5 <noreply@anthropic.com>
`symcover` and `cover` gain a `pow2` keyword, and the exponent solvers `symcover_exponents` and `cover_exponents` are new entrypoints that return `int64` arrays. Assisted-by: Claude Opus 5.5 <noreply@anthropic.com>
Codecov Report❌ Patch coverage is
Additional details and impacted files@@ Coverage Diff @@
## main #117 +/- ##
==========================================
+ Coverage 98.34% 98.39% +0.05%
==========================================
Files 26 27 +1
Lines 8290 8685 +395
==========================================
+ Hits 8153 8546 +393
- Misses 137 139 +2 ☔ View full report in Codecov by Harness. 🚀 New features to boost your workflow:
|
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
In some cases, bitwise covariance is a major asset. Because of gauge freedom, rounding the output does not guarantee covariance. This adds dedicated solvers that never round internally, so that outputs are always covariant. It also adds
public(notexported) names for obtaining the exponents directly, so that cases of over/underflow can be handled.