Search Results for ""

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

A square matrix A is antihermitian if it satisfies A^(H)=-A, (1) where A^(H) is the adjoint. For example, the matrix [i 1+i 2i; -1+i 5i 3; 2i -3 0] (2) is an antihermitian ...

Two points which are collinear with respect to a similitude center but are not homologous points. Four interesting theorems from Johnson (1929) follow. 1. Two pairs of ...

Define an antipode of a given graph vertex v_i as a vertex v_j at greatest possible graph distance from v_i. Then an antipodal graph is a connected graph in which each vertex ...

Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...

An antisymmetric matrix, also known as a skew-symmetric or antimetric matrix, is a square matrix that satisfies the identity A=-A^(T) (1) where A^(T) is the matrix transpose. ...

Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...

An antisymmetric (also called alternating) tensor is a tensor which changes sign when two indices are switched. For example, a tensor A^(x_1,...,x_n) such that ...

A topological two-sphere in three-space whose exterior is not simply connected. The outer complement of Antoine's horned sphere is not simply connected. Furthermore, the ...