Search Results for ""

A sorting algorithm which makes n passes over a set of n elements, in each pass selecting the smallest element and deleting it from the set. This algorithm has running time ...

Consider a second-order differential operator L^~u(x)=p_0(d^2u)/(dx^2)+p_1(du)/(dx)+p_2u, (1) where u=u(x) and p_i=p_i(x) are real functions of x on the region of interest ...

Let A be a C^*-algebra. An element a in A is called self-adjoint if a^*=a. For example, the real functions of the C^*-algebra of C([a,b]) of continuous complex-valued ...

A lattice polygon consisting of a closed self-avoiding walk on a square lattice. The perimeter, horizontal perimeter, vertical perimeter, and area are all well-defined for ...

A point process N is called self-correcting if cov(N(s,t),N(t,u))<0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...

A self-dual graphs is a graph that is dual to itself. Wheel graphs are self-dual, as are the examples illustrated above. Naturally, the skeleton of a self-dual polyhedron is ...

A point process N is called self-exciting if cov(N(s,t),N(t,u))>0 for s<t<u where here, cov denotes the covariance of the two quantities. Intuitively, a process is ...

A self-isogonal cubic us a triangle cubic that is invariant under isogonal conjugation. The term is commonly applied to mean a pivotal isogonal cubic, in which points P lying ...

A self-isotomic cubic us a triangle cubic that is invariant under isotomic conjugation. The term is commonly applied to mean a pivotal isotomic cubic, in which points P lying ...

A triangle that is equal to its polar triangle with respect to a given conic is said to be self-polar with respect to that conic. Any triangle is self-polar with respect to ...