and if such
configured, the configuration need to be changed in all PEs/RRs. I am trying to
understand VPN technologies, and don't know if there are general
practise/guidelines to use them unless it is spelled out in spec.
Santanu.
-Original Message-
From: Robert Raszuk [mailto:rob
2nd Try
From: Santanu Paul
Sent: 17 April 2013 17:50
To: l3vpn@ietf.org
Subject: Query regarding rfc4684 Constrained Route Distribution
Hi,
This spec says This mechanism is applicable to any BGP NLRI
that controls the distribution of routing information by using Route Targets
Dear all,
Thank you very much for your help.
With regards,
Santanu
On 21 April 2013 07:02, Martin Albrecht martinralbre...@googlemail.comwrote:
sage: B.a,b,c = BooleanPolynomialRing()
sage: f=a+b*c
sage: from sage.sat.converters.polybori import CNFEncoder
sage: from
Dear all,
I want to convert the polynomial f into Conjunctive Normal Form (CNF)
in Sage. How can I do this?
B.a,b,c = BooleanPolynomialRing()
f=a+b*c
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop
Dear all,
I have a Boolean polynomial f with huge degree variables.
Also it has huge number of monomials.
I want to delete all monomials from f with degree greater
than 20. For that I have written the following approach.
V=BooleanPolynomialRing(4,['r%d'%(i) for i in range(4)])
When I run the following code, I have
Traceback (click to the left of this block for traceback)
...
AssertionError
from sage.crypto.boolean_function import BooleanFunction
R.x0, x1, x2, x3, x4, x5=BooleanPolynomialRing(6)
C=[x0, x0 + x1, x1 + x2, x3, x2 + 1, x4 +x5]
tt=cputime()
I =
Dear all,
I have a set non linear equations over Boolean variables x_1,...,
x_{1}.
Sat solver gives I=[{x1: 0, x100: 1, .}]. I am interested to see only
the values
of x1,.., x100. Will you kindly help me ?
--
You received this message because you are subscribed to the Google Groups
Sorry, I can not understand the approach.
Let I=[{x0:1, x1: 0, y0: 1}]. Suppose I want to find only x0 and x1.
How is it possible?
On 26 February 2013 16:37, akhil lalwani.ak...@gmail.com wrote:
On Tuesday, February 26, 2013 1:40:26 PM UTC+5:30, Santanu wrote:
Dear all,
I have a set
][x0].
Hoping that this will help you.
Best regards.
Christophe.
2013/2/26 Santanu Sarkar sarkar.santanu@gmail.com
Sorry, I can not understand the approach.
Let I=[{x0:1, x1: 0, y0: 1}]. Suppose I want to find only x0 and x1.
How is it possible?
On 26 February 2013 16:37, akhil
Dear all,
I need two arrays of Boolean variables. So I have written
R=BooleanPolynomialRing(2,['x%d'%(i+1) for i in range
(1)]+,['y%d'%(i+1) for i in range (1)] )
R.inject_variables()
Now in one array A, I want to store x1,..,x1 and in another array B
want to store
Dear all,
Using R.variable(), I can solve the first problem.
On 27 February 2013 07:20, Santanu Sarkar sarkar.santanu@gmail.comwrote:
Dear all,
I need two arrays of Boolean variables. So I have written
R=BooleanPolynomialRing(2,['x%d'%(i+1) for i in range
(1)]+,['y%d'%(i+1
My version is sage-5.6-linux-32bit-ubuntu_12.04.1_lts-i686-Linux.
On 19 February 2013 08:46, Santanu Sarkar sarkar.santanu@gmail.comwrote:
Dear all,
when I type notebook(), I get the following error.
Will you kindly help me?
sage: notebook
2013 05:16, Santanu Sarkar
sarkar.santanu@gmail.comwrote:
Dear all,
when I type notebook(), I get the following error.
Will you kindly help me?
sage: notebook()
---
EOFError
Thank you very much.
On 16 February 2013 21:50, akhil lalwani.ak...@gmail.com wrote:
On Saturday, February 16, 2013 9:38:14 AM UTC+5:30, Santanu wrote:
Dear all,
I have the following problem.
I am working with Boolean variables. So I call the following.
from
Dear all,
when I type notebook(), I get the following error.
Will you kindly help me?
sage: notebook()
---
EOFError Traceback (most recent call last)
/home/a/.sage/ipython console in
Dear all,
I have the following problem.
I am working with Boolean variables. So I call the following.
from sage.crypto.boolean_function import BooleanFunction
R.x0,x1,x2,x3,x4,x5,x6,x7,x8,x9=BooleanPolynomialRing(10)
Suppose during run time of my code, I get three polynomials
x1*x2+x3+x4,
I want to solve a polynomial over ring.
However my code does not work.
N=8
R.x=Integers(N)[]
f=x^2-1
print f.roots()
In my case, N is always a power of 2.
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To unsubscribe from this group and stop
Thank you.
On 30 January 2013 10:17, Charles Bouillaguet charles.bouillag...@gmail.com
wrote:
On Jan 30, 2013, at 3:20 PM, Santanu Sarkar wrote:
N=8
R.x=Integers(N)[]
f=x^2-1
print f.roots()
Try :
sage: print f.roots(multiplicities=False)
[1, 3, 5, 7]
It's a start
Hi,
I have separated Contact app and Contact Provider app from android 4.0.3
and installed successfully in mobile. Now I have created a contact entry
using that Contact app and saw that the contact2.db is created in the
following folder. *
I have written following code:
R=Integers(30)['X']
f1=X-10
f2=X-30
print f1*f2
This gives X^2-40*X+300
However I want coefficients to be modulo 30 i.e., 40 =10 , 300=0 in R.
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To post to this
. *
**
**
sage: from sage.sat.solvers import SatSolver
sage:
On Monday 24 Dec 2012, Santanu Sarkar wrote:
Dear all,
To solve a SAT problem, when I have written the following, I got error.
from
Dear all,
To solve a SAT problem, when I have written the following, I got error.
from sage.structure.sequence import Sequence
from sage.rings.infinity import PlusInfinity
from sage.sat.solvers import SatSolver
from sage.sat.converters import ANF2CNFConverter
Traceback (click to the left of
that we still not have test cases where persistent open is done
with parent lease(directory leasing) key.
In case I have extra test cases other than currently added one I will get
back to you.
Thanks and regards,
Santanu
On Mon, Dec 17, 2012 at 5:48 PM, Stefan (metze) Metzmacher
me
Is there any function in Sage by which this kind of symbolic calculation
is possible?
s=0
for i=1 to m
if(ia+t)
s=s+2i
else
s=s+t
m,a,t are non negative integers.
--
You received this message because you are subscribed to the Google Groups
sage-support
on that filed.
Can anyone let me know the process for that?
Thanks in advance,
Santanu
--
To unsubscribe from this list go to the following URL and read the
instructions: https://lists.samba.org/mailman/options/samba
Thank you very much for your help.
On 9 December 2012 12:18, Georgi Guninski gunin...@guninski.com wrote:
On Sat, Dec 08, 2012 at 11:44:19AM +0530, Santanu Sarkar wrote:
Dear all,
I have a system of non linear equations over GF(2). How to solve
them in Sage?
If you need to solve
I have a set of non-linear
equations over a prime field.
I want to solve them using
Groebner basis technique.
When I want to calculate
Groebner basis, I have following error.
verbose 0 (3292: multi_polynomial_ideal.py, groebner_basis) Warning:
falling back to very slow toy implementation.
When I went through 1.0 spec, I interpreted cookie as a field to help
controller get rid of large lookups while getting flow remove from switch.
1. Flow table has been divided in Header, Counter, Action with definition
Header fields to match against packet (Sec 3), so definitely cookie is out
),2)
sage: S = AA.subscheme(x^2+y^2)
sage: S.point_set().points()
[(0, 0), (1, 1)]
On Saturday, December 8, 2012 6:14:19 AM UTC, Santanu wrote:
I have a system of non linear equations over GF(2). How to solve
them in Sage?
Cheers,
Martin
--
name: Martin Albrecht
_pgp: http
Dear all,
I have a system of non linear equations over GF(2). How to solve
them in Sage?
--
You received this message because you are subscribed to the Google Groups
sage-support group.
To post to this group, send email to sage-support@googlegroups.com.
To unsubscribe from this group, send
. The crazies
must feel included.
Santanu.
From: assam [assam-boun...@assamnet.org] on behalf of Dilip Deka
[dilipd...@yahoo.com]
Sent: Wednesday, November 14, 2012 7:46 AM
To: A Mailing list for people interested in Assam from around the world
Subject: Re
last frontier in America may simply be
a reflection of that.
Santanu.
-Original Message-
From: assam [mailto:assam-boun...@assamnet.org] On Behalf Of Chan Mahanta
Sent: Wednesday, November 14, 2012 8:55 AM
To: A Mailing list for people interested in Assam from around the world
I have written the following:
T=[0]*2
S=[]
l=2
for i in range(l):
T[0]=i
T[1]=i+1
print T
S.append(T)
Now S becomes [[1, 2], [1, 2]] instead of [[0,1],[1,2]].
In my situation, length l of S is not fixed. Is there any
method to solve this problem?
--
You received this message
[
https://issues.apache.org/jira/browse/FLEX-33046?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanelfocusedCommentId=13464502#comment-13464502
]
Santanu Karar commented on FLEX-33046:
--
As Btravis mentioned 'Attached patch would
When I want to write a matrix, I have the following error.
sage: matrix(ZZ,2,2,[1,2,3,4])
---
AttributeErrorTraceback (most recent call last)
C-da:
This is delightful! Three years of aging, did you say? I think you should be
prepared for a run on your mead. Waiting eagerly for further posts -
Santanu.
From: assam-boun...@assamnet.org [assam-boun...@assamnet.org] on behalf of Chan
Mahanta
http://www.thehindu.com/opinion/op-ed/article3466554.ece#.T8ZClV4fjHw.email
___
assam mailing list
assam@assamnet.org
http://assamnet.org/mailman/listinfo/assam_assamnet.org
When I use the following code it returns 0.
var('x y')
def f1(x,y):
if(x+y 5):
return x+y
else:
return 0
integral(integral(f1(x,y), x, 0,1), y, 0, 1)
whereas
integral(integral(x+y, x, 0,1), y, 0, 1)
returns 1.
Can any one point out the reason for this discrepancy
open display:
Run 'virt-viewer --help' to see a full list of available command line options
Does anyone know what might be the problem? Reinstalling virt-manager
didn't bring any good. Any help would be appreciated.
Cheers,
Santanu
___
virt-tools
How to generate 1000 random integers which follow normal
distribution with mean 0 and variance 0.1?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Thanks for the help.
On 17 February 2012 16:00, Vegard Lima vegard.l...@gmail.com wrote:
On Fri, Feb 17, 2012 at 10:52 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
How to generate 1000 random integers which follow normal
distribution with mean 0 and variance 0.1?
You can do
I need to reduce a lattice of dimension
200 with its entries sizes are of size like 3000 bit. I use
LLL(algorithm=fpLLL:fast)
for faster lattice reduction. But it seems there is a problem in the
function. Reduction is
very bad. Is there any way to reduce this size of matrix efficiently?
--
To
Hi all,
I have used the function E,N1=M2.hermite_form(transformation=True)
to compute the Hermite Normal Form and
observed that it is very slow. Is there any better function?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
M2 is a (50, 50) matrix. Its entries are large (2048 bit).
On 16 February 2012 09:32, William Stein wst...@gmail.com wrote:
On Thu, Feb 16, 2012 at 9:23 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
Hi all,
I have used the function E,N1=M2.hermite_form(transformation=True
No, that I do not know. I run my code half an hour. But still donot get result.
On 16/02/2012, William Stein wst...@gmail.com wrote:
On Thu, Feb 16, 2012 at 9:53 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
M2 is a (50, 50) matrix. Its entries are large (2048 bit).
On 16 February
Daer all,
Is there any function in Sage by which we can calculate the area of a plot?
Actually I have many intersecting circles. I want to find the area covered
by them. Note that here total area is not sum of area of each circle.
--
To post to this group, send email to
Thanks for the help.
On 21 January 2012 07:27, Maarten Derickx m.derickx.stud...@gmail.com wrote:
Well the way I first tried is as follows:
age: F.x=GF(2)[]
sage: G.a=F.quotient(x^6 + x^4 + x^2 + x + 1)
sage: a.multiplicative_order()
Yes, exactly that we mean.
On 19 January 2012 20:13, John Cremona john.crem...@gmail.com wrote:
On 19 January 2012 15:39, Santanu Sarkar sarkar.santanu@gmail.com wrote:
Consider a polynomial f(x) over GF(2)[x]. How is it possible
to find the order of the cyclic group generated by f(x
I have a sequence of 0 and 1. I know that period is small. Is there
any function in Sage by which
I can find the period? Or, can we find the period efficiently?
For example {0,1,0,1,0,1} has period of length 2.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe
Thank you very much.
On 20 January 2012 20:57, David Joyner wdjoy...@gmail.com wrote:
On Fri, Jan 20, 2012 at 9:56 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
I have a sequence of 0 and 1. I know that period is small. Is there
any function in Sage by which
I can find the period
Consider a polynomial f(x) over GF(2)[x]. How is it possible
to find the order of the cyclic group generated by f(x)?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options,
Sorry. I get the function.
On 17 January 2012 18:58, Santanu Sarkar sarkar.santanu@gmail.com wrote:
Thanks. But this function gives only prime factors. Is there any
function which gives
all divisor?
On 17 January 2012 00:39, Renan Birck Pinheiro renan.ee.u...@gmail.com
wrote:
2012/1
Pascal Sancho pascal.sancho at takoma.fr writes:
Hi Santanu,
on this list we start with XSL-FO as input, so you should explain what
do you expect precisely as output rendering, what do you get, and
provide a short XSL-FO snippet as material if taht can help (see [1]).
Your question may
Is there any function in Sage by which I can get the
number of prime factors, number of factors of a
positive ineger?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options,
I have a Boolean Function f which I know is not balanced. In fact f=0
with probability 1/4. If I use the function f.is_balanced() it tells
me that the function is not balanced, which is fine.
But is there a function which will tell me the what the probability of
a Boolean function being zero is ?
I have a set of Boolean functions like
A[0]=x1*x2+x3*x4
A[1]=x3+x7+x10
A[2]=x19*x36+x43*x45*x50
over variables x_1,.. x_50.
But each function contains at most 10 variables.
I want to calculate the balancedness of each function.
I have done the following:
from sage.crypto.boolean_function import
Sorry I meant to write
But it does not work
apologies for the typo
On 12 December 2011 07:49, Santanu Sarkar sarkar.santanu@gmail.com wrote:
I have a set of Boolean functions like
A[0]=x1*x2+x3*x4
A[1]=x3+x7+x10
A[2]=x19*x36+x43*x45*x50
over variables x_1,.. x_50.
But each function
Hello,
Let S be a symbolic expression of a certain number of variables taken
from a particular set of variables. How do I find out the list of the
distinct variables that S depends on?
Suppose {x0,x1,x2,x3,x4,x5,x6,x7,x8,x9} is a set of unknowns and S =
x1 + x3*x4 + x5*x7*x9. I need to find the
', but the again, the
application could not connect to the internet.
Please let me know if I should have done something else.
Regards,
Santanu Chatterjee
--
You received this bug notification because you are a member of Ubuntu
Bugs, which is subscribed to Ubuntu.
https://bugs.launchpad.net/bugs/863569
Public bug reported:
I have the feeling that software-center must be relying only on some
dbus signal to know of availability of net connection. wvdial probably
does not use dbus.
** Affects: software-center (Ubuntu)
Importance: Undecided
Status: New
--
You received this bug
Thank you.
On 23 September 2011 10:38, D. S. McNeil dsm...@gmail.com wrote:
On Fri, Sep 23, 2011 at 12:39 AM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
I want to find integer such that
x= 1 mod 3
x=2 mod 5
x=3 mod 7
like this system of congruences using Chinese Remainder
I want to find integer such that
x= 1 mod 3
x=2 mod 5
x=3 mod 7
like this system of congruences using Chinese Remainder Theorem.
In Sage, crt() function takes only 4 argument.
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
Hi all,
I want to use cython.
The following code does not work
%cython
cdef P
P = next_prime(ZZ.random_element(2^(100-1),2^100))
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For
It always returns 101, not a random prime of 100 bit integer.
On 17 September 2011 18:04, Rajeev Singh rajs2...@gmail.com wrote:
On Sat, Sep 17, 2011 at 5:46 PM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
Hi all,
I want to use cython.
The following code does not work
Thank you.
Is there any function in Python for inverse modulo of an integer?
Corresponding Sage function is A=15.inverse_mod(17).
Also is there any function like
''.join(str(i) for i in A) in Python for an array A?
On 17 September 2011 19:36, D. S. McNeil dsm...@gmail.com wrote:
It always
Dear Maarten,
Sorry for delay. Version of my Chrome is 5.0.375.70.
I have written programs in SAGE 4.2 over Linux Ubuntu 8.04 on a computer
with Dual CORE Intel(R) Pentium(R).
With regards,
Santanu
On 26 August 2011 13:46, Maarten Derickx m.derickx.stud...@gmail.comwrote:
Dear Santanu,
I
For mozilla firefox, it is perfect. I dont known about other browsers.
On 1 September 2011 15:30, Maarten Derickx m.derickx.stud...@gmail.comwrote:
Maybe it's time to install a newer version of sage. 4.2 is quite old now,
the latest stable release is now 4.7.1. Could you please, still also
How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
field GF(2^10)?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Dear Simon,
Thanks a lot.
With regards,
Santanu
On 25 August 2011 23:02, Simon King simon.k...@uni-jena.de wrote:
Hi Santanu!
On 25 Aug., 18:03, Santanu Sarkar sarkar.santanu@gmail.com
wrote:
How to calculate inverse of a polynomial f(x) modulo g(x) in the finite
field GF(2^10
I generate integers from [0,63] and I always want to expressed as 6 bit
integer and store in an array of length 6.
So,
1= 01
2=10
like this way.
Is there any such approach in Sage?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group,
Dear Maarten,
Thank you very much for your effort. I use Google Chrome and 'tab' key is
not working.
Thank you again.
With regards,
Santanu
On 26 August 2011 03:22, Maarten Derickx m.derickx.stud...@gmail.comwrote:
Dear Santanu,
I noticed that you asked quite a few easy questions
is a .bat which would:
1. set the JAVA_HOME
2. prompt me for the Ant target I want to run
3. run the ant target
Thanks again for a few tips for this Ant rookie,
Brian
2011/8/23 Parag Doke parag.d...@gmail.com
One more suggestion (same as the last email from Santanu) ...
Please try
Let A=(1,1,0,0,0,1) be an binary array. How efficiently can we calculate the
corresponding integer?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
Thanks. Is there more efficient than this?
On 24 August 2011 00:59, Tom Boothby tomas.boot...@gmail.com wrote:
Treat it as a binary number:
s = ''.join(str(i) for i in A)
ZZ(s, base=2)
On Tue, Aug 23, 2011 at 12:08 PM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
Let
, also try
putting jdk.1.6.0_23 and apache-ant-1.8.2 in a folder which does not
contain spaces.
Thanks,
Santanu
From:
Brian FitzGerald bmfitzgera...@gmail.com
To:
user@ant.apache.org
Date:
08/22/2011 03:08 PM
Subject:
Ant not respecting JAVA_HOME
I have set JAVA_HOME and ANT_HOME environment
Have you done this?
C:\Users\Briancd C:\AntTest
C:\AntTestset JAVA_HOME=C:\Program Files\Java\jdk.1.6.0_23
C:\AntTestset ANT_HOME=C:\Program Files\Apache Software
Foundation\apache-ant-1.8.2
C:\AntTest%ANT_HOME%\bin\ant
The above should work. Which version of Ant you are using?
Thanks,
Santanu
Brian,
you can try this as well
C:\Users\Briancd C:\AntTest
C:\AntTestset JAVA_HOME=C:\Program Files\Java\jdk.1.6.0_23
C:\AntTestset ANT_HOME=C:\Ant
C:\AntTestset path=%JAVA_HOME%\bin
C:\AntTestjava -classpath %ANT_HOME%\lib\ant-launcher.jar
-Dant.home=c:\ant
I generate the figure using Sage code.
In the figure I want to label y axis as $\beta\rightarrow$.
Is there any option for this in Sage?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
I have 64 bit integer N. I want to rotate bits of N cyclically 5 bits right
and 5 bits left to generate two integers N1, N2.
How can I do this in Sage efficiently?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
I have a matrix of size (512,512) with real entries. I want to inverse this
matrix efficiently. How can I do this in Sage?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more
Thanks for the information.
On 28 July 2011 01:20, achrzesz achrz...@wp.pl wrote:
sage: MS=MatrixSpace(RDF,512,512)
sage: A=MS.random_element()
sage: timeit('B=A.inverse()')
5 loops, best of 3: 41 ms per loop
--
To post to this group, send email to sage-support@googlegroups.com
To
Size of the matrix is (30,16). Entries are at least 3000 bit integer.
On 17 July 2011 19:21, William Stein wst...@gmail.com wrote:
On Thu, Jul 14, 2011 at 11:26 PM, Santanu Sarkar
sarkar.santanu@gmail.com wrote:
I want to find Echelon Form using following:
E,U=M3.echelon_form
I want to find Echelon Form using following:
E,U=M3.echelon_form(transformation=True)
But it terminates with the following message:
*** the PARI stack overflows !
current stack size: 1600 (15.259 Mbytes)
[hint] you can increase GP stack with allocatemem()
Traceback (click to the left
I have two matrix A, B with same number of rows. I want lattice reduction
on B.
During this reduction, I changes rows of A accordingly. That is if i-th row
and j-th row
in B interchanges, swap i-th row and j-th row of A. Similar for other
elementary row
operations.
How can I do efficiently this
How to find the nearest integer (+ve or -ve) of a rational number (P/Q)
where P,Q are very large integers?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this
I have written following Lattice Reduction Algorithm. However, it does not
work properly (does not matche with the LLL algorithm
implemented in Sage). It will be great for me if any one check the program.
# LLL Algorithm
M=matrix(ZZ,4,4,
[1,57,67,75,
3,4,98,98,
34,23,267,111,
6,134,125,68
])
Let h = -2*b*(3*t1^2*(t2 + 1) + 6*t1*(t2 + 1) + 3*t2 + 2) - 2*g*(6*t1*t2 +
3*t1 + 6*t2 + 2) - 3*t1*t2^2 + 6*t1*t2 + 3*t1 - 3*t2^2 + 3*t2 + 1.
Also let 0g 0.15 with spacing 0.001, I want to find maximum value of b
such that h=0 for any non-negative reals t1, t2.
--
To post to this group, send
I have a set S of monomials in x1, x2, x3, x4 like
S=[x3x4,x2x3,x1x4,x4,x3,x1x2,x1,x2,1]. I want to rearrange S in
Lexicographic ordering like
S=[1,x1,x2,x1x2,x3,x2x3,x4,x1x4, x3x4].
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send
I want to find the common positive solutions of two polynomials f_a(x,y),
g_a(x,y) where a runs from 0 to 1 with an interval 0.01.
It seems there is a problem in Sage. I tried in Mathamatica but could not
succeed as follows:
For[a=0,a1,a=a+0.01,Solve[{x^2+a*x+y==0, 2*x*a+y^2+a==0},{x,y}]]
--
To
For these particular case, there may not be any common solution. But I want
to find the general approach.
On 23 June 2011 23:29, john_perry_usm john.pe...@usm.edu wrote:
Sorry -- I meant, they don't seem to have common intersections in the
*positive* quadrant.
On Jun 23, 12:44 pm,
Thanks a lot.
On 20 May 2011 13:21, Simon King simon.k...@uni-jena.de wrote:
Sorry, I somehow managed to click the send button before it was
ready.
On 20 Mai, 09:43, Simon King simon.k...@uni-jena.de wrote:
Please refer some books or study materials.
With a strong computer algebra
it does not work.
Have you any idea about this? Parametric solution is also fine.
regards,
Santanu
On 17 May 2011 14:27, Simon King simon.k...@uni-jena.de wrote:
Hi Santanu,
On 16 Mai, 16:27, Santanu Sarkar sarkar.santanu@gmail.com wrote:
I have three polynomials
f=x^2 + y^2 + z^2 - 1
g
I want to find the common solution of
x0^2+y0^2+x1^2+y1^2+x2^2+y2^2-1, (x1+x2+2x0)^2+(y1+y2+2y0)^2+2(x0^2+y0^2)-1,
(x1+x2+2x0)x0+(y1+y2+2y0)y0+x0x1+y0y1+x0x2+y0y2,
x0^2+y0^2+2x1x2+2y1y2 over reals. Parametric solution is also fine.
--
To post to this group, send email to
Dear Simon,
Thanks for your effort. Just two algebraic question.
1. What is the dimension of an ideal in a polynomial ring?
2. If number of variable is n and dimension of ideal is m,
is the number of parameter n-m?
Please refer some books or study materials.
With regards,
Santanu
On 19
of samba shares
from windows client?
Thanks and regards,
Santanu
--
To unsubscribe from this list go to the following URL and read the
instructions: https://lists.samba.org/mailman/options/samba
I have three polynomials
f=x^2 + y^2 + z^2 - 1
g= x^2+2*y*z
h= (y+z+2*x)^2+2*x^2 -1.
I want to find the common roots in real.
What should be approach in complex?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
I want to find x using Chinese Remainder Theorem such that
x=a_1 mod b_1
x=a_2 mod b_2
x=a_3 mod b_3
x=a_4 mod b_4
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options,
How to plot
x^2 +y^2+z^2 =1 and x^2+y^2+2z^2 =1 where -1=x,y,z=1 in 3d?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from this group, send email to
sage-support+unsubscr...@googlegroups.com
For more options, visit this group at
If I want to find the roots of x^2-2 in reals, I use the following approach.
R.x=RR[]
f=x^2-2
f.roots()
But, it gives the rational approximation. Is it possible to find the
exact root (irrational form)?
--
To post to this group, send email to sage-support@googlegroups.com
To unsubscribe from
would perform differently; I or someone like I
can do it. By saying this, I exult my moral superiority. It is so easy to
sell this creed to I. You?, well I am not so sure about you :-).
Santanu.
From: assam-boun...@assamnet.org [assam-boun...@assamnet.org
201 - 300 of 1081 matches
Mail list logo
