vidyarthi's profile - activity

I think this is elementary, but how do we just multiply two elements in the symmetric group. For example, I have a list of elements as

G=SymmetricGroup(5)
A=[(1,2), (1,3,2), (1,4), (1,4)(2,3),(2,4),(2,4,3),(3,4),(2,3,4)]
b=[G(1,5)*G(a) for a in A]
b

When I implement in the above code on the compiler, I get the error 'tuple' object is not callable. Anyway to overcome this error and multiply two elements in the group, or, in any other group? Thanks beforehand.

The subgraph_cound should be subgraph_count. Similarly for cycle_subgraph_cound.

Suppose i have a polynomial matrix like:

var('x')
g=graph.CompleteGraph(4)
h=g.am()
t=h-x*identity_matrix(4)
t1=t.adjugate()
t1

Then, how do i get t1 in the factorized/simplified form. Specifically, I see that there are exactly two distinct entries in t1, and each of them can be factorized into two distinct monomial powers. But, how do I get this directly, without having to factorize each element separately. Any hints? Thanks beforehand.

Thanks to @MaxAlexseyev, to get what I wanted, which is the adjugate matrix having all its individual entries factored,

Got it! I used t1.apply_map(lambda z:factor(z))to get what I wanted.

Thanks! I actually wanted to factorize each of the individual matrix entries. On writing factor(t1.list()), I get error

Factorizing matrix entries that are polynomials Suppose i have a polynomial matrix like: var('x') g=graph.CompleteGraph

Suppose I have a matrix A which is m x n in order. How do I extract a submatrix of specified rows and colums from A. Like I want a p x q submatrix of A. Will the expanded_submatrix method help in this regard? Thanks beforehand.

The syntax was unexpectedly easy. It is similar to the one used in Matlab/Octave. We just use the syntax A[i-1:p,j-1:q],

Extracting specific rows of a matrix Suppose I have a matrix A which is m x n in order. How do I extract a submatrix of

@dan_fulea Modified the question. Added a reference. At least, if there was a workaround when q or n in this question is

Representing Code over integer rings Is there a method to deal with all codewords over the integer rings Z_n where n=p^

@dan_fulea By codewords I mean a submodule over the ring [math]\mathbb{Z}_n[/math]. And yes, it is best to get them as a

@dan_fulea By codewords I mean a submodule over the group [math]\mathbb{Z}_n[/math]. And yes, it is best to get them as

If an equation has several radicals, is it possible to remove the radicals to get a radical free equation in SageMath? The simplify_radical() method seems not to exist in SageMath. The canonicalize_radical() seems to do nothing. For example,

E=a^2 + b^2 + c^2 + sqrt(a^2 + b^2 + c^2)==0
E.canonicalize_radical()

gives the output same as E

Any alternative? Thanks beforehand.

@dan_fulea By codewords I mean the module over the group [math]\mathbb{Z}_n[/math]. And yes, it is best to get them as a

How to remove radicals from an equation If an equation has several radicals, is it possible to remove the radicals to ge

How to remove radicals from an equation If an equation has several radicals, is it possible to remove the radicals to ge

But that dosent seem to work

Representing Code over integer rings Is there a method to deal with all codewords over the integr rings Z_n wheren=p^k

How to remove radicals from an equation If an equation has several radicals, is it possible to remove the radicals to ge