-
For very large and challenging computations, most of the elements of the face lattice contain rather few atoms/bits. With little changes to the code, we can just collect the non zero chunks (64,128 …
-
just adding a nice example for simplicial complexes
CC: @slel @dcoudert
Component: **algebraic topology**
Author: **Frédéric Chapoton**
Branch/Commit: **[`1196685`](https://github.com/sagemat…
-
微博内容精选
-
This ticket is used to keep track of the progress towards python3 in graphs.
**Major issues**
- #22349 Deprecate sorting of methods `.vertices()` and `.edges()`
- direct comparison of vertex label…
-
This patch provides an implementation of the subword complex:
Fix a Coxeter system (W,S). Let Q = be a finite word in S and pi in W.
The subword complex Delta(Q,pi) is then defined to be the simpl…
-
... in analogy to cubical and polyhedral complexes
(from #33586)
CC: @yuan-zhou @jhpalmieri
Component: **geometry**
Author: **John Palmieri**
Branch/Commit: **[`a597465`](https://github.com/s…
-
This is to upgrade to Python 3.8.x.
- [PEP569 -- Python 3.8 Release Schedule](https://www.python.org/dev/peps/pep-0569/)
- [What's new in Python 3.8](https://docs.python.org/3.8/whatsnew/3.8.html)
…
-
The patch contains an implementation of the cluster complex for finite types.
```
sage: ClusterComplex(['A',3])
Cluster complex of type ['A', 3] with 9 vertices and 14 facets
```
The implementatio…
-
This is tangentially related to #684. I'm trying to write a C++ function using 3D alpha complexes that can be wrapped in python. So, I take as input a 2D vector of doubles (3D coordinates of points) a…
-
A small patch to let us compute the orbits of sets and tuples by exposing it from GAP.
Apply :
1. [attachment: trac_14291-v2.patch](https://github.com/sagemath/sage-prod/files/10657408/trac_14291-v…