Search Results for ""

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

The grid shading problem is the problem of proving the unimodality of the sequence {a_1,a_2,...,a_(mn)}, where for fixed m and n, a_i is the number of partitions of i with at ...

The Griewank function is a function widely used to test the convergence of optimization functions. The Griewank function of order n is defined by ...

"The" Griffiths point Gr is the fixed point in Griffiths' theorem. Given four points on a circle and a line through the center of the circle, the four corresponding Griffiths ...

When a point P moves along a line through the circumcenter of a given triangle Delta, the pedal circle of P with respect to Delta passes through a fixed point (the Griffiths ...

Grimm conjectured that if n+1, n+2, ..., n+k are all composite numbers, then there are distinct primes p_(i_j) such that p_(i_j)|(n+j) for 1<=j<=k.

A formula satisfied by all Hamiltonian cycles with n nodes. Let f_j be the number of regions inside the circuit with j sides, and let g_j be the number of regions outside the ...

Grinberg constructed a number of small cubic polyhedral graph that are counterexamples to Tait's Hamiltonian graph conjecture (i.e., that every 3-connected cubic graph is ...

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

An approach for the calculation of a Gröbner basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of inequalities.