Search Results for ""

The branch of mathematics which formalizes a number of algebraic properties of collections of transformations between mathematical objects (such as binary relations, groups, ...

The envelope of the lines connecting corresponding points on the Jacobian curve and Steinerian curve. The Cayleyian curve of a net of curves of order n has the same curve ...

Let X and Y be CW-complexes and let X_n (respectively Y_n) denote the n-skeleton of X (respectively Y). Then a continuous map f:X->Y is said to be cellular if it takes ...

An ellipse or hyperbola.

A point v is a central point of a graph if the eccentricity of the point equals the graph radius. The set of all central points is called the graph center.

Let P=alpha_1:beta_1:gamma_1 and Q=alpha_2:beta_2:gamma_2 be points, neither of which lie on a sideline of the reference triangle DeltaABC. The P-Ceva conjugate X of Q is ...

Suppose P=p:q:r and U=u:v:w are points, neither lying on a sideline of DeltaABC. Then the cevapoint of P and U is the point (pv+qu)(pw+ru):(qw+rv)(qu+pv) :(ru+pw)(rv+qw).

Chain equivalences give an equivalence relation on the space of chain homomorphisms. Two chain complexes are chain equivalent if there are chain maps phi:C_*->D_* and ...

The equation f(x_n|x_s)=int_(-infty)^inftyf(x_n|x_r)f(x_r|x_s)dx_r which gives the transitional densities of a Markov sequence. Here, n>r>s are any integers (Papoulis 1984, ...

A node which is one graph edge further away from a given node in a rooted tree.