Search Results for ""

For a connected graph G of graph diameter d, the distance-k graph G_k for k=1, ..., d is a graph with the same vertex set and having edge set consisting of the pairs of ...

A two-person game where each of the players can take as long as he likes to prepare his move, but the other can take advantage of his hesitation. In this conflict situation, ...

The roulette traced by a point P attached to a circle of radius b rolling around the outside of a fixed circle of radius a. These curves were studied by Dürer (1525), ...

In real and functional analysis, equicontinuity is a concept which extends the notion of uniform continuity from a single function to collection of functions. Given ...

Given a field F and an extension field K superset= F, if alpha in K is an algebraic element over F, the minimal polynomial of alpha over F is the unique monic irreducible ...

An exterior angle beta of a polygon is the angle formed externally between two adjacent sides. It is therefore equal to 2pi-alpha, where alpha is the corresponding internal ...

The formal term used for a collection of objects. It is denoted {a_i}_(i in I) (but other kinds of brackets can be used as well), where I is a nonempty set called the index ...

The eigenvector corresponding to the second smallest eigenvalue (i.e., the algebraic connectivity) of the Laplacian matrix of a graph G. The Fiedler vector is used in ...

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 set of algebraic invariants for a quantic such that any invariant of the quantic is expressible as a polynomial in members of the set. Gordan (1868) proved the existence of ...