I am plotting a simple rational function. When the denominator is completely factored, the discont command works as expected. However, if the denominator is expanded, discont fails.

Why does this happen?

This behavior also occurs in Maple 17.

Download discont.mw

I have seen no posting on the following issue: on a high density monitor, example QHD+, where the resolution is 3200x1800, the titlebar, the palettes and the graphs are so small that they are essentially invisible. In addition, the symbols in the palettes overextend the edge of the palette. I see this with both Dell computers and Apple computers that run Maple under Windows. Is true with other computers? Is Maplesoft aware of this issue? I'm assuming it has something to do with the Java graphics library. Is there a solution?

SmithChart.mw
 If I want to plot Smith Chart ,how do I mark a circle of arbitrary values?

then,How do I avoid the polar line to cover other  circle line?

Any body can give me some ideas or better ways to plot Smith Chart?

Thanks.

Download SmithChart.mwSmithChart.mw

how to convert between (system of polynomials or module) and rational function which is a four dimensional space

1. is module in algebraic geometry or group cohomology to classify homology group?

2. is final result like this? for example,

a dictionary  or table store

homology group 1, key=invariant = 1 hole in topological space , value = module 1, module 2 module 3 etc

homology group 2, key=invariant = 2 holes in topological space , value =module 4, module 5, module 6 etc

homology group 3, key=invariant = 3 holes in topological space , value = module 7, module 8.. etc

 ... etc

3. i find betti number can count holes, however how to know the form for

all combination?

i mean if it is module, how to change the module to get the full combination

http://www.singular.uni-kl.de/Manual/html/sing_159.htm

i find betti number's input is just ideal, but it is not module

if ideal is enough, why need module?

how to permuate module? and what do it classify and result in module?

1. is module in algebraic geometry for classification of topological space which a poset is a frame

2. which invariant is for doing this classification of topological space in algebraic geometry or group cohomology?

3. if want to do full combination before classification, which kind of polynomials be a full combination

4. is poset just like function fst and snd function for meet and join in functional programming instead of using "and" and "or" logic? how a matrix group related with topological space which a poset is a frame?

5. is there any invariant function for classification of topological space in maple?

Hi,

   I have a set of linear equations in terms of Ax+B=0, where A and B are matrices.

  I used linsolve or LinearSolve to solve the equations.

   Is there any simple way to run linsolve/LinearSolve parallelly? suppose I already have matrices A and B.

Thank you very much

#page 320 and 322 of book Singular introduction to commutative algebra

it return too many recursion 

hilbertseries([a+a*c, a+a*b, a+b+c]);

eq1 := a+a*c;

eq2 := a+a*b;

eq3 := a+b+c;

eq1a := Homogenize(eq1, h);

eq2a := Homogenize(eq2, h);

eq3a := Homogenize(eq3, h);

T3:=lexdeg([a,b,c,h]);

GB := Basis([eq1a,eq2a,eq3a], T3); #a

#MonomialHilbertPoincare(LeadingMonomial(GB[1],T3), LeadingMonomial(GB[2],T3), LeadingMonomial(GB[3],T3));

with(PolynomialIdeals):

MonomialHilbertPoincare := proc (I3)

#I3:=[LeadingMonomial(GB[1],T3), LeadingMonomial(GB[2],T3), LeadingMonomial(GB[3],T3)];

T2:=lexdeg([h,c,b,a]);

varj := [h,c,b,a];

I2 := InterReduce(I3, T2);

s := nops(I2);

if I2[1] = 0 then return 1 end if:

if I2[1] = 1 then return 0 end if:

if degree(I2[s]) = 1 then return (1-varj[1])^s end if:

lt := LeadingTerm(I2[s],T2);

leadexp := [degree(lt[2],h),degree(lt[2],c),degree(lt[2],b),degree(lt[2],a)];

j := 1;

for z from 1 to nops(leadexp) do

                if leadexp[j] = 0 then

                                j := j + 1;

                end if:

od:

finallist := [];

for z from 1 to nops(GB) do

                finallist := [op(finallist), GB[z]+varj[j]];

od:

quotientlist := Generators(Quotient(GB, varj[j]));

finallist2 := [];

for z from 1 to nops(quotientlist) do

                finallist2 := [op(finallist2), op(z,quotientlist)];

od:

return MonomialHilbertPoincare(finallist) + varj[1]*MonomialHilbertPoincare(finallist2);

end proc;

F:=[LeadingMonomial(GB[1],T3), LeadingMonomial(GB[2],T3), LeadingMonomial(GB[3],T3)];

MonomialHilbertPoincare(F);

but if restart the program，the menu of Plot Builder is appear，in same function（x^2+y^2+(1/1000000000)*z-25 = 0），why thing like this happen？

when run the order like this, the menu of Plot builder disapper

Thank you in advance for your help

Hello,

How can I pde with maple?please explain completely,and other question :How can I solve pde with plot in maple because some questions dont have exact answer?

if DegreeLexicographic is T2:=lexdeg([a,b,c],[x,y,z]);

DegreeReverseLexicographic = T2:=lexdeg([c,b,a],[z,y,x])  ?

with(PolynomialIdeals):

quotientlist := Quotient(GB, varj[j]);
finallist2 := [];
for z from 1 to nops(quotientlist) do
if
finallist2 := [op(finallist2), op(z,quotientlist)];
od:

there are only 3 monomials in quotientlist, but nops return 6

Let a finite set of closed intervals in the plane be given.
How to find all the intersections of these, outputing the intersection points together with the intersecting intervals?
This is a problem of computational geometry
(see http://en.wikipedia.org/wiki/Line_segment_intersection).
In other words, how to realize the sweep line algorithm in Maple?

PS. I'd like to note that computational geometry has serious applications, in particular, in robotics.

how to compute the ideal mapping from ideal A to ideal B

Let Poly2 denote the vector space of polynomials

(with real coefficients) of degree less than 3.

Poly2 = {a1t^2+ a2 t+ a3 |a1; a2; a3 €R}

You may assume that {1,t; t^2}is a basis for Poly2.

(1) Show that L1 = {t^2 + 1; t-2 ; t + 3}and L2 = {2 t^2 + t; t^2 + 3; t}

are bases for Poly2.

(2) Let v = 8t^2- 4t + 6 and w = 7t^2- t + 9. Find the coordinates for

v and w with respect to the basis L1 and with respect to the basis L2

(3) find the coordinate change matrix P from the basis L1 to the basis L2.find P^-1

Just I answer part (1) can you help me to answer 2 and 3