TOPICS
Search

Search Results for ""


2251 - 2260 of 13135 for Discrete groupSearch Results
A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
Any bounded planar region with positive area >A placed in any position of the unit square lattice can be translated so that the number of lattice points inside the region ...
The qubit |psi>=a|0>+b|1> can be represented as a point (theta,phi) on a unit sphere called the Bloch sphere. Define the angles theta and phi by letting a=cos(theta/2) and ...
Let (x_0x_1x_2...) be a sequence over a finite alphabet A (all the entries are elements of A). Define the block growth function B(n) of a sequence to be the number of ...
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 ...
An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...
Polynomials s_k(x;lambda) which form a Sheffer sequence with g(t) = 1+e^(lambdat) (1) f(t) = e^t-1 (2) and have generating function ...
The order-n bouquet graph B_n is a pseudograph consisting of a single vertex with n self-loops. The bouquet graph B_1 is a pseudograph that can be considered to correspond to ...
In complex analysis, a branch (also called a sheet) is a portion of the range of a multivalued function over which the function is single-valued. Combining all the sheets ...
The Wolfram Physics Project posits the existence of abstract relations between atoms of space whose pattern defines the structure of physical space. In this approach, two ...
1 ... 223|224|225|226|227|228|229 ... 1314 Previous Next

...