-
This patch adds a function to recognize if a lattice can be constructed by Day doubling constructions of any (possible) subsets. (Also adds "interface" for #22693.) The code may be unoptimal. For th…
-
The benchmark below was solved in about 20 seconds, using z3 compiled on May 29 2021 from GitHub master, producing the correct result:
```
sat
(
(define-fun s1 () (_ BitVec 64)
#x00020408…
-
On `generic_graph.py` function `canonical_label()` parameter `return_graph`:
- The parameter has no effect when `algorithm='sage'`:
```
sage: G = Graph({10: [20]})
sage: G.canonical_label(algorith…
-
The title says it all, there could be a method for `MeetSemigroupCongruences` for graph inverse semigroup congruences (GIS), but there isn't.
-
It is currently not possible to run `EquivalenceRelationLookup` nor `MeetSemigroupCongruences` for all types of congruences over a semigroup. I will post examples later when I have more time.
Here …
-
This patch will add a function to compute the quotient lattice.
Also contains a parameter name change for `sublattices_lattice()`.
CC: @mantepse
Component: **combinatorics**
Author: **Jori Män…
-
This is more of a request. @james-d-mitchell said it would be helpful to have examples like this for targeting future improvements. When I call IsomorphismPermGroup on the quotient semigroup of an inv…
-
I get the following in v4.0.0:
~~~
gap> D := Digraph([[2, 3, 4], [4], [2], []]);
gap> S := GraphInverseSemigroup(D);
gap> C := SemigroupCongruence(S, [S.1, S.2]);
gap> C := AsCongruenceBy…
-
Theorems `tgsss1`, `tgsss2`, and `tgsss3` are true, but I don't think they prove what was intended.
The comment currently describing theorem `tgsss1` says it is "Third congruence theorem: SSS (Sid…
-
| | |
| --- | --- |
| Bugzilla Link | [31682](https://llvm.org/bz31682) |
| Resolution | FIXED |
| Resolved on | Jan 20, 2017 00:42 |
| Version | trunk |
| OS | Windows NT |
| Blocks | llvm/llvm-pro…