- 21 Apr 2022, 19:10
- Forum: Helpdesk
- Topic: Is this the fastest way to compute the Betti numbers ?
- Replies:
**4** - Views:
**167**

polymake thinks of objects (here tropical::Hypersurface) as a list of properties (each of which comes with a type). There are defining properties (here MONOMIALS and COEFFICIENTS) which just specify what it is that you are talking about. Then there are derived properties (such as, e.g., the dimensio...

- 20 Apr 2022, 18:41
- Forum: Helpdesk
- Topic: Is this the fastest way to compute the Betti numbers ?
- Replies:
**4** - Views:
**167**

Indeed, the triangulation (induced by MONOMIALS and COEFFICIENTS) is the same. Yet your code already exploits this automatically. The property PATCHWORK is declared multiple (see apps/tropical/rules/patchwork.rules) which means that all the patchworks for all your choices of signs will be kept. Prob...

- 11 Apr 2022, 16:45
- Forum: General Discussion
- Topic: My polymake is running for more than 12hours
- Replies:
**1** - Views:
**202**

A polytope in 70 dimensions with 200 inequalities may have as many as 983858800923516812309510979394668240 vertices (by McMullen's upper bound theorem). Of course that number can also be much smaller. In general, there is no good way to tell ahead of time if such a computation is possible and how lo...

- 30 Mar 2022, 11:56
- Forum: General Discussion
- Topic: Scaling of mixed volume
- Replies:
**1** - Views:
**205**

All known algorithms for computing the mixed volume are exponential in the dimension. Since even computing the volume is known to be #P-hard there is no hope for any improvement.

- 06 Mar 2022, 20:37
- Forum: Helpdesk
- Topic: Static library/Linking Polymake C++ code for windows machine
- Replies:
**5** - Views:
**464**

One comment: to run polymake code on a pure Windows machine you could employ some live version of Linux, e.g., Ubuntu . And a question: which computation do you want to do with CPLEX? polymake is capable of solving (mixed integer) linear programs exactly. Of course, CPLEX is much faster (as it uses ...

- 04 Mar 2022, 17:36
- Forum: Helpdesk
- Topic: Equivalence between a PORTA output and Polymake output for same input
- Replies:
**1** - Views:
**198**

If "0 >= -1" occurs as a facet, then your polyhedron is necessarily unbounded. The converse, by the way, is not true. The thing is that combinatorially polymake treats all polyhedra as bounded polytopes (with a marked face at infinity, which may have any dimension). This has a number of algorithmic ...

- 03 Mar 2022, 18:42
- Forum: Helpdesk
- Topic: Accessing facets and affine hull data structures in C++
- Replies:
**6** - Views:
**438**

There are several things to consider then: (1) If you pass float coordinates as point coordinates of a Polytope object, then they will be converted to exact rationals automatically. (2) In general, there is no way (known) to "approximately" compute convex hulls with floats throughout. In dimension 3...

- 03 Mar 2022, 17:01
- Forum: Helpdesk
- Topic: Accessing facets and affine hull data structures in C++
- Replies:
**6** - Views:
**438**

(1)Is it safe to simply cast the Rational scalar to a double for further usage in my application? In general: no. Rational is an exact type, double is not. If a conversion makes sense or not will depend on what you want to compute. Usually, you just want to stick with Rational. polymake supports ar...

- 03 Mar 2022, 10:08
- Forum: Helpdesk
- Topic: Accessing facets and affine hull data structures in C++
- Replies:
**6** - Views:
**438**

A few more remarks: (1) Specifying polytopes in terms of a V-description works by providing POINTS. Using VERTICES is potentially more efficient, but this requires that the points (i.e., rows of the matrix) are actually, the vertices, and without repetitions. (2) We use a homogeneous coordinate mode...

- 01 Mar 2022, 10:38
- Forum: Helpdesk
- Topic: Running into a compile error on example C++ code
- Replies:
**11** - Views:
**657**

In addition to what Ewgenij said, you will need to make sure that the executable polymake-config is in your path.

Powered by phpBB® Forum Software © phpBB Limited