-
-
Notifications
You must be signed in to change notification settings - Fork 481
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
Fix incorrect documentation from #32498 #32667
Comments
comment:2
Should these docstrings still mention connected components, or should it be something about the factors of a disjoint union? I think the disjoint union is a special case of "connected components," and due to randomization may actually cover all such cases (up to isomorphism); but since I'm not that familiar with the result, I just want to double-check that we haven't weakened the test itself while leaving the stronger claim in the docstring. |
comment:3
If you think that talking about disjoint union is more natural before the doctest, we can change it. The previous tests were unlikely to hit graphs with non-trivial connected components. This is the reason I changed it. I tested it for various random graphs and did not detect a failure. I don't know, how I ever had the idea that it would be the product. The result (subdirect sum) is rather easy to verify: The edge polytope is defined as the convex hull of e_i + e_j for all edges (i,j). Hence each connected component has its own linear subspace to play with, which corresponds to the subdirect sum. It's not just combinatorial isomorphic, but really isomorphic up to a linear transformation (that permutes the coordinates). |
comment:4
Replying to @kliem:
No, don't change it, unless you want to fix the typo "it's" -> "its" =) The claim is believable and that the new test should succeed is intuitively clear. So long as the change was intentional I have no problem with it. |
Reviewer: Michael Orlitzky |
Branch pushed to git repo; I updated commit sha1 and set ticket back to needs_review. New commits:
|
comment:6
Thanks for the review. Changed the typo. |
Changed branch from u/gh-kliem/mistake_from_32498 to |
The (symmetric) edge polytope of the disjoint union of graphs is the subdirect sum of the polytopes and not the product.
CC: @mantepse @orlitzky
Component: graph theory
Keywords: symmetric edge polytope
Author: Jonathan Kliem
Branch/Commit:
8eb9c50
Reviewer: Michael Orlitzky
Issue created by migration from https://trac.sagemath.org/ticket/32667
The text was updated successfully, but these errors were encountered: