Iván Renison

Make `notNull` for any `Foldable`

3

Hello, the `notNull` defined in `Data.List.Extra`, as a composition of `not` and `null`, is defined only for list, however, de `null` function works with any `Foldable`, so I think that...

Modularize lazy segment tree

3

resolves #227, resolves #216 I have separated the operations of lazy segment tree in to functions so now it should be easy to modify. I tested a modified operation with...

Lazy segment tree is difficult to modify for other operations

3

The lazy segment tree of this is repo very useful when exactly the operations that it has are needed, but when other are needed it is difficult to modify because...

Use `__lg` to make `treeJump` shorter

2

It breaks the case when P is empty, but thats not an useful case

feat: Colors alternate in a bicolored path

11

Add the theorem `pathGraph_G_Hom_coloring` saying that if a graph has a homorphism from a pathGraph then the colors alternate in the path. Specifically, the theorem ask for the first element...

feat(Combinatorics/SimpleGraph): If a graph has a Walk starting and ending in the same vertex then the chromatic number is grater than two

1

--- The theorem is named `Walk.two_lt_chromaticNumber_of_odd_closed`, but I'm not sure if that is the best name. I didn't use the word cycle because in `Connectivity.lean` a cycle is defined as...

Hi, I'm trying to use `reducedRowEchelonize` with rationals with this code: ```cpp #include #include #include typedef Givaro::QField Field; int main() { Field F; LinBox::DenseMatrix A(F); A.resize(3, 3); A.refEntry(0, 0) =...

Hi, I'm learning how to use this library, and looking at the examples I found that in `examples/athadet.C` there is a include of a file that does not seems to...