|
Frobby 0.10.0
|
#include <vector>
Go to the source code of this file.
Functions | |
| void | generateLinkedListIdeal (BigIdeal &ideal, size_t varCount) |
| void | generateKingChessIdeal (BigIdeal &ideal, size_t rowsAndColumns) |
| void | generateKnightChessIdeal (BigIdeal &ideal, size_t rowsAndColumns) |
| void | generateRookChessIdeal (BigIdeal &bigIdeal, size_t n, size_t k) |
| void | generateMatchingIdeal (BigIdeal &bigIdeal, size_t n) |
| void | generateTreeIdeal (BigIdeal &ideal, size_t varCount) |
| bool | generateRandomEdgeIdeal (BigIdeal &ideal, size_t varCount, size_t generatorCount) |
| bool | generateRandomIdeal (BigIdeal &bigIdeal, size_t exponentRange, size_t varCount, size_t generatorCount) |
| void | generateRandomFrobeniusInstance (vector< mpz_class > °rees, size_t entryCount, const mpz_class &maxEntry) |
This file contains functions that generate data. They are NOT all random.
| void generateKingChessIdeal | ( | BigIdeal & | ideal, |
| size_t | rowsAndColumns ) |
Generate an ideal where 


| void generateKnightChessIdeal | ( | BigIdeal & | ideal, |
| size_t | rowsAndColumns ) |
Generate an ideal where 


| void generateLinkedListIdeal | ( | BigIdeal & | ideal, |
| size_t | varCount ) |
Generate an ideal of the form 

| void generateMatchingIdeal | ( | BigIdeal & | bigIdeal, |
| size_t | n ) |
Generate an ideal whose facets are the maximum matchings in an n-clique.
| bool generateRandomEdgeIdeal | ( | BigIdeal & | ideal, |
| size_t | varCount, | ||
| size_t | generatorCount ) |
Generate a random ideal where every edge is a product of two different variables. Returns true if the requested number of generators was achieved.
| void generateRandomFrobeniusInstance | ( | vector< mpz_class > & | degrees, |
| size_t | entryCount, | ||
| const mpz_class & | maxEntry ) |
Generate a random vector of numbers whose gcd is 1.
| bool generateRandomIdeal | ( | BigIdeal & | bigIdeal, |
| size_t | exponentRange, | ||
| size_t | varCount, | ||
| size_t | generatorCount ) |
Generate a random ideal with exponents in the range [0, exponentRange]. Returns true if the requested number of generators was achieved.
| void generateRookChessIdeal | ( | BigIdeal & | bigIdeal, |
| size_t | n, | ||
| size_t | k ) |
Generate an ideal in n*k variables. Each facet corresponds to a way of placing rooks on an n*k chessboard without any rooks being able to take any other rook in one move.
| void generateTreeIdeal | ( | BigIdeal & | ideal, |
| size_t | varCount ) |
Generate an ideal in varCount variables with minimal generators given by
![\[\left\langle
\left.
\left(
\prod_{i\in F}x_i
\right)^{n-|F|+1}
\right|
\emptyset\neq F\subseteq
\left\{
1,\ldots,n
\right\}
\right\rangle
,\]](form_76.png)
i.e. to get the minimal generators, take each square free monomial except the identity, and raise it to the power of varCount + 1 minus it's total degree.