296 reputation
17
bio website
location Mohali, India
age 23
visits member for 2 years, 1 month
seen May 9 at 3:21

Jul
29
awarded  Popular Question
Jul
2
awarded  Curious
Mar
24
comment Choosing $n$ equidistant points on a circle with given radius and center
Thanks to all. All answers are great. I am allowed to mark only one.
Mar
24
accepted Choosing $n$ equidistant points on a circle with given radius and center
Mar
21
comment Choosing $n$ equidistant points on a circle with given radius and center
Thank you for the illustrative suggestion. I also found a simple solution: circle = Table[{r Cos[2 \[Pi]/num *(i - 1)], r Sin[2 \[Pi]/num *(i - 1)]}, {i, 1, num + 1}].
Mar
21
asked Choosing $n$ equidistant points on a circle with given radius and center
Jan
13
comment Creating a standalone (executable) from mathematica code
I've done the same with Python -- thanks, it was a good choice !
Jan
13
accepted Creating a standalone (executable) from mathematica code
Dec
20
asked Creating a standalone (executable) from mathematica code
Dec
6
awarded  Yearling
Dec
2
accepted All possible solutions to the Matrix Equation (free variables appearing)
Oct
21
accepted Copying each object in a plot as an image
Oct
21
asked Copying each object in a plot as an image
Mar
20
comment Computing Ehrhart's polynomial for a convex polytope
Thanks whuber. You're right, its not useful in higher dimensions. For my applications, I am having to deal with inequalities having n variables and 2n constraints. Here n ~ 20 to 30 . Also, I had seen that computing the volume of a general polytope is #P-Hard. I am suspecting that computing the coefficients of its Erhart-Polynomial too is hard. But still I am in search of algorithms. I found this software called LattE which seems to be reasonably fast for n=10 . However, I do not know how to invoke commands of this software from within a mathematica notebook or a script.
Mar
19
comment Integrating polynomial functions over polytopes with an add-on package
This method certainly works well for small number of inequality constraints. However, my application involves more constraints that I think mathematica can handle with the above implementation. Just to confirm that I had taken some time - I had 5 free variables and 10 liner inequalities. When I started the computation on nohup, it ran for a while and said: No More Memory Available, Mathematica Kernel has shut down. Solving the inequalities is the real memory intensive process. I was wondering if I could directly input the vertices of a polytope instead of inequalities, it might be faster.
Mar
18
asked Syntax for integrating over limits specified by a Table
Mar
18
comment Integrating polynomial functions over polytopes with an add-on package
Thanks a lot for that quick help. It seems like its good for my purpose. However, I'll still wait for a while before am sure of it.
Mar
18
asked Computing Ehrhart's polynomial for a convex polytope
Mar
18
asked Integrating polynomial functions over polytopes with an add-on package
Mar
5
comment Transferring a list from one notebook to another
Thanks, I have made an edit by extending the question to a more general case. Is a text file still ok to use, to store the outputs from the first notebook ?