Search Results for ""

A sequence of moves (i.e., a path) on a chessboard by a chess piece in which each square of a chessboard is visited exactly once.

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

A matrix for a round-robin tournament involving n players competing in n(n-1)/2 matches (no ties allowed) having entries a_(ij)={1 if player i defeats player j; -1 if player ...

A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

Let H be a Hilbert space and (e_i)_(i in I) an orthonormal basis for H. The set of all products of two Hilbert-Schmidt operators is denoted N(H), and its elements are called ...

A trace form on an arbitrary algebra A is a symmetric bilinear form (x,y) such that (xy,z)=(x,yz) for all x,y,z in A (Schafer 1996, p. 24).

Let Omega be a bounded open set in R^d whose boundary partialOmega is at least C^1 smooth and let T:C_c^1(Omega^_)->L^p(partialOmega) (1) be a linear operator defined by ...

A traceable graph is a graph that possesses a Hamiltonian path. Hamiltonian graphs are therefore traceable, but the converse is not necessarily true. Graphs that are not ...

The tractrix arises in the following problem posed to Leibniz: What is the path of an object starting off with a vertical offset when it is dragged along by a string of ...