Search Results for ""

Let G be a graph and S a subgraph of G. Let the number of odd components in G-S be denoted S^', and |S| the number of graph vertices of S. The condition |S|>=S^' for every ...

A left Hilbert Algebra A whose involution is an antilinear isometry is called a unimodular Hilbert algebra. The involution is usually denoted xi|->xi^*.

A weak pseudo-Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is symmetric and for which, at each m in M, g_m(v_m,w_m)=0 for all w_m in T_mM implies ...

A weak Riemannian metric on a smooth manifold M is a (0,2) tensor field g which is both a weak pseudo-Riemannian metric and positive definite. In a very precise way, the ...

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

In this illusion, the vertical lines in the above figure are parallel, but appear to be tilted at an angle. In 1860, F. Zöllner sent his discovery in a letter to physicist ...

If 1<=b<a and (a,b)=1 (i.e., a and b are relatively prime), then a^n-b^n has at least one primitive prime factor with the following two possible exceptions: 1. 2^6-1^6. 2. ...

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

Graphs corresponding to closed walks of length k are known as k-cyclic graphs, or C_k-graphs for short. C_k-graphs are connected by definition. The numbers of C_k-graphs for ...

A p-adic integer is a p-adic number of the form sum_(k=m)^(infty)a_kp^k, where m>=0, a_k are integers, and p is prime. It is sufficient to take a_k in the set {0,1,...,p-1}. ...