14 years, 9 days

## Perfect, thanks...

Thanks Alec, That's perfect. The `property/ConvertRelation`:=()->FAIL: is what I was missing.

## Perfect, thanks...

Thanks Alec, That's perfect. The `property/ConvertRelation`:=()->FAIL: is what I was missing.

## a clarification...

Thank you for the suggestion, but I think you've misunderstood what I'm trying to do. Perhaps I wasn't clear enough. vf is a mathematical function and each of the vx[i] are variables in that function. I don't need to ever solve it. All I want to be able to do is change the [] to () on the vectors in order to display the function appropriately in piecewise form. For reference though, in my particular case [a,b]<[c,d] means that either (a

## a clarification...

Thank you for the suggestion, but I think you've misunderstood what I'm trying to do. Perhaps I wasn't clear enough. vf is a mathematical function and each of the vx[i] are variables in that function. I don't need to ever solve it. All I want to be able to do is change the [] to () on the vectors in order to display the function appropriately in piecewise form. For reference though, in my particular case [a,b]<[c,d] means that either (a

## thanks...

Thanks Alec, That works well.

## thanks...

Thanks Alec, That works well.

## is it possible to loop this?...

Thank you for the suggestion. I tried this code and it works well but only for this specific case. I want to have a procedure that works for any list of inequalities in any number of variables. For some reason when I try solve(mylist) Maple complains that solve has invalid arguments. I also don't think solve will work for my multivariate lists. Any suggestions about how to make this code more general? Here is another angle I was attempting but it does some funny things with the assumptions too. > restart: > alist:=[x<5, x<7, x<8, x>2, x>4, x>-3, x<10]; > > interface(showassumed=0): > printlevel:=5; > b:=1; > while b<=nops(alist) do > assume(alist[b]): > i:=1; > while i <= nops(alist) do > if i<>b then > val[i]:=is(alist[i]); > if is(alist[i]) then > alist:=ListTools[Flatten]([[alist[1..i-1]],alist[i+1..nops(alist)]]); > i:=0; > end if; > end if; > i:=i+1; > end do; > b:=b+1; > end do; > > eval(alist); Any ideas?

## is it possible to loop this?...

Thank you for the suggestion. I tried this code and it works well but only for this specific case. I want to have a procedure that works for any list of inequalities in any number of variables. For some reason when I try solve(mylist) Maple complains that solve has invalid arguments. I also don't think solve will work for my multivariate lists. Any suggestions about how to make this code more general? Here is another angle I was attempting but it does some funny things with the assumptions too. > restart: > alist:=[x<5, x<7, x<8, x>2, x>4, x>-3, x<10]; > > interface(showassumed=0): > printlevel:=5; > b:=1; > while b<=nops(alist) do > assume(alist[b]): > i:=1; > while i <= nops(alist) do > if i<>b then > val[i]:=is(alist[i]); > if is(alist[i]) then > alist:=ListTools[Flatten]([[alist[1..i-1]],alist[i+1..nops(alist)]]); > i:=0; > end if; > end if; > i:=i+1; > end do; > b:=b+1; > end do; > > eval(alist); Any ideas?
 Page 1 of 1
﻿