Search Results for ""

The study of number fields by embedding them in a local field is called local class field theory. Information about an equation in a local field may give information about ...

The local clustering coefficient of a vertex v_i of a graph G is the fraction of pairs of neighbors of v_i that are connected over all pairs of neighbors of v_i. Computation ...

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

Let each sphere in a sphere packing expand uniformly until it touches its neighbors on flat faces. Call the resulting polyhedron the local cell. Then the local density is ...

The conjecture that the maximum local density is given by rho_(dodecahedron).

Given a point set P={x_n}_(n=0)^(N-1) in the s-dimensional unit cube [0,1)^s, the local discrepancy is defined as D(J,P)=|(number of x_n in J)/N-Vol(J)|, Vol(J) is the ...

A local extremum, also called a relative extremum, is a local minimum or local maximum.

A field which is complete with respect to a discrete valuation is called a local field if its field of residue classes is finite. The Hasse principle is one of the chief ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

The study of a finite group G using the local subgroups of G. Local group theory plays a critical role in the classification theorem of finite groups.