TOPICS
Search

Search Results for ""


491 - 500 of 841 for Conjugate PairsSearch Results
In homogeneous coordinates, the first positive quadrant joins (0,1) with (1,0) by "points" (f_1,f_2), and is mapped onto the hyperbolic line -infty<u<+infty by the ...
An apodization function given by A(x)=(21)/(50)+1/2cos((pix)/a)+2/(25)cos((2pix)/a), (1) which has full width at half maximum of 0.810957a. This function is defined so that ...
The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...
The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...
The term "Cartesian" is used to refer to anything that derives from René Descartes' conception of geometry (1637), which is based on the representation of points in the plane ...
The problem of finding the number of different ways in which a product of n different ordered factors can be calculated by pairs (i.e., the number of binary bracketings of n ...
Two nonisomorphic graphs are said to be chromatically equivalent (also termed "chromically equivalent by Bari 1974) if they have identical chromatic polynomials. A graph that ...
A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...
The connected sum M_1#M_2 of n-manifolds M_1 and M_2 is formed by deleting the interiors of n-balls B_i^n in M_i^n and attaching the resulting punctured manifolds M_i-B^._i ...
In general, a cross is a figure formed by two intersecting line segments. In linear algebra, a cross is defined as a set of n mutually perpendicular pairs of vectors of equal ...
1 ... 47|48|49|50|51|52|53 ... 85 Previous Next

...