Search Results for ""

The roots of a semisimple Lie algebra g are the Lie algebra weights occurring in its adjoint representation. The set of roots form the root system, and are completely ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

A statement about theorems. It usually gives a criterion for getting a new theorem from an old one, either by changing its objects according to a rule (duality principle), or ...

The first Napoleon point N is the concurrence of lines drawn between vertices of a given triangle DeltaABC and the opposite vertices of the corresponding inner Napoleon ...

A Lie algebra is nilpotent when its Lie algebra lower central series g_k vanishes for some k. Any nilpotent Lie algebra is also solvable. The basic example of a nilpotent Lie ...

The unsorted union of a list S is a list containing the same elements as S but with the second and subsequent occurrence of any given element removed. For example, the ...

Roughly speaking, a matroid is a finite set together with a generalization of a concept from linear algebra that satisfies a natural set of properties for that concept. For ...

There are two types of squares inscribing reference triangle DeltaABC in the sense that all vertices lie on the sidelines of ABC. The first type has two adjacent vertices of ...

A grammar defining formal language L is a quadruple (N,T,R,S), where N is a finite set of nonterminals, T is a finite set of terminal symbols, R is a finite set of ...

An automorphism of a graph is a graph isomorphism with itself, i.e., a mapping from the vertices of the given graph G back to vertices of G such that the resulting graph is ...