@acer 

csvfile := Matrix(30,7);

@Markiyan Hirnyk 

No, however drift and diffusion are from maple help.

it use a and b as proportion of whole, however proportion of a and b are not the whole.

how can i guess these a and b ?

if do not need to guess, how to do monte carlo for this euler scheme when having a and b unknown?

@Markiyan Hirnyk 

No, because not every professor willing to reply

do i need to ask him first?

V := WienerProcess(Sigma);
Z := t -> exp(a*t+b*V(t)[1]+c*V(t)[2]);
drift1 := simplify(Drift(Z(t))/Z(t));
diffusion1 := simplify(Diffusion(Z(t))/Z(t));

are from maple help file

@Carl Love 

it seems not a random choice,

since it is a method to make a mapping from B to D

just want to find a map from matrix to matrix

i use basis(D) still can not get the result.

if this is random choice , how to make a map from given matrix B to given matrix D?

@Preben Alsholm 

if 

with(LinearAlgebra):

can the matrixmatrixmultiply and matrix( shape=hermitian) and eigenvector change to use this custom + operation

@Christopher2222 

y = eigenvector(matrixmultiply(transpose(x), x))

matrix(y, shape=hermitian)

i can only disclose some piece of it

@mehdi jafari 

would like to singularize existing function which can not be used as a constraint in optimization or numerically calculated

it is like protecting password

@Preben Alsholm 

just want to predict the future using commutative property, but i failed to find a function which make today's eigenvector matrix = future's eigenvector matrix ,

i struggled and feel that can not defeat the difference coming from decimal number itself. 

it seems predicted future value having difference with the actual one looks normal

@mehdi jafari 

i can not find a function which is commutative or anticommutative

that make today's eigenvector matrix = future's eigenvector

perhaps i have to not to use IsEqual, i should use less than 0.0001 for all elements in matrix,  it is very difficult to prove it commutative exactly , approximately it may satisfy some property such as orthogonal or commutative.

if future = today's something and today's something <> past's something,

or A=B, B<>C exist, it would be wonderful

if i predict future, future will tell me that you have not predict's difference which come from its difference, if continue to predict this difference , this will tell me that you have not predict difference's difference and continue recursively

just want a exact value of future

@Carl Love 

is it different from compactification of calabi yau from 11 dimension to 4 dimensions?

if so, how to do with physics package?

@Carl Love 

thanks, i succeed to prove not MP(A,B) can not move into MP to become MP(not A, not B)

since v become ^ and ^ become v, 

not MP(A,B) <> MP(B,A) too

not logic only make it from 1 to 0 and 0 to 1

Hi Carl,

i gave a concrete example in previous question, could you please take a look

@Carl Love 

this is concrete example

i am implementing Peter A. Flach's book Abduction and induction essays..., and simply logical book

page 91 of book Abduction and induction essays

generate hypothesis

Left Logical Equivalence   <----------- there is right one too in book, 

⊨ a <-> b, a |< c

----------------------

         b |< c

my guess that there are three ways to do this, input any kind of logic and match these logic run even if most possible is not match

another way is to convert input logic to become if and only if logic and |<

third way is to find  if and only if logic and |< relations in data

in fact this book do not have algorithm about how to generate hypothesis

and i do not understand prolog language in simply logical book, i only sense the

mechanism of this book is just swapping elements in tuples

to generate hypothesis i got another question, which i unify all logic into one logic type

(Observeration, Hypothesis) = (then,if)

I want to use all logic with just a custom logic MP(A,B), simply notation as (A,B)

and convert all basic logics into above definition

A -> B = (B,A)  --- implication
(not (not A)) v B = (B,not A) -- Disj
not (not (A ^ B)) = not( (not A) v (not B) ) = not(not B, A) -- Conj

since not logic go to ^ will make it become v, v will become ^

so, not logic can not go into MP(A,B)

Not logic will make MP(A,B) from 1 to 0 and 0 to 1

prove with following

@Markiyan Hirnyk 

without logic understanding, can not use maple to write logic function

all math questions are maple questions

@Carl Love 

to make it clear, i add bracket () , 

is

 (not (S[0] and S[1]) ) or p

correct?

if no S list, it is just p

i have still not understood why some rules in these, 

Entail( Empty, A -> B) , B |-> C

-----------------------------------------

                   Something

if S is empty , why don't they write

A -> B , B |-> C

-----------------------------------------

                   Something

i ask this because when programming these , should we concern the S list as a wildcard

to use whole logic  (not (S[0] and S[1]) ) or p rather than p

@Joe Riel 

would like to apply multiloop amplitude from superstring theory

i got another questions are that how to draw the diagram for multiloop?

how to decompose into dilation part, traceless part, and also the hidden Teichmuller parameters