Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

add minimal interface for using ZZ[x]-matrices from flint #29894

Closed
fchapoton opened this issue Jun 18, 2020 · 11 comments
Closed

add minimal interface for using ZZ[x]-matrices from flint #29894

fchapoton opened this issue Jun 18, 2020 · 11 comments

Comments

@fchapoton
Copy link
Contributor

So that one may use this later to compute determinants in this case, for example.

CC: @videlec

Component: interfaces

Author: Frédéric Chapoton

Branch/Commit: 1f52255

Reviewer: Travis Scrimshaw

Issue created by migration from https://trac.sagemath.org/ticket/29894

@fchapoton fchapoton added this to the sage-9.2 milestone Jun 18, 2020
@fchapoton
Copy link
Contributor Author

Branch: u/chapoton/29894

@fchapoton
Copy link
Contributor Author

Commit: 1f52255

@fchapoton
Copy link
Contributor Author

New commits:

1f52255introduce minimal interface for using ZZ[x] matrices in Flint

@tscrim
Copy link
Collaborator

tscrim commented Jun 19, 2020

comment:2

Could we add at least one little direct use for this interface, say in computing the determinants as mentioned in the ticket description?

@fchapoton
Copy link
Contributor Author

comment:3

ok, I will try to think about it. I had some use case, but it turned out to be slower than the existing method.

@tscrim
Copy link
Collaborator

tscrim commented Jun 20, 2020

comment:4

That is interesting and surprising to me. Bill probably would like to know about that. The flint version might also be asymptotically faster. Plus, I am generally a fan of having multiple implementations available and giving the choice to the user (if for nothing else other than testing).

@fchapoton
Copy link
Contributor Author

comment:5

My test case was (for M upper triangular square matrix with 1 on the diagonal)

det(x M^t + M)

versus

charpoly(-M (M^t)^(-1))

and the inversion + product + charpoly over ZZ was much faster than the det over ZZ[x]

@fchapoton
Copy link
Contributor Author

comment:6

maybe useful for Alexander polynomial from Seifert matrix, see #29952

@tscrim
Copy link
Collaborator

tscrim commented Jun 30, 2020

comment:7

Perhaps that is just a special case of the fact it is a upper unitriangular matrix? Anyways, I am not going to fret over not having a definitive use case at this time. It doesn't hurt anything to have the interface all setup.

@tscrim
Copy link
Collaborator

tscrim commented Jun 30, 2020

Reviewer: Travis Scrimshaw

@vbraun
Copy link
Member

vbraun commented Jul 8, 2020

Changed branch from u/chapoton/29894 to 1f52255

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

No branches or pull requests

3 participants