-
The problem occurs for both `Distributed::Triangulation` and `FullyDistributed::Triangulation` and both `Hypercube` and `Simplex` (of course, the latter being only available for fully-distributed tria…
-
On a clean develop branch running `SageMath version 9.1.beta9, Release Date: 2020-03-29`, I get:
```
$ sage -t --long --memlimit=3600 src/sage/geometry/polyhedron/base.py
too many failed tests, no…
-
@peterrum mentioned that the naming `LocalSmoothing/GlobalCoarsening` is not really suitable, since we always use kind of global-coarsening multigrid.
I suggest the following renaming:
Old
```c…
-
This ticket adds a method `is_partial_cube` to the `Graph` class, which checks whether a graph is a partial cube. A partial cube is a graph that can be isometrically embedded into a hypercube, i.e.,…
-
Hello, there.
It seems that the definition of create and annihilation operators are defined reversely in fermi-hubbard model, and results are wrong. [link](https://github.com/netket/netket/blob/263…
-
From https://www.csun.edu/~ctoth/Handbook/chap15.pdf:
The join of two polytopes `P` (of dimension d) and `Q` (of dimension d') is the (d+d'+1)-polytope obtained as the convex hull of `P\cup Q` aft…
-
Please see [this google doc](https://docs.google.com/document/d/1CyaH_OFiFEAB17I7hCTyIua6okNnrnvI/edit?usp=sharing&ouid=114335116280732994204&rtpof=true&sd=true) for the [feedback from Metadata Glossa…
-
This goal of this ticket is to use `data_structures/biteset.pxi` for the bitset stuff in combinatorial polyhedron and cleanly seperate algorithm and data structure.
This ticket is mostly resolved i…
-
Follow-up from #22701, where this was implemented for 'field'.
Before (with #31864):
```
sage: %time P = polytopes.hypercube(12, backend='polymake') …
-
I want to customize objective function.
For example, what I want to implement now is a loss function called Focal loss, which can be used when there is a class imbalance.
[Focal Loss](https://max…