Search Results for ""

There are many unsolved problems in mathematics. Several famous problems which have recently been solved include: 1. The Pólya conjecture (disproven by Haselgrove 1958, ...

The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...

The arithmetic-geometric matrix A_(AG) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the ...

The winding number of a contour gamma about a point z_0, denoted n(gamma,z_0), is defined by n(gamma,z_0)=1/(2pii)∮_gamma(dz)/(z-z_0) and gives the number of times gamma ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...

The pair group of a group G is the group that acts on the 2-subsets of {1,...,p} whose permutations are induced by G. Pair groups can be calculated using PairGroup[g] in the ...

The metric tensor g on a smooth manifold M=(M,g) is said to be semi-Riemannian if the index of g is nonzero. In nearly all literature, the term semi-Riemannian is used ...

The Sombor matrix A_(Sombor) of a simple graph is a weighted adjacency matrix with weight f(d_i,d_j)=sqrt(d_i^2+d_j^2), (1) where d_i are the vertex degrees of the graph. In ...

Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...

The cyclic group C_(10) is the unique Abelian group of group order 10 (the other order-10 group being the non-Abelian D_5). Examples include the integers modulo 10 under ...