ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Sat, 05 Jul 2014 13:47:36 +0200Does sage have facilities to help prove theorems?https://ask.sagemath.org/question/23222/does-sage-have-facilities-to-help-prove-theorems/ Does sage have modules that assist with proving theorems? Example, we give a few axioms and then a statement we want to prove. Then sage will list the formal proof.ensabaSat, 05 Jul 2014 13:47:36 +0200https://ask.sagemath.org/question/23222/Algorithm implementation in Sagehttps://ask.sagemath.org/question/9910/algorithm-implementation-in-sage/Input: Two undirected simple graphs G1 and G2, each having n vertices.
Output: `True` if G1 ? = G2; `False` otherwise.
for i ? 1,2 do
Ai ? adjacency matrix of Gi
pi ? permutation equivalence class of Ai
A0 i ? lexicographically maximal element of pi
if A0 1 = A0 2 then
return True
return False
anyone have any idea how to implement this in Sage ?MohabThu, 14 Mar 2013 06:22:04 +0100https://ask.sagemath.org/question/9910/