Search Results for ""

A space D is connected if any two points in D can be connected by a curve lying wholly within D. A space is 0-connected (a.k.a. pathwise-connected) if every map from a ...

Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...

The Davenport constant of a finite Abelian group G is defined to be the length of the longest minimal zero-system of G and is denoted D(G). Symbolically, ...

Direct search factorization is the simplest (and most simple-minded) prime factorization algorithm. It consists of searching for factors of a number by systematically ...

The edge connectivity, also called the line connectivity, of a graph is the minimum number of edges lambda(G) whose deletion from a graph G disconnects G. In other words, it ...

The edge count of a graph g, commonly denoted M(g) or E(g) and sometimes also called the edge number, is the number of edges in g. In other words, it is the cardinality of ...

Let T be a central triangle and let U(T) be its unary cofactor triangle. Then T and U(T) are perspective, and their perspector is called the eigencenter of T. Let the A-, B-, ...

A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...

An enneahedron, also called a nonahedron, is a nine-faced polyhedron. The term "enneahedron" is generally preferred over "nonahedron" since while the former combines the ...

An equichordal point is a point p for which all the chords of a curve C passing through p are of the same length. In other words, p is an equichordal point if, for every ...