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
LatticePoset: add Frattini sublattice #17226
Comments
Changed keywords from none to poset, lattice |
This comment has been minimized.
This comment has been minimized.
Dependencies: 18567 |
This comment has been minimized.
This comment has been minimized.
Changed dependencies from 18567 to #18567 |
Branch: u/jmantysalo/frattini_sublattice |
Author: Jori Mäntysalo |
comment:6
Travis, you might want to check this. I think that I did something wrong, as there is now included code for It is not easy to find good example lattice. I'll continue searching. Maybe something with three maximal sublattices and so that the Frattini sublattice will something more than just a chain, but not almost all elements. New commits:
|
Commit: |
comment:7
No, what you did is correct. You should merge in the dependency branches. If you don't need to, then there is no dependency. There are ways you can look at the differences in the code from one branch to another using git:
where |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:9
Replying to @tscrim:
Good. Then I mark this as needs_review. I also added this and I put the symbol of Frattini sublattice to documentation. Maybe it helps the reader, maybe not? I also use definition where Frattini sublattice of a lattice without proper sublattices (i.e. 1-element lattice) is the lattice itself. Compare to Frattini subgroup of 1-element group. I did not found any good and simple example. But they can be added later. |
comment:10
Btw, creation of a lattice always [pre]computes join and meet matrices. Now, a function returning lattice could precompute them faster - in this case just by taking right rows and colums from the matrices of original lattice. This is not done here. I suppose that we got faster lattice creation in the future. |
Reviewer: Travis Scrimshaw |
comment:11
Two minor nitpicks: - Frattini sublattice `\Phi(L)` is the intersection of all
+ The Frattini sublattice `\Phi(L)` is the intersection of all
proper maximal sublattices of `L`. It is also the set of
"non-generators" - if the sublattice generated by set `S` of
- elements is whole lattice then also `S \setminus \Phi(L)`
+ elements is whole lattice, then also `S \setminus \Phi(L)`
generates whole lattice. Once that's done, go ahead and set a positive review on my behalf. Thanks. I agree that using the join and meet matrices of the ambient lattice could be used to speedup sublattice creation. However, as you said, this would be a separate ticket. |
comment:13
Replying to @tscrim:
Thanks. I corrected them. Can you still make a little check (and put on positive_review if it is good): I also added a todo-note to |
Branch pushed to git repo; I updated commit sha1. New commits:
|
comment:15
I removed the note, so that I can put this to positive_review as said by tscrim on comment 11. I may optimize this later, but for now it seems that I got several tickets on queue. |
Changed branch from u/jmantysalo/frattini_sublattice to |
Add a function that computes the Frattini sublattice, i.e. intersection of all proper sublattices of a lattice. AFAIK there is no known good algorithm for this. Maybe making even a slow function will make it easier to search for one.
Depends on #18567
CC: @tscrim
Component: combinatorics
Keywords: poset, lattice
Author: Jori Mäntysalo
Branch/Commit:
24c9406
Reviewer: Travis Scrimshaw
Issue created by migration from https://trac.sagemath.org/ticket/17226
The text was updated successfully, but these errors were encountered: