Search Results for ""

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 ...

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.

A dozen dozen, or the square number 144.

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then an atomic statement ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic sentential formula Phi in Skolemized form forall x_1... forall x_nS, then a clause ...

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then a literal obtained from ...

A partially ordered set is defined as an ordered pair P=(X,<=). Here, X is called the ground set of P and <= is the partial order of P.

The center of a group is the set of elements which commute with every element of the group. It is equal to the intersection of the centralizers of the group elements.

The convolution of two complex-valued functions on a group G is defined as (a*b)(g)=sum_(k in G)a(k)b(k^(-1)g) where the support (set which is not zero) of each function is ...

The set of points of X fixed by a group action are called the group's set of fixed points, defined by {x:gx=x for all g in G}. In some cases, there may not be a group action, ...