TOPICS
Search

Search Results for ""


801 - 810 of 2028 for Regularized SumSearch Results
A hexagonal grid is a grid formed by a tessellation of regular hexagons. Boards made of hexagonal grids are often found in strategy and role-playing games because of the lack ...
Any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal grid (i.e., the honeycomb, illustrated above). Pappus refers to the ...
Let {f_n(x)} be a sequence of analytic functions regular in a region G, and let this sequence be uniformly convergent in every closed subset of G. If the analytic function ...
A longimeter is a transparent sheet of plastic with a regular grid of lines inclined at an angle of 30 degrees to the sides of the sheet. By counting the number of squares ...
Let f(z) be an analytic function of z, regular in the half-strip S defined by a<x<b and y>0. If f(z) is bounded in S and tends to a limit l as y->infty for a certain fixed ...
A polygrammic prism is a prism formed by two regular polygrams offset along their symmetry axis and with corresponding edges connected by lateral faces. The hexagrammic prism ...
Polypons are polyforms obtained from dividing a regular triangular grid into 30-30-120 triangles, illustrated above. The numbers of polypons with n=1, 2, ... components are ...
Let there be two particularly well-behaved functions F(x) and p_tau(x). If the limit lim_(tau->0)int_(-infty)^inftyp_tau(x)F(x)dx exists, then p_tau(x) is a regular sequence ...
The Soicher graphs are three distance-regular graphs on 5346, 486, and 315 vertices, respectively. The first two are also distance-transitive but the third is not. The second ...
A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...
1 ... 78|79|80|81|82|83|84 ... 203 Previous Next

...