Search Results for ""

A two-graph (V,Delta) on nodes V is a collection Delta of unordered triples of the vertices (the so-called "odd triples") such that each 4-tuple of V contains an even number ...

The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...

On an algebraic curve, the sum of the number of coincidences at a noncuspidal point C is the sum of the orders of the infinitesimal distances from a nearby point P to the ...

If there is a (nu,nu^') correspondence between two curves of curve genus p and p^' and the number of branch points properly counted are beta and beta^', then ...

Diagonalize a form over the rationals to diag[p^a·A,p^b·B,...], where all the entries are integers and A, B, ... are relatively prime to p. Then the p-signature of the form ...

A magic square for which the number of letters in the word for each number generates another magic square. This definition depends, of course, on the language being used. In ...

The associahedron is the n-dimensional generalization of the pentagon. It was discovered by Stasheff in 1963 and it is also known as the Stasheff polytope. The number of ...

A braid index is the least number of strings needed to make a closed braid representation of a link. The braid index is equal to the least number of Seifert circles in any ...

The circuit rank gamma, also denoted mu (Volkmann 1996, Babić et al. 2002) or beta (White 2001, p. 56) and known as the cycle rank (e.g., White 2001, p. 56), (first) graph ...

A notation used to describe curves. The fundamental principle of Clebsch-Aronhold notation states that if each of a number of forms be replaced by a power of a linear form in ...