TOPICS
Search

Search Results for ""


10331 - 10340 of 13135 for TopologySearch Results
A forest is an acyclic graph (i.e., a graph without any graph cycles). Forests therefore consist only of (possibly disconnected) trees, hence the name "forest." Examples of ...
In mathematics, a formal language is normally defined by an alphabet and formation rules. The alphabet of a formal language is a set of symbols on which this language is ...
Consider the Euclid numbers defined by E_k=1+p_k#, where p_k is the kth prime and p# is the primorial. The first few values of E_k are 3, 7, 31, 211, 2311, 30031, 510511, ... ...
Four-dimensional geometry is Euclidean geometry extended into one additional dimension. The prefix "hyper-" is usually used to refer to the four- (and higher-) dimensional ...
The squared norm of a four-vector a=(a_0,a_1,a_2,a_3)=a_0+a is given by the dot product a^2=a_mua^mu=(a^0)^2-a·a, (1) where a·a is the usual vector dot product in Euclidean ...
A rational number expressed in the form a/b (in-line notation) or a/b (traditional "display" notation), where a is called the numerator and b is called the denominator. When ...
Let I(G) denote the set of all independent sets of vertices of a graph G, and let I(G,u) denote the independent sets of G that contain the vertex u. A fractional coloring of ...
The fractional edge chromatic number of a graph G is the fractional analog of the edge chromatic number, denoted chi_f^'(G) by Scheinerman and Ullman (2011). It can be ...
There are two sorts of transforms known as the fractional Fourier transform. The linear fractional Fourier transform is a discrete Fourier transform in which the exponent is ...
Denote the nth derivative D^n and the n-fold integral D^(-n). Then D^(-1)f(t)=int_0^tf(xi)dxi. (1) Now, if the equation D^(-n)f(t)=1/((n-1)!)int_0^t(t-xi)^(n-1)f(xi)dxi (2) ...

...