Search Results for ""

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

A minimum vertex cut of a graph is a vertex cut of smallest possible size. A vertex cut set of size 1 in a connected graph corresponds to an articulation vertex. The size of ...

If p>1, then Minkowski's integral inequality states that Similarly, if p>1 and a_k, b_k>0, then Minkowski's sum inequality states that [sum_(k=1)^n|a_k+b_k|^p]^(1/p) ...

The group Gamma of all Möbius transformations of the form tau^'=(atau+b)/(ctau+d), (1) where a, b, c, and d are integers with ad-bc=1. The group can be represented by the 2×2 ...

Given a random variable x and a probability density function P(x), if there exists an h>0 such that M(t)=<e^(tx)> (1) for |t|<h, where <y> denotes the expectation value of y, ...

The monster group is the highest order sporadic group M. It has group order |M| = (1) = (2) where the divisors are precisely the 15 supersingular primes (Ogg 1980). The ...

In order to integrate a function over a complicated domain D, Monte Carlo integration picks random points over some simple domain D^' which is a superset of D, checks whether ...

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 ...

For elliptic curves over the rationals Q, the group of rational points is always finitely generated (i.e., there always exists a finite set of group generators). This theorem ...

The geometric centroid of the first Morley triangle, which is also the center of Morley's circle, is called the first Morley center. It has triangle center function ...