Search Results for ""

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

If T is a linear transformation of R^n, then the null space Null(T), also called the kernel Ker(T), is the set of all vectors X such that T(X)=0, i.e., Null(T)={X:T(X)=0}. ...

Schur (1916) proved that no matter how the set of positive integers less than or equal to |_n!e_| (where |_x_| is the floor function) is partitioned into n classes, one class ...

An intrinsic property of a mathematical object which causes it to remain invariant under certain classes of transformations (such as rotation, reflection, inversion, or more ...

The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...

An acnode, also called an isolated point or hermit point, of a curve is a point that satisfies the equation of the curve but has no neighboring points that also lie on the ...

A function f(x) is said to be antiperiodic with antiperiod p if -f(x)=f(x+np) for n=1, 3, .... For example, the sine function sinx is antiperiodic with period pi (as well as ...

The Bevan circle, sometimes also called the excentral circle, is the circumcircle of the excentral triangle of the reference triangle, i.e., it is the circle passing through ...

Given a set of n+1 control points P_0, P_1, ..., P_n, the corresponding Bézier curve (or Bernstein-Bézier curve) is given by C(t)=sum_(i=0)^nP_iB_(i,n)(t), where B_(i,n)(t) ...

Given two positive integers n and k, the bipartite Kneser graph H(n,k) is the graph whose two bipartite sets of vertices represent the k-subsets and (n-k)-subsets of ...