Search Results for ""

A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...

A forgetful functor (also called underlying functor) is defined from a category of algebraic gadgets (groups, Abelian groups, modules, rings, vector spaces, etc.) to the ...

A fork of a tree T is a node of T which is the endpoint of two or more branches.

The fork graph, sometimes also called the chair graph, is the 5-vertex tree illustrated above. It could perhaps also be known as the 'h graph' (but not to be confused with ...

Given a differential p-form q in the exterior algebra ^ ^pV^*, its envelope is the smallest subspace W such that q is in the subspace ^ ^pW^* subset ^ ^pV^*. Alternatively, W ...

Consider the forms Q for which the generic characters chi_i(Q) are equal to some preassigned array of signs e_i=1 or -1, e_1,e_2,...,e_r, subject to product_(i=1)^(r)e_i=1. ...

A differential k-form can be integrated on an n-dimensional manifold. The basic example is an n-form alpha in the open unit ball in R^n. Since alpha is a top-dimensional ...

In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is ...

A formal power series, sometimes simply called a "formal series" (Wilf 1994), of a field F is an infinite sequence {a_0,a_1,a_2,...} over F. Equivalently, it is a function ...

In mathematics, a formula is a fact, rule, or principle that is expressed in terms of mathematical symbols. Examples of formulas include equations, equalities, identities, ...