Search Results for ""

A hexagrammic prism is a prism formed by two regular hexagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...

If f_1,...,f_m:R^n->R are exponential polynomials, then {x in R^n:f_1(x)=...f_n(x)=0} has finitely many connected components.

An integer kappa equal to 0 or 1 which vanishes iff the product manifold M^4×R can be given a smooth structure. Here, M^n is a compact connected topological four-manifold.

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 four planes determined by the four altitudes of a tetrahedron and the orthocenters of the corresponding faces pass through the Monge point of the tetrahedron.

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

A octagrammic prism is a prism formed by two regular octagrams offset along their symmetry axis and with corresponding edges connected by lateral faces. For an equilateral ...

A broad area of mathematics connected with functional analysis, differential equations, index theory, representation theory, and mathematical physics.

The set of all points x that can be put into one-to-one correspondence with sets of essentially distinct values of five homogeneous coordinates x_0:x_1:x_2:x_3:x_4, not all ...

A perfect matching of a graph is a matching (i.e., an independent edge set) in which every vertex of the graph is incident to exactly one edge of the matching. A perfect ...