Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.
| 2024-03-26 01:09:22 +0200 | received badge | ● Famous Question (source) |
| 2023-11-20 18:43:43 +0200 | received badge | ● Notable Question (source) |
| 2023-06-19 03:38:57 +0200 | received badge | ● Nice Question (source) |
| 2023-06-02 19:53:29 +0200 | commented question | All faces of a planar graph How can I get the embedding? so how does the faces() work? |
| 2023-06-02 19:51:27 +0200 | commented question | All faces of a planar graph I define this graph g = Graph([(0, 1), (1, 2), (2, 3), (3, 0), (1, 3),(0,4),(4,1),(3,5),(0,5)]) and the output contains |
| 2023-06-02 04:07:45 +0200 | asked a question | All faces of a planar graph All faces of a planar graph Is there any method to get all faces of a planar graph? |
| 2023-06-02 04:07:00 +0200 | asked a question | all faces of a planar graph all faces of a planar graph Is there any method to get all faces of a planar graph? |
| 2023-03-28 21:24:34 +0200 | received badge | ● Popular Question (source) |
| 2023-03-23 20:58:31 +0200 | marked best answer | Geometric multiplicities Is there any function to find the geometric multiplicities of an eigenvalue of a matrix? |
| 2023-03-23 16:00:31 +0200 | asked a question | Geometric multiplicities Geometric multiplicities Is there any function to find the geometric multiplicities of an eigenvalue of a matrix? |
| 2022-08-02 21:05:35 +0200 | edited question | Linear independent matrices Linear independent matrices When you have a standard vector space like $\mathbb Q^3$ with some vectors, we can check whe |
| 2022-08-02 20:08:05 +0200 | commented answer | Linear independent matrices I was wondering if there is a method for avoiding flatting. |
| 2022-08-02 00:53:50 +0200 | asked a question | Linear independent matrices Linear independent matrices When you have a standard vector space like $\mathbb Q^3$ with some vectors, we can check whe |
| 2022-03-30 05:29:37 +0200 | asked a question | Digraphs database Digraphs database I'm interested in the list of digraphs without muliedges and I used the following command, but it does |
| 2022-01-11 21:46:59 +0200 | marked best answer | Elements of a free group My question is regarding the presentation of elements of the free group $F_2$. Then the result will be Is there any command to get the array? I mean we give $a^2ba^-1c^-1b$ then it returns [1,1,2,-1,-3,2]. |
| 2022-01-11 21:46:59 +0200 | received badge | ● Scholar (source) |
| 2022-01-11 21:46:58 +0200 | received badge | ● Supporter (source) |
| 2022-01-11 20:58:49 +0200 | edited question | Elements of a free group Elements of a free group My question is regarding the presentation of elements of the free group $F_2$. G.<a,b,c> |
| 2022-01-11 20:57:01 +0200 | asked a question | Elements of a free group Elements of a free group My question is regarding the presentation of elements of the free group $F_2$. G.<a,b,c> |
| 2022-01-11 04:15:32 +0200 | received badge | ● Editor (source) |
| 2022-01-11 04:15:32 +0200 | edited question | Free groups Free groups I am looking for a way to find the list of all reduced words of length at most 5 in $F_2$(the free group on |
| 2022-01-11 00:48:25 +0200 | asked a question | Free groups Free groups I am looking for a way to find the list of all reduced words of length at most 5 in $F_2$(the free group on |
| 2021-06-22 19:23:30 +0200 | received badge | ● Student (source) |
| 2021-06-22 19:22:10 +0200 | asked a question | Error in finding cliques Error in finding cliques I have the following code f = open("42-matrix-of-size-378.txt", "r") g = f.read() l = g.split( |
Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.