Search Results for ""

An Eulerian path, also called an Euler chain, Euler trail, Euler walk, or "Eulerian" version of any of these variants, is a walk on the graph edges of a graph which uses each ...

An ascending chain of subspaces of a vector space. If V is an n-dimensional vector space, a flag of V is a filtration V_0 subset V_1 subset ... subset V_r, (1) where all ...

If S is any nonempty partially ordered set in which every chain has an upper bound, then S has a maximal element. This statement is equivalent to the axiom of choice. Renteln ...

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

An exact sequence is a sequence of maps alpha_i:A_i->A_(i+1) (1) between a sequence of spaces A_i, which satisfies Im(alpha_i)=Ker(alpha_(i+1)), (2) where Im denotes the ...

A differential equation or system of ordinary differential equations is said to be autonomous if it does not explicitly contain the independent variable (usually denoted t). ...

A stochastic matrix, also called a probability matrix, probability transition matrix, transition matrix, substitution matrix, or Markov matrix, is matrix used to characterize ...

The method of d'Alembert provides a solution to the one-dimensional wave equation (partial^2y)/(partialx^2)=1/(c^2)(partial^2y)/(partialt^2) (1) that models vibrations of a ...

The Tilley graph is a polyhedral graph that arises in the investigation of Kempe chainsKempe Chain (Tilley 2018). It has 12 vertices, 29 edges, and 19 faces (one of which is ...

An alkane graph is a tree in which vertices correspond to atoms and edges to carbon-carbon or hydrogen-carbon bonds in a chemical alkane. In chemistry, an alkane is an ...